Title:
Parallel arithmetic system, parallel arithmetic management apparatus, and computer product
Kind Code:
A1

Abstract:
In a parallel arithmetic system and a parallel arithmetic management apparatus, arithmetic processes are generated in a plurality of computers, data is distributed and allocated to the arithmetic processes generated to perform arithmetic operations on the data in parallel, allocation status of the data allocated is stored, load status of the computers is acquired, and if the data allocation needs to be changed, a change in the data allocation is calculated, and the data is distributed between the computers based on the change in the data allocation calculated.

Inventors:
Matsubara, Masazumi (Kawasaki, JP)
Application Number:
11/017910
Publication Date:
05/26/2005
Filing Date:
12/22/2004
Export Citation:
Assignee:
Fujitsu Limited (Kawasaki, JP)
Primary Class:
International Classes:
G06J1/00; (IPC1-7): G06J1/00
View Patent Images:
Related US Applications:
 20050091292 Classificatory accounting calculator structure April, 2005 Pai 20060230093 Digital signal processing circuit having a pattern detector circuit for convergent rounding October, 2006 New et al. 20080222474 Pseudorandom number generator, semiconductor integrated circuit, pseudorandom number generator control apparatus, pseudorandom number generator control method, and computer product September, 2008 Hiraide et al. 20080256156 Reliable and Efficient Computation of Modal Interval Arithmetic Operations October, 2008 Hayes 20090089274 GRADIENT BASED OPTIMIZATION OF A RANKING MEASURE April, 2009 Chapelle 20080034026 Method for improving computation precision in fast Fourier transform February, 2008 Guo et al. 20080109508 SYSTEM HAVING A CARRY LOOK-AHEAD (CLA) ADDER May, 2008 Kenkare et al. 20090063599 FAST COMPUTATION OF PRODUCTS BY DYADIC FRACTIONS WITH SIGN-SYMMETRIC ROUNDING ERRORS March, 2009 Reznik 20090016523 Masking and Additive Decomposition Techniques for Cryptographic Field Operations January, 2009 Dupaquis et al. 20080109504 Low cost, high purity sign wave generator May, 2008 Mcdonald 20080092011 Turbo decoding apparatus April, 2008 Ikeda

Primary Examiner:
ZHEN, LI B
Attorney, Agent or Firm:
STAAS & HALSEY LLP (WASHINGTON, DC, US)
Claims:
1. A computer program that includes instructions, which when executed, make a computer execute: generating arithmetic processes in a plurality of computers; distributing data to the arithmetic processes generated; allocating the data to the arithmetic processes generated, to perform arithmetic operations on the data in parallel; storing allocation information representing allocation status of the data allocated; acquiring load information representing load status of the computers; deciding whether the data allocated needs to be changed, based on the allocation information and the load information; calculating a change in the data allocation, if it is decided at the deciding that the data allocated needs to be changed; and data distributing including distributing the data between the computers based on the change in the data allocation calculated.

2. The computer program according to claim 1, wherein at the acquiring, the arithmetic processes generated acquire a time required for the arithmetic operation of a predetermined amount of the data as the load information.

3. The computer program according to claim 2, further comprising: detecting, from among the plurality of the computers, the computer that can generate the arithmetic process; and generating a new arithmetic process in the computer detected.

4. The computer program according to claim 3, further comprising: moving the data allocated to a predetermined computer from the predetermined computer to another computer; and terminating the arithmetic process in the predetermined computer.

5. The computer program according to claim 4, further comprising: a progress storing including storing a progress of the arithmetic operations on the data in the arithmetic processes; and restarting the arithmetic operations on the data in different arithmetic processes based on the progress stored and the allocation information.

6. A parallel arithmetic system that generates arithmetic processes in a plurality of computers, and distributes and allocates data to the arithmetic processes generated, to thereby perform arithmetic operations on the data in parallel, comprising: an allocation information storing unit that stores allocation information representing allocation status of the data allocated; a load information acquiring unit that acquires load information representing load status of the computers; a data allocation deciding/calculating unit that decides whether the data allocated to the computers needs to be changed, based on the allocation information and the load information, and calculates a change in the data allocation if it is decided that the data allocated needs to be changed; and a data distributing unit that distributes the data between the computers based on the change in the data allocation calculated.

