Abstract:
PROBLEM TO BE SOLVED: To improve the communication efficiency when a replica is updated by providing a control means etc., which controls the updating execution timing of the replica set in response to a received changing request based on the information included in the changing request regardless of the receiving order of the changing request. SOLUTION: A replica controller 7 adds an access to be given the data stored in a data storing device 17 and also a packet transmission request to be given to a transmission queue 9 based on the access request given from an application 5. Then the controller 7 executes the updating of a replica in the designating timing and in response to the changing request stored in a reception queue 11 by referring to the state of the queue 11. The collisions of plural application 5 and the collision caused by the application 5 between the updating of data and the data updating request included in the queue 11 are not treated, and the execution of the data changing to be carried out by the application 5 is independent of the execution of the data changing request included in the queue 11.
Abstract:
PROBLEM TO BE SOLVED: To improve performance in the reading/writing of data in a magnetic disk by rearranging data on a magnetic disk under the control of a hard disk device itself. SOLUTION: In this file managing system equipped with a hard disk device 10 and a file managing part 20, the file managing part 20 manages data to be read/written in the hard disk device 10 in order to make data in one file continue in a predetermined logical address space, and designates object data whose reading/writing in the hard disk device 10 is requested with a predetermined logical address in the logical address space. The hard disk device 10 executes the reading/writing processing of data by converting the predetermined logical address to designate the object data whose reading/writing is requested into an LBA. Then, the defragmentation of the data recorded in a magnetic disk 11 is executed based on the predetermined logical address. COPYRIGHT: (C)2005,JPO&NCIPI
Abstract:
PROBLEM TO BE SOLVED: To allow the linking between applications by the access to a file. SOLUTION: This system has a file system interface means 3 converting the directory name and file name via an operating system interface according to a file system common interface 9, a bypass means preforming input/output beyond the file system common interface 9 and an operating system interface 7 when the input from the file system interface means 3 is received and a conversion means interpreting the directory name and the file name and converting them into the commands to proper programs when the input is received from the bypass means and a preliminarily determined directory name is designated.
Abstract:
To provide a system and a communication method which enable efficient packet communication by transmitting and receiving multiple packets exclusively in time and space. [Solving means] The system includes multiple nodes performing radio communication. Each node stores routing information therein, and determines a transmission path by use of the routing information, and performs cut-through transmission by transmitting and receiving packets to a transfer destination node and from a transfer source node on the determined transmission path through transmission and reception radio waves each given a certain directivity by controlling their phases. In the system, time synchronization and transmission and reception of packet communication records are performed during a certain time period by carrying out the cut-through transmission while controlling the phases of the transmission and reception radio waves so that all of the nodes form one or more closed loops. At a time other than the certain time period, the node transmits and receives packets in accordance with the routing information and a time frame assigned to each of the nodes as a time when the each node is allowed to transmit and receive a packet, the routing information held in each of the nodes and updated on the basis of the packet communication records whose information is shared by the nodes after the time synchronization.
Abstract:
PROBLEM TO BE SOLVED: To optimally schedule a plurality of computing processes including all-to-all (A2A) communication across a plurality of nodes (processors) constituting an n-dimensional (torus or mesh) network.SOLUTION: The plurality of nodes (processors) constituting a network are partitioned into a communication (computing process) phase (A2A-L) requiring all-to-all communication for only among a plurality of nodes included in a first partial group, and a communication (computing process) phase (A2A-P) requiring all-to-all communication for only among a plurality of nodes included in a second partial group, and the phases are made to overlap for parallel processing across a plurality of threads (thread 1, thread 2, thread 3, and thread 4). Parallel processing can be performed for such a plurality of computing processes as FFT (Fast Fourier Transform) and T (transpose) (internal transpose) as well.
Abstract:
PROBLEM TO BE SOLVED: To provide an effective cache system in a computer system using an NAS server. SOLUTION: A front end server 10, for temporarily holding an operation request for the NAS server 20 which is sent from a predetermined client 30, is interposed between the NAS server and the clients 30 on a network. The front end server 10 holds information on mutual relationship of data files stored in the NAS server 20, optimizes an operation request received from the client 30 on the basis of the information, and transmits the optimized operation request to the NAS server 20. COPYRIGHT: (C)2005,JPO&NCIPI
Abstract:
PURPOSE: To decompose a packet into each component and also to assign a main storage area, without software intervention in receiving processing of a communication network. CONSTITUTION: A hardware directly performs a division operation without software intervention, by adding control information which can directly be used by a receiving end DMA feature to a communication packet. A transmitting side DMA mechanism transfers the content itself of a DMA command queue to a communication controller, before data on a computer memory is transferred to the communication controller. The information is added to the front of a packet and delivered to the receiving side. The receiving side DMA mechanism does not transfer entire packets to a single receiving buffer but performs data transfer for each element data to different receiving buffers by using both the information and information in a DMA command queue of the receiving side. Communication software uses each receiving buffer as it is, without copying it to other areas.
Abstract:
PROBLEM TO BE SOLVED: To acquire a checkpoint when advancing computer calculation of an iteration method in parallel, and to efficiently utilize the acquired data upon restoration.SOLUTION: When acquiring the checkpoint in parallel calculation of repeating the iteration method such as time evolution calculation, calculation is not stopped independently in each node and the checkpoint is acquired in parallel with the calculation. Thus, the need of stopping the calculation during checkpoint acquisition time is eliminated, and the calculation and the checkpoint acquisition are simultaneously performed. When the calculation is not an I/O bottleneck, the checkpoint acquisition time is concealed and execution time is reduced. In the method, checkpoint data including values at different points of time during acquisition processing is acquired, and by limiting a use to convergence calculation of iteration method, coexistence of the values at the different points of time in the checkpoint data is allowed in the problem that a convergence destination is independent of an initial value.
Abstract:
PROBLEM TO BE SOLVED: To provide a system and a method for increasing the throughput of a system by guaranteeing the deadline of a real-time process on a CPU that uses an SMT, while implementing as many other processes as possible concurrently, and to provide a recording medium on which a program providing the functions thereof is recorded. SOLUTION: The system includes a measuring part 61 for measuring the computational complexity for a process obtained through a calculation process implemented by a processor 41 serving as a calculation resource; an extra time determining part 62 that causes an interrupt in the calculation process by the processor 41 to obtain the computational complexity obtained up to the time of the interrupt from the measuring part 61 and give the obtained amount of calculations to the processor 41 to calculate extra time and determine whether or not there is extra time; and a process interrupting part 63 that causes the processor 41 to interrupt the calculations of the other processes if the extra time determining part 62 determines that there is no extra time. COPYRIGHT: (C)2005,JPO&NCIPI
Abstract:
Eine Vielzahl von Berechnungsverfahren einschließlich All-to-All Kommunikation (A2A) wird optimal zwischen einer Vielzahl von Knoten (Prozessoren), die ein n-dimensionales (Ring oder Maschen)-Netzwerk bilden, geplant. Die Vielzahl von Knoten (Prozessoren), die das Netzwerk formen, sind aufgeteilt in eine Kommunikations- (Berechnungsverfahren) Phase (A2A-L), in der All-to-All Kommunikation nur zwischen einer Vielzahl von Knoten, enthalten in einer ersten Teil-Gruppe, erforderlich ist, und eine Kommunikations- (Berechnungsverfahren) Phase (A2A-P), in der All-to-All Kommunikation nur zwischen einer Vielzahl von Knoten, enthalten in einer zweiten Teil-Gruppe, erforderlich ist, und die Phasen werden gebildet, um für die parallele Verarbeitung über eine Vielzahl von Threads(Thread 1, Thread 2, Thread 3 und Thread 4) zu überlappen. Die parallele Verarbeitung kann für eine solche Vielzahl von Berechnungsverfahren wie FFT (schnelle Fourier-Transformation) und auch T (Transponierte) (interne Transponierte) durchgeführt werden.