Abstract: In a parallel computing system having a plurality of computing node groups including at least one spare computing node group, a plurality of managing nodes for allocating jobs to the computing node groups and an information management server having respective computing node group status information are associated with the computing node groups, and the respective managing nodes update respective in-use computing node group status information by accessing the information management server. Furthermore, when the managing node detects an occurrence of a failure, the managing node having used then the computing node group disabled due to the failure identifies a spare computing node group by accessing the computing node group status information in the information management server. Then, the managing node having used then the disabled computing node group obtains the computing node group information of the identified spare computing node group.

Abstract: A simulation system having multiple peripherals that communicate with each other. The system includes a weighted graph with weights set as communication times. The peripherals are represented as nodes and connection paths are represented as edges. Among the communication times in the loop, the minimum time is set as first synchronization timing. Timing with an acceptable delay added is set as second synchronization timing. Timing set by a user to be longer than the first and second timings is set as third synchronization timing. The third synchronization timing is used in a portion where the timing is usable, thus synchronizing the peripherals at the longest possible synchronization timing.

Abstract: There is provided a system including a cluster 11, a cluster 12 and an image server 20. A host 101a constituting the cluster 11 has a root file system 111a used to operate the host 101a in a local disk. The image server 20 has a root file system 221a used to operate the host 101a, and the host 101a virtually constructs a root file system 121a by mounting the root file system 221a. When the root file system 111a is varied, the host 101a synchronizes the root file system 111a with the root file system 121a. The same applies to host 102a constituting the cluster 12.

Abstract: A method for controlling a simulation system includes storing first-stage and second stage tables in which a value of a predicted time until arrival of an I/O instruction and a type of the instruction are included as entries for each program counter of an instruction set simulator, and in which a value of an earliest time until an output event from a peripheral simulator is included as an entry for each type of instruction; looking up the first-stage table to obtain the type of the instruction and the value of the predicted time until arrival of the instruction, looking up the second-stage table with reference to the obtained type of the instruction to obtain the value of the earliest time until the output event from the peripheral simulator, and returning the predicted time until arrival of the instruction and the earliest time until the output event from the peripheral simulator.

Abstract: A DMA transfer technique which can be adapted to “hardware in the loop simulation” (HILS) and which requires less overhead. In a computer system having a data transfer device, a continuous DMA mechanism successively and repeatedly outputs a data transfer request in response to an enable process. A simulation system for HILS places data as a result of the simulation in a predetermined area in a memory and transfers the data from the memory to the continuous DMA mechanism together with generation ID data. The continuous DMA mechanism stores the transferred generation ID as a received ID, and receives the transferred data in response to the event that the transferred generation ID differs from the received ID being stored. The continuous DMA mechanism successively repeats the data transfer request until it is disabled.

Abstract: A simulation system having multiple peripherals that communicate with each other. The system includes a weighted graph with weights set as communication times. The peripherals are represented as nodes and connection paths are represented as edges. Among the communication times in the loop, the minimum time is set as first synchronization timing. Timing with an acceptable delay added is set as second synchronization timing. Timing set by a user to be longer than the first and second timings is set as third synchronization timing. The third synchronization timing is used in a portion where the timing is usable, thus synchronizing the peripherals at the longest possible synchronization timing.

Abstract: There is provided a system including a cluster 11, a cluster 12 and an image server 20. A host 101a constituting the cluster 11 has a root file system 111a used to operate the host 101a in a local disk. The image server 20 has a root file system 221a used to operate the host 101a, and the host 101a virtually construct a root file system 121a by mounting the root file system 221a. When the root file system 111a is varied, the host 101a synchronizes the root file system 111a with the root file system 121a. The same applies to host 102a constituting the cluster 12.

Abstract: In a parallel computing system having a plurality of computing node groups including at least one spare computing node group, a plurality of managing nodes for allocating jobs to the computing node groups and an information management server having respective computing node group status information are associated with the computing node groups, and the respective managing nodes update respective in-use computing node group status information by accessing the information management server. Furthermore, when the managing node detects an occurrence of a failure, the managing node having used then the computing node group disabled due to the failure identifies a spare computing node group by accessing the computing node group status information in the information management server. Then, the managing node having used then the disabled computing node group obtains the computing node group information of the identified spare computing node group.

Abstract: A fixed disk storage unit is mounted in a protective outer case and is supported by elastic shock absorbers. A head/disk enclosure including a rotatable disk and a head actuator of the fixed disk storage unit therein, and an electronic card on which electronic circuits are mounted, are placed abreast with a gap there between on substantially the same plane in the protective outer case, and the head/disk enclosure is supported on all sides including the side next to the gap by the shock absorbers. This construction provides a shockproof and portable disk storage apparatus which is small-sized and whose manufacturing process is simple.

Abstract: A fixed disk storage unit is mounted in a protective outer case, and is supported at one end by a flexible cable which connects a connector of the protective outer case with the fixed disk storage unit in the protective outer case, and supported at the other end by using elastic shock absorbers against the elasticity of the flexible cable. A head/disk enclosure including a rotatable disk and a head actuator of the fixed disk storage unit therein, and an electronic card on which electronic circuits are mounted, are placed abreast on substantially the same plane in the protective outer case, and the head/disk enclosure is supported by the shock absorbers. This construction provides a shockproof and portable disk storage apparatus which is small-sized and whose manufacturing process is simple.