7. The parallel arithmetic system according to claim 6, wherein the load information acquiring unit acquires, as the load information, a time required for the arithmetic processes generated to perform the arithmetic operation of a predetermined amount of the data.

8. The parallel arithmetic system according to claim 7, further comprising: a detecting/generating unit that detects, from among the plurality of the computers, the computer that can generate the arithmetic process, and generates a new arithmetic process in the computer detected.

9. The parallel arithmetic system according to claim 8, further comprising: a moving/process terminating unit that moves the data allocated to a predetermined computer from the predetermined computer to another computer, and terminates the arithmetic process in the predetermined computer.

10. The parallel arithmetic system according to claim 9, further comprising: a progress storing unit that stores a progress of the arithmetic operations on the data in the arithmetic processes; and a process restarting unit that restarts the arithmetic operations on the data in different arithmetic processes based on the progress stored and the allocation information.

11. The parallel arithmetic system according to claim 6, wherein the allocation information storing unit, the load information acquiring unit, and the data allocation deciding/calculating unit are provided in one of the computers.

12. The parallel arithmetic system according to claim 6, wherein the allocation information storing unit, the load information acquiring unit, and the data allocation deciding/calculating unit are arranged in a housing independent of the computers.

13. A parallel arithmetic management apparatus that generates arithmetic processes in a plurality of computers, and distributes and allocates data to the arithmetic processes generated, to thereby perform arithmetic operations on the data in parallel, comprising: an allocation information storing unit that stores allocation information representing allocation status of the data allocated; a load information acquiring unit that acquires load information representing load status of the computers; a data allocation deciding/calculating unit that decides whether the data allocated to the computers needs to be changed, based on the allocation information and the load information, and calculates a change in the data allocation if it is decided that the data allocated needs to be changed; and a distribution command transmitting unit that transmits a command to move the data to the computers based on the change in the data allocation calculated.

14. The parallel arithmetic management apparatus according to claim 13, wherein the load information acquiring unit acquires, as the load information, a time required for the arithmetic processes generated to perform the arithmetic operation of a predetermined amount of the data.

15. The parallel arithmetic management apparatus according to claim 14, further comprising: a detecting/generating unit that detects, from among the plurality of the computers, the computer that can generate the arithmetic process, and generates a new arithmetic process in the computer detected.

16. The parallel arithmetic management apparatus according to claim 15, further comprising: a moving/process terminating unit that moves the data allocated to a predetermined computer from the predetermined computer to another computer, and terminates the arithmetic process in the predetermined computer.

17. The parallel arithmetic management apparatus according to claim 16, further comprising: a progress storing unit that stores a progress of the arithmetic operations on the data in the arithmetic processes; and a process restarting unit that restarts the arithmetic operations on the data in different arithmetic processes based on the progress stored and the allocation information.

18. The parallel arithmetic management apparatus according to claim 13, wherein the parallel arithmetic management apparatus is provided in any one of the computers.

19. The parallel arithmetic management apparatus according to claim 13, wherein the parallel arithmetic management apparatus is arranged in a housing independent of the computers.

20. A parallel arithmetic method comprising: generating arithmetic processes in a plurality of computers; distributing data to the arithmetic processes generated; allocating the data to the arithmetic processes generated, to perform arithmetic operations on the data in parallel; storing allocation information representing allocation status of the data allocated; acquiring load information representing load status of the computers; deciding whether the data allocated needs to be changed, based on the allocation information and the load information; calculating a change in the data allocation, if it is decided at the deciding that the data allocated needs to be changed; and data distributing including distributing the data between the computers based on the change in the data allocation calculated.

21. A computer-readable recording medium that stores therein a parallel arithmetic program including instructions, which when executed, make a computer execute: generating arithmetic processes in a plurality of computers; distributing data to the arithmetic processes generated; allocating the data to the arithmetic processes generated, to perform arithmetic operations on the data in parallel; storing allocation information representing allocation status of the data allocated; acquiring load information representing load status of the computers; deciding whether the data allocated needs to be changed, based on the allocation information and the load information; calculating a change in the data allocation, if it is decided at the deciding that the data allocated needs to be changed; and data distributing including distributing the data between the computers based on the change in the data allocation calculated.

