9043804

Parallel Computer System and Program

PublishedMay 26, 2015
Assigneenot available in USPTO data we have
Technical Abstract

Patent Claims
16 claims

Legal claims defining the scope of protection, as filed with the USPTO.

1

1. A parallel computer system for performing parallel computation, the system comprising: a plurality of computing units connected via a network, the computing units serve as a master node performing synchronization processes or as a worker node performing task processes, and one computing unit is designated as the master node and the other plurality of computing units are designated as the worker nodes, wherein the master node: sets a master determination time, before which the task processes in all the worker nodes are expected to be completed within a basic process time of each task process; transmits a process start notification to the plurality of worker nodes; checks whether a process-not-completed notification is received from any of the worker nodes at the master determination time; if the process-not-completed notification is received, the master node transmits a process extension notification to the plurality of worker nodes regardless of whether the worker nodes have completed processing of the process tasks; and if the process-not-completed notification is not received, the master node transmits a synchronization completion notification to the plurality of worker nodes; wherein the worker nodes each: set a worker determination time using the basic process time when the process start notification is received from the master node; if the task process is not completed at the worker determination time, the worker node transmits the process-not-complete notification to the master node; and if the task process is completed at the worker determination time, the worker node not sending the process-not-complete-notification and waits for the synchronization completion notification from the master node.

2

2. The parallel computer system according to claim 1 , wherein if the task process in at least one of the worker nodes has not been completed by the basic process time, the master node redefines the master determination time using a correction process time, wherein if the process extension notification is received from the master node, the worker node redefines the worker determination time using the correction process time.

3

3. The parallel computer system according to claim 2 , wherein the master node transmits the synchronization completion notification or the process start notification, together with information of the basic process time, wherein the master node transmits the process extension notification together with information of the correction process time.

4

4. The parallel computer system according to claim 2 , wherein the master node updates a value of the basic process time or correction process time using a predetermined calculation method.

5

5. The parallel computer system according to claim 1 , wherein each of the plurality of computing units comprise a plurality of communication control units, a processor, and a storage unit, the plurality of communication control units are connected to the processor, the storage unit, and the network.

6

6. The parallel computer system according to claim 5 , wherein one of the communication control units is used for transmitting and receiving the process start notification, the process-not-completed notification, the process extension notification, and the synchronization completion notification between the master node and the worker node.

7

7. The parallel computer system according to claim 5 , wherein the storage unit of the computing unit includes a memory area for storing master/worker information to identify whether the particular computing unit is the master node or the worker node.

8

8. The parallel computer system according to claim 7 , wherein the computing unit receives a program to be executed by the worker node from the computing unit serving as the master node, and stores the master/worker information in the memory area.

9

9. A program stored in a non-transitory computer readable medium and executed by a processor of a plurality of computing units connected via a network, the plurality of computing units are part of a parallel computer system for performing parallel computation the computing units each comprise the processor and the non-transitory computer readable medium, the computing units serve as a master node performing synchronization processes or as a worker node performing task processes, and one computing unit is designated as the master node and the other of the plurality of computing units are designated as the working nodes, wherein the program causes the processor of the computing unit serving as the master node to perform the steps of: setting a master determination time, before which the task processes in all the worker nodes are expected to be completed within a basic process time of each task process; transmitting a process start notification to the plurality of worker nodes; checking whether a process-not-completed notification is received from any of the worker nodes at the master determination time, when the process-not-completed notification is received, transmitting a process extension notification to the plurality of worker nodes regardless of whether the worker nodes have completed processing of the process tasks; and when the process-not-completed notification is not received, transmitting a synchronization completion notification to the plurality of worker nodes, wherein the program causes a computing unit serving as a worker node to perform the steps of: setting a worker determination time by using the basic process time when the process start notification is received from the master node; when the task process is not completed at the worker determination time, transmitting the process-not-completed notification to the master node; and when the task process is completed at the worker determination time, not sending the process-not-completed notification and waiting for the synchronization completion notification from the master node.

10

10. The program according to claim 9 , wherein when the task process in at least one of the worker nodes has not been completed by the basic process time, the program causes the processor of the computing unit serving as the master node to redefine the master determination time by using a correction process time, wherein when the process extension notification is received from the master node, the program causes the processor of the computing unit serving as the worker node to redefine the worker determination time by using the correction process time.

11

11. The program according to claim 10 , wherein the program causes the processor of the computing unit serving as the master node to perform the steps of: transmitting the synchronization completion notification or the process start notification, together with information of the basic process time; and transmitting the process extension notification together with information of the correction process time.

12

12. The program according to claim 10 , wherein the program causes the processor of the computing unit serving as the master node to update a value of the basic process time or correction process time by a predetermined calculation method.

13

13. The program according to claim 9 , wherein the program causes the processor of the computing unit to store master/worker information in the non-transitory computer readable medium to identify whether the particular computing unit is the master node or the worker node.

14

14. The program according to claim 13 , wherein the program causes the processor of the computing unit serving as the master node to transmit a program to be executed by the worker node and an initial value of the program, to the computing unit serving as the worker node.

15

15. The program according to claim 14 , wherein when the program and the initial value of the program are received, the program causes the processor of the computing unit serving as the worker node to store the master/worker information indicating the worker node into the non-transitory computer readable medium.

16

16. A method for controlling a parallel computer system for performing parallel computation by connecting a plurality of computing units via a network, the computing units serve as a master node for performing synchronization processes or as a worker node for performing task processes, and one computing unit is designated as the master node while the other of the plurality of computing units are designated as the worker nodes, the method comprising the steps of: setting, by the master node, a master determination time before which the task processes in all the worker nodes are expected to be completed within a basic process time of each task process; transmitting, by the master node, a process start notification to the plurality of worker nodes; checking, by the master node, whether a process-not-completed notification is received from any of the worker nodes at the master determination time, when the process-not-completed notification is received, transmitting, by the master node, a process extension notification to the plurality of worker nodes regardless of whether the worker nodes have completed processing of the process tasks; when the process-not-completed notification is not received, transmitting, by the master node, a synchronization completion notification to the plurality of worker nodes; setting, by each worker node, a worker determination time by using the basic process time when the process start notification is received from the master node; when the task process is not completed at the worker determination time, transmitting, by each worker node, the process-not-completed notification to the master node; and when the task process is completed at the worker determination time, not sending, by the worker node, the process-not-completed notification and waiting, by each worker node, for the synchronization completion notification from the master node.

Patent Metadata

Filing Date

Unknown

Publication Date

May 26, 2015

Inventors

Masaki HAMAMOTO
Tetsuya YAMADA
Atsushi TOMODA
Atsushi MIYAMOTO

Want to explore more patents?

Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.

Citation & reuse

Analysis on this page is generated by Patentable — an AI-powered patent intelligence platform. AI-generated summaries, explanations, and analysis may be reused with attribution and a visible link back to the canonical URL below. Patent abstracts and claims are USPTO public domain.

Cite as: Patentable. “PARALLEL COMPUTER SYSTEM AND PROGRAM” (9043804). https://patentable.app/patents/9043804

© 2026 Patentable. All rights reserved.

Patentable is a research and drafting-assistant tool, not a law firm, and does not provide legal advice. Documents we generate are drafts for review by a licensed patent attorney.

PARALLEL COMPUTER SYSTEM AND PROGRAM — Masaki HAMAMOTO | Patentable