Description:

# BACKGROUND OF THE INVENTION

1) Field of the Invention

The present invention relates to a technology for performing arithmetic operations of the data in parallel.

2) Description of the Related Art

A conventional system is known that arithmetically processes a large amount of data efficiently, a parallel arithmetic system that operates a plurality of computers in parallel. In the conventional parallel arithmetic system, processes that perform arithmetic operations of data for the computers are generated, and the data is distributed to the processes to perform arithmetic operations, thereby making the arithmetic operations on the data efficient.

In the conventional parallel arithmetic system, when a load on a predetermined computer increases or when processing abilities of the computers are different from each other, load distribution is performed in units of processes.

More specifically, the number of processes generated for those computers having large load or low processing ability is reduced, and the number of processes generated for those computers having small load or high processing ability is increased, thereby performing scheduling depending on the abilities and the load status of-the computers.

A function that moves data between processes is given to the processes themselves, to move data from a computer having a large load to a computer having a small load, so that load distribution is realized.

However, in load distribution performed in units of processes in a conventional parallel arithmetic system, the units of the load distribution becomes rough, thereby making it impossible to perform sufficient load distribution. Moreover, in the conventional parallel arithmetic system, the number of processes determined at the start of an arithmetic operation cannot be changed.

On the other hand, if memory images of in-execution processes are stored as is, and if a function that continues processing in another computer is provided, binary compatibility is necessary to completely operate this function. More specifically, in a conventional parallel arithmetic system, moving data between the computers is restricted.

# SUMMARY OF THE INVENTION

It is an object of the invention to at least solve the problems in the conventional technology.

A parallel arithmetic system according to an aspect of the present invention generates arithmetic processes in a plurality of computers, and distributes and allocates data to the arithmetic processes generated, to thereby perform arithmetic operations on the data in parallel. The parallel arithmetic system includes an allocation information storing unit that stores allocation information representing allocation status of the data allocated; a load information acquiring unit that acquires load information representing load status of the computers; a data allocation deciding/calculating unit that decides whether the data allocated to the computers needs to-be changed, based on the allocation information and the load information, and calculates a change in the data allocation if it is decided that the data allocated needs to be changed; and a data distributing unit that distributes the data between the computers based on the change in the data allocation calculated.

A parallel arithmetic management apparatus according to another aspect of the present invention generates arithmetic processes in a plurality of computers, and distributes and allocates data to the arithmetic processes generated, to thereby perform arithmetic operations on the data in parallel. The parallel arithmetic management apparatus includes an allocation information storing unit that stores allocation information representing allocation status of the data allocated; a load information acquiring unit that acquires load information representing load status of the computers; a data allocation deciding/calculating unit that decides whether the data allocated to the computers needs to be changed, based on the allocation information and the load information, and calculates a change in the data allocation if it is decided that the data allocated needs to be changed; and a, distribution command transmitting unit that transmits a command to move the data to the computers based on the change in the data allocation calculated.

A parallel arithmetic method according to another aspect of the present invention includes generating arithmetic processes in a plurality of computers; distributing data to the arithmetic processes generated; allocating the data to the arithmetic processes generated, to perform arithmetic operations on the data in parallel; storing allocation information representing allocation status of the data allocated; acquiring load information representing load status of the computers; deciding whether the data allocated needs to be changed, based on the allocation information and the load information; calculating a change in the data allocation, if it is decided at the deciding that the data allocated needs to be changed; and data distributing including distributing the data between the computers based on the change in the data allocation calculated.

A computer program according to still another aspect of the present invention stores therein a computer program including instructions, which when executed, make a computer execute the above method.

A computer-readable recording medium according to still another aspect of the present invention stores therein a computer program including instructions, which when executed, make a computer execute the above method.

The other objects, features, and advantages of the present invention are specifically set forth in or will become apparent from the following detailed description of the invention when read in conjunction with the accompanying drawings.

# BRIEF DESCRIPTION. OF THE DRAWINGS

FIG. 1 is a schematic diagram of a parallel arithmetic system according to the present invention;

FIG. 2 is a diagram for explaining an operation of the parallel arithmetic system;

FIG. 3A illustrates entire data to be arithmetically operated;

FIG. 3B illustrates a data distribution table that represents distribution of the data shown in FIG. 3A;

FIG. 3C illustrates a data allocation table that represents allocation of the entire data shown in FIG. 3A;

FIG. 4A illustrates a data distribution table when a load state changes;

FIG. 4B illustrates a data allocation table when the load state changes;

FIG. 5 is a flowchart of a process procedure of a computer in the parallel arithmetic system;

FIG. 6 is a flowchart of a process procedure of a parallel arithmetic management apparatus;

FIG. 7 illustrates an example of a data dividing method; and

FIG. 8A illustrates an entire data that includes data of different data types;

FIG. 8B illustrates a data distribution table for the data shown in FIG. 8A.

# DETAILED DESCRIPTION

Exemplary embodiments of a parallel arithmetic system, a parallel arithmetic management apparatus, and a computer product according to the present invention will be described below in detail with reference to the accompanying drawings.

FIG. 1 is a schematic diagram of the schematic configuration of a parallel arithmetic system according to the embodiment. As shown in FIG. 1, the parallel arithmetic system includes a parallel arithmetic management apparatus 1, a computer 10, a computer 20, a computer 30, and a computer 40. The parallel arithmetic management apparatus 1 is connected to the computers 10, 20, 30, and 40 to manage and schedule processes generated in the computers.

The computer 10 includes a communicating unit 11, a process executing unit 12, and a data storage unit 13. The process executing unit 12 functions as a node that executes the processes generated by the parallel arithmetic management apparatus 1. The data storage unit 13 stores data that is arithmetically processed by the process executing unit 12. The communicating unit 11 is connected to the parallel arithmetic management apparatus 1 and the computer 20.

The computer 20 also includes a communicating unit 21, a process executing unit 22, and a data storage unit 23. The process executing unit 22 functions as a node that executes the processes formed by the parallel arithmetic management apparatus 1. The data storage unit 23 stores data that is arithmetically processed by the process executing unit 22. In addition, the communicating unit 21 is connected to the parallel arithmetic management apparatus 1, the computer 10, and the computer 30.

The communicating units 31 and 41, process executing units 32 and 42, and data storage units 33 and 43 are arranged in the computers 30 and 40, respectively. The process executing units 32 and 42 function as nodes that execute the processes formed by the parallel arithmetic management apparatus 1. The data storage units 33 and 43 store data that is arithmetically processed by the process executing units 32 and 42. In addition, the communicating unit 31 is connected to the parallel arithmetic management apparatus 1, the computer 20, and the computer 40, and the communicating unit 41 is connected to the parallel arithmetic management apparatus 1 and the computer 30.

On the other hand, the parallel arithmetic management apparatus 1 includes a communicating unit 3 and a main control unit 2. The communicating unit 3 is connected to an allocation information storage unit 4, a data allocation calculating unit 5, a load information acquiring unit 6, a process control unit 7, and an arithmetic progress storage unit 8. The communicating unit 3 is connected to the communicating unit 11 in the computer 10, the communicating unit 21 in the computer 20, the communicating unit 31 in the computer 30, and the communicating unit 41 in the computer 40.

The process control unit 7 in the parallel arithmetic management apparatus 1 forms and deletes processes for the computers 10, 20, 30, and 40. The allocation information storage unit 4 stores allocation status of the data for the computers, i.e., allocations of the data processed by the processes generated by the computers, as allocation information. In addition, the load information acquiring unit 6 acquires load states of the computers, and stores the load states as load information.

The load states of the computers are determined by processing abilities of the computers themselves and the numbers of processes processed by the computers at a point of time. More specifically, the load states are values representing processing abilities of the computers at a predetermined point of time. It is assumed that the load states mean processing abilities of the computer themselves at the predetermined time, and that the load information means the data representing the load states.

The data allocation calculating unit 5 schedules the data allocation to the computers, based on the allocation information stored in the allocation information storage unit 4 and the load information acquired by the load information acquiring unit 6. The arithmetic progress storage unit 8 stores progress of arithmetic operations performed by the computers.

When arithmetic processing of data is performed by the parallel arithmetic system, as shown in FIG. 2, processes are generated in the computers to start data processing. The load states of the computers are acquired by the load information acquiring unit 6 of the parallel arithmetic management apparatus 1. The data allocation calculating unit 5 in the parallel arithmetic management apparatus 1 performs the scheduling. More specifically, the data allocation calculating unit 5 decides whether it is necessary to perform load distribution by moving the data. In this case, the decision whether the load distribution is necessary is realized by comparing the load states of the computers with each other to decide whether a computer has an outstandingly large load. At this time, a predetermined threshold may be set to compare the load information with the threshold. Because the load dispersion increases overhead costs, a tolerance of loads is determined by setting a threshold, thereby avoiding an increase in the unnecessary overhead costs.

When the load distribution must be performed, the data allocation calculating unit 5 calculates amounts of the data allocated to the computers based on the allocation information and the load information. In addition, the data allocation calculating unit 5 transmits calculation results to the respective computers. The computers 10, 20, and 30 move the data between the computers based on the calculation results received.

In this manner, the pieces of load information of the computers are acquired, and the data are moved between the computers based on the load information to change amounts of data allocated to the computers, to achieve load distribution. Because the load distribution is based on the amounts of data, the load distribution can be flexibly performed. In addition, because the loads can be distributed by moving the data between the computers, memory images need not be stored. Therefore, the load distribution does not require binary compatibility, and the load distribution can be performed between different architectures.

Allocation information stored in the allocation information storage unit 4 will be described below with reference to FIGS. 3A to 3C. FIG. 3A illustrates entire data 61 representing entire data to be arithmetically operated, FIG. 3B illustrates a data distribution table 62 that represents distribution of the data to the processes. FIG. 3C illustrates a data allocation table 63 that represents allocation of the entire data shown in FIG. 3A to the processes.

As shown in FIG. 3A, the entire data 61 includes information related to data arrangement A. The information included in the entire data 61 related to data arrangement A is required to handle data arrangement A, and does not include the actual data included in data arrangement A. In this case, the entire data 61 includes, with respect to data arrangement A, a data type “integer”, the number of dimensions “two”, a data size “200×200”, and a dimension “1” in division.

As shown in FIG. 3B, the entire data, i.e., 25% of data arrangement A is allocated to process 1. Similarly, 25% of data arrangement A is allocated to process 2, and 25% of data arrangement A is allocated to processes 3 and 4 each.

Processes 1 to 4 mentioned here indicate the processes to be executed in the computers 10, 20, 30, and 40. A single computer can also be caused to execute a plurality of processes. However, the computer 10 is caused to execute process 1, the computer 20 is caused to execute process 2, the computer 30 is caused to execute process 3, and the computer 40 is caused to execute process 4.

The data allocation table 63 shown in FIG. 3C represents allocation of the data of data arrangement A shown in FIG. 3A to the processes. According to the entire data 61, the size of data arrangement A is “200×200”, and a dimension in division is “1”. According to the data distribution table 62, 25% of data is allocated to processes 1 to 4 each. Therefore, data allocated to each of processes 1 to 4 has a size of “200×50”.

In FIGS. 3A to 3C, data is equally distributed on the assumption that the load states of the computers 10, 20, 30, and 40 are equal. However, when a status in which some computer simultaneously executes the other process occurs, the load states of the computers are not equal to each other. When a new computer that can execute a process is introduced, a process is also generated for the computer, and the number of parallel processes is desirably increased.

FIGS. 4A and 4B are diagrams of relative information obtained when a load state changes after the state shown in FIGS. 3A to 3C. FIGS. 4A and 4B represent a state in which the processing abilities of process 1 and process 2 are half of those of process 3 and process 4, and process 5 is generated for another computer.

FIG. 4A illustrates a data distribution table 62a that represents distribution of data to the processes. FIG. 4B illustrates a data allocation table 63b that represents allocation of data of the entire data shown in FIG. 4A to processes. In this case, the entire data is the same as the entire data 61 shown in FIG. 3A.

As shown in FIG. 4A, when a large load acts on the computer 10 thereby decreasing the processing ability of the computer 10, the data allocated to the process 1 executed in the computer 10 is reduced. In this case, as indicated in the data distribution table 62a, 12.5% of the data are allocated to the process 1. Similarly, when a large load acts on the computer 20 thereby decreasing the processing ability of the computer 20, the data allocated to the process 2 executed in the computer 20 is reduced. In this case, as indicated in the data distribution table 62a, 12.5% of the data are allocated to the process 2. In addition, a new process 5 is generated, as shown in FIG. 4B, and 25% of the data are allocated to the process 5.

Therefore, in the data allocation table 63a shown in FIG. 4B, the sizes of the data allocated to the process 1 and the process 2 of the data arrangement A are “200×25” each, and the sizes of the data allocated to the process 3, the process 4, and the process 5 are “200×50” each.

In this manner, the data allocation calculating unit 5 allocates all the data to the processes in advance, and changes the amounts of the data to be allocated depending on the load states of the processes. At this time, the data allocation calculating unit 5 transmits the changed allocation of data i.e., the data allocation table 63a, to the computers through the communicating unit 3.

The communicating units 11, 21, 31, and 41 of the computers each receive the data allocation table 63a, and the data stored in the data storage units 13, 23, 33, and 43 are moved through the communicating units 11, 21, 31, and 41 based on the contents of the data allocation table 63a. The movement of the data is directly performed between the computers without using the parallel arithmetic management apparatus 1.

Acquisition of the load states of the computers will be described below. The processes formed on the computers by the process control unit 7 include a synchronous point in a main loop that performs data processing. When the processing reaches the synchronous point, each process transmits a time at which the processing reaches the synchronous point, to the parallel arithmetic management apparatus 1. Because each process generally executes the main loop a plurality of times, intervals between the times at which the processing reaches the synchronous point is calculated to make it possible to acquire load states of the computers. For example, when another process is not executed in a computer, the entire processing ability of the computer can be used, and the interval between the times at which the processing reaches the synchronous point becomes short. On the other hand, when another process is executed in a computer, the processing ability of the computer that can be used in the processes decreases, and the interval between the times at which the processing reaches the synchronous point becomes long.

Even though another process is not executed, a process executed in a computer having a high processing ability has a short interval between the times at which processing reaches the synchronous point, and a process executed in a computer having a low processing ability has a long interval between times at which processing reaches the synchronous point. When the data is to be allocated to a process, the necessary information is information representing how much processing the process can execute. Therefore, it is desirable that a larger amount of data be allocated to a process having a short interval between the times at which the processing reaches a synchronous point, to thereby achieve a high processing ability.

More specifically, when the interval between the times at which the processing reaches the synchronous point is used as the load information, a processing ability obtained by adding a load caused by a process in the processing to the original processing ability of the computer can be acquired.

A processing operation of the parallel arithmetic system according to the embodiment will be described below with reference to FIG. 5 and 6. FIG. 5 is a flowchart of a process procedure of a computer in the parallel arithmetic system, and FIG. 6 is a flowchart of a process procedure of a parallel arithmetic management apparatus. The process procedure of the computer will be described below with reference to FIG. 5 by using the computer 10 as an example.

In FIG. 5, the computer 10 receives a designation of process generation from the process control unit 7 and generates a process in the process executing unit 12 (step S101). The computer 10 receives data allocated based on allocation information stored in the allocation information storage unit 4 (step S102). The data is transmitted from another computer and received through the communicating unit 11.

An arithmetic operation of the data starts in the process executing unit 12 (step S103). The process executing unit 12 measures time at which the arithmetic operation of the data reaches a synchronous point, and transmits the time to the parallel arithmetic management apparatus 1 through the communicating unit 11 (step S104).

The computer 10 receives the data allocation table from the parallel arithmetic management apparatus 1 (step S105). When movement of the data in the data allocation table is instructed (Yes at step S106), the computer 10 transmits a part of the data stored in the data storage unit 13 to the designated computer (step S107).

When movement of the data in the data allocation table received is not instructed (No at step S106), and after step S107, the process executing unit 12 decides whether all data processing is complete (step S108). If some data processing is not completed (No at step S108), the process executing unit 12 continues the data processing (step S103). If all the data processing is completed (Yes at step S108), the processing operation ends.

Because the computers 20, 30, and 40 perform the same operations as that of the computer 10, a description for the computers 20, 30, and 40 will be omitted. A process procedure of the parallel arithmetic management apparatus 1 will be described below with reference to FIG. 6.

In FIG. 6, the parallel arithmetic management apparatus 1 causes the load information acquiring unit 6 to collect load information of the computers (step S201). The collection of the load information is performed by receiving from each computer, the time at which the processing reaches a synchronous point. The data allocation calculating unit 5 decides whether the loads must be adjusted (step S202).

If the loads must be adjusted (Yes at step S202), the process control unit 7 decides whether any computer is in an idle state (step S203). The computer in the idle state is a computer that does not execute a process. In the computer that does not execute any process, the time at which processing reaches the synchronous point cannot be detected. Therefore, the computer in the idle state must be detected independent of acquisition of a load state.

If some computer is in an idle state (Yes at step S203), the data allocation calculating unit 5 decides whether a process must be generated (step S204). The decision is made based on a concrete effect obtained by generating a new process. When the new process is generated, overhead costs increase with an increase in the degree of parallelization. The data allocation calculating unit 5 determines that a new process must be generated based on an effect corresponding to the increase in overhead cost. The data allocation calculating unit 5 forms a new process in an idle computer (step S205)if it is determined that the new process must be generated (Yes at step S204).

When some computer is in an idle state (No in step S203), and when it is determined that a new process need not be generated (No in step S204), or after the formation of the new process (step S205) is completed, the data allocation calculating unit 5 calculates allocation of data such that loads are distributed to the processes (step S206), and stores the allocation in the allocation information storage unit 4.

After the calculation of the data allocation (step S206), or if load adjustment is not necessary (step S202), the communicating unit 3 transmits a designation of movement of the data to each computer based on the allocation information stored in the allocation information storage unit 4 (step S207), and the processing operation ends. When the load adjustment is not necessary, a message representing that movement of the data is not necessary is transmitted instead of the designation of movement of the data.

The arithmetic progress storage unit 8 in the parallel arithmetic management apparatus 1 will be described below. Each time the process of each computer reaches the synchronous point, the arithmetic progress storage unit 8 acquires a progress of an arithmetic operation at this time, and stores the progress.

On the other hand, the process control unit 7 can generate a process in an arbitrary computer or end the process. Therefore, the process control unit 7 generates a new process, restarts the arithmetic operation from the progress stored by the arithmetic progress storage unit 8, and ends the original process to make it possible to move the process from a predetermined computer to another computer.

After all data allocated to a predetermined process during calculation of data allocation are allocated to another process, the processes are ended to thereby reduce the number of processes without adversely affecting the arithmetic contents of data.

More specifically, the process control unit 7 can increase/reduce the number of processes, and can arbitrarily move processes between the computers. In addition, because the movement of the processes is realized by the movement of data, the processes can be moved without storing a memory image or being limited by the architecture of the computer.

The arithmetic progress storage unit 8 in the parallel arithmetic management apparatus 1 stores data in the middle of an arithmetic operation. However, the data in the middle of the arithmetic operation is not necessarily stored in the parallel arithmetic management apparatus 1, but an independent storage device may be arranged, or the data may be stored in the computers. On the other hand, storing the progress is useful as backup used when a defect occurs in a predetermined computer. Therefore, even though the data is stored in the computer, it is desirable to distribute the data to a plurality of computers, as a measure against risk reduction.

As described above, in the parallel arithmetic system according to the embodiment, the load status of the computers are acquired by the load information acquiring unit, and the data allocation calculating unit determines data allocated to the computers based on the acquired load information. The data are moved between the computers to make it possible to distribute the data depending on the load states of the computers, and the throughputs of the computers can be efficiently scheduled.

Because the loads of the processes are managed based on amounts of data, data allocated to a predetermined process can be moved to another process, and the number of processes can be safely and easily changed.

In addition, when a progress of a data arithmetic operation is stored, processing can be restarted in an arbitrary computer without being limited by the architecture.

In the embodiment, the number of types of data to be processed is one, the data are two-dimensional data, and division of the data is determined depending on a size in a predetermined direction. However, use of the present invention is not limited by these conditions, and the arbitrary number of data, an arbitrary data form, and an arbitrary data dividing method can be used.

An example of a data dividing method is shown in FIG. 7. In FIG. 7, data arrangement B, which is two-dimensional data, is divided into cells 76. When data arrangement B is to be distributed to each process, the distribution is performed by allocating the cells to the processes. In FIG. 7, a data block 71 including 10 cells is allocated to process 1, a data block 72 including 9 cells is allocated to process 2, a data block 73 including 9 cells is allocated to process 3, and a data block 74 including 12 cells is allocated to process 4. In this manner, the data arrangement is divided into cells, and the numbers of cells of data blocks allocated to the processes are adjusted to make it possible to distribute the data.

An example of data having data arrangements of three types is shown in FIG. 8A. As illustrated in FIG. 8A, the data to be processed has three data arrangements, i.e., data arrangement A, data arrangement B, and data arrangement C. As shown in FIG. 8A, entire data 81 includes information related to data arrangement A, data arrangement B, and data arrangement C. In this case, the entire data 81 includes, with respect to data arrangement A, a data type “integer”, the number of dimensions “three”, a data size “100×100×100”, and a dimension “1” in division.

Similarly, the entire data 81 includes, with respect to data arrangement B, a data type “double-precision floating-point”, the number of dimensions “one dimension”, a data size “400”, and a dimension “1” in division. Furthermore, the entire data 81 includes, with respect to data arrangement C, a data type” “double-precision floating-point”, the number of dimensions “three”, a data size “400×400×200”, and a dimension “3” in division.

As shown in FIG. 8B, 25% of the entire data, i.e., “100×100×25” of data arrangement A, “100” of data arrangement B, and “400×400×50” of data arrangement C are allocated to process 1.

Similarly, 25% of the entire data, i.e., “100×100×25” of data arrangement A, “100” of data arrangement B, and “400×400×50” of data arrangement C are allocated to processes 2, 3, and 4 each.

In this manner, even though the entire data has an arbitrary number of data arrangements, as in the above description, data can be allocated.

In the embodiment, a parallel arithmetic management apparatus is arranged independently of a computer. However, the parallel arithmetic management apparatus need not be arranged in an independent housing, and the parallel arithmetic apparatus may be incorporated in an arbitrary computer.

The functions of the parallel arithmetic management apparatus can also be realized by using software. In this case, as in other processes, a parallel arithmetic management program operating in the process executing unit of one of the computers can be obtained.

As described above, according to the parallel arithmetic system, the parallel arithmetic management apparatus, and the computer product of the present invention, the throughputs of the computer can be efficiently scheduled.

Moreover, the number of processes can be increased/reduced and moved without being limited by the architectures of computers.

Although the invention has been described with respect to a specific embodiment for a complete and clear disclosure, the appended claims are not to be thus limited but are to be construed as embodying all modifications and alternative constructions that may occur to one skilled in the art which fairly fall within the basic teaching herein set forth.
{"ft_lang_label":"__label__en","ft_lang_prob":0.9004921,"math_prob":0.8965243,"size":32700,"snap":"2021-43-2021-49","text_gpt3_token_len":6577,"char_repetition_ratio":0.24996941,"word_repetition_ratio":0.24103737,"special_character_ratio":0.20923547,"punctuation_ratio":0.10018711,"nsfw_num_words":1,"has_unicode_error":false,"math_prob_llama3":0.97091305,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-10-21T11:46:05Z\",\"WARC-Record-ID\":\"<urn:uuid:637e4a3a-9f3b-4876-9e37-9bf9cf3d3e82>\",\"Content-Length\":\"68517\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:6722be23-7b68-4d65-9939-7285143b2619>\",\"WARC-Concurrent-To\":\"<urn:uuid:237d8b83-cb2f-4f13-99ef-8221025f8717>\",\"WARC-IP-Address\":\"144.202.252.20\",\"WARC-Target-URI\":\"https://www.freepatentsonline.com/y2005/0114414.html\",\"WARC-Payload-Digest\":\"sha1:4QGGCQTZCW3VSDLF47S7WNLBVCQ4PDXA\",\"WARC-Block-Digest\":\"sha1:XWMCJN6E3GMNR62GXMBAT72TS7RZIYEM\",\"WARC-Identified-Payload-Type\":\"application/xhtml+xml\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-43/CC-MAIN-2021-43_segments_1634323585405.74_warc_CC-MAIN-20211021102435-20211021132435-00026.warc.gz\"}"}