JPH0395661A - Process assignment device for parallel computer - Google Patents

Abstract

PURPOSE:To increase the overall processing speed by assigning a process with preference to a processor of a local memory when it is decided that the data stored in a single local memory can be applied to the process. CONSTITUTION:A processor assignment table 34 of a processor assignment device 31 stores the assignment situation of processes to the processors. A local memory state store part 35 stores the store state of the data stored in each local memory. Then an assignment part 36 of the device 31 assigns the processes to the processors by reference to the table 34. At the same time, a process is assigned with preference to the processor of a relevant local memory when it is decided that the data stored in the single local memory can be applied to the processor based on the data of the part 35. As a result, the useless transfer of data can be omitted and the overall processing speed is improved.

Description

DETAILED DESCRIPTION OF THE INVENTION (Summary) This invention relates to a processing allocation device for a parallel computer, and particularly to a processing allocation device that allocates processing to each processor of a parallel computer having a plurality of processors and each processor having a local memory. The aim is to reduce data transfer processing as much as possible, and the above-mentioned processing allocation device is equipped with a processor allocation table that stores the status of processing allocation to processors,
A local memory status storage unit that stores the storage status of data stored in each local memory, and a local memory status storage unit that allocates processing to each processor based on the above-mentioned processor allocation table. When it is determined that data stored in a memory can be used, processing is preferentially assigned to a processor to which the local memory belongs.

(Industrial Application Field) The present invention relates to a processing allocation device for a parallel computer, and more particularly to a processing allocation device for allocating processing to each processor of a parallel computer having a plurality of processors, each of which is provided with a local memory. .

? Prior Art) In recent years, in order to speed up processing, a plurality of processors 11-, to 11-N are connected by a common bus 13, as shown in FIG. 6, so that they can access a shared memory 14, and each processor 11-1 to 11-N also have local memory 12-
There is a computer system in which processors 11-1 to 12-N are arranged, and a processing assignment device 15 assigns processing to each of the processors 11-1 to 11-N. In such a computer system, a processor assigned a process reads data from the shared memory 14, builds a processing environment in its own local memory, and executes the assigned process.

In such a computer system, the processing allocation device generally creates a queue (referred to as a queue) for processing requests in the order in which they are requested, and waits for idle processing (processing that is not being executed). ) was allocated sequentially to the processors.

[Problem to be solved by the invention]

By the way, in such a computer system, in order to perform a certain process, a certain processor builds a processing environment in its own local memory and starts the process, and in the middle of that process, in order to execute another process that has priority, the processor Processing may be interrupted and other processing may be executed. In such a case, when re-executing the interrupted process, do you use the conventional method? The allocation device may allocate the processing to another processor, and in such a case, the allocated processor must read the data again from the shared memory and create a processing environment in its own local memory. This results in wasteful processing. This situation also occurs when reprocessing is performed using the same processor and the data has already been transferred to the shared memory.

Further, as shown in FIG. 7, a plurality of local memories 16-
■Multiple processors 17-1 to 17- having ~16-N
．． In a system in which it is possible to connect processes through a network 18 and allocate processes using a process allocation device 19,
As shown in FIG. 8, for example, when the processing environments of processing a and processing b are stored in the local memory of processor A, and the processing environments of processing C and processing d are stored in the local memory of another processor B, If process a is assigned to processor B, it is transferred from processor A's local memory to processor B.
There is a problem in that it is necessary to transfer the processable environment a to the local memory of the computer, and the processing takes time.

Therefore, an object of the present invention is to provide a processing allocation device for a parallel computer that can reduce data transfer processing as much as possible.

? Means for Solving the Problems] In the present invention, means for solving the above problems are as follows:
As shown in FIG. 1, it has a plurality of processors 1-1 to 1-n, each of which has a local memory 2.
- Each processor 1- of a parallel computer provided with 1 to 2-n
A process allocation device 3 that allocates processes to processors 1 to 1-n, which includes a processor allocation table 4 that stores the status of process allocation to processors 1-1 to 1-n, and each local memory 2-1 to 2-n. Each processor 1-1 to 1-1 performs processing based on the local memory status storage group 5 that stores the storage status of data stored in
1-n, and based on the data in the local memory status storage unit 5, processing is performed on one local memory 1.
When it is determined that the data stored in the local memory 2. can be used, the local memory 2. and an allocation capital 6 that preferentially allocates processing to the processor 1-1 to which the processor 1-1 belongs.

(Operation) According to the present invention, the processor allocation table of the processing allocation device stores the allocation status of processes to processors, and the local memory status storage section stores the storage status of data stored in each local memory. ing. Then, the allocation unit allocates the process to each processor based on the processor allocation table, and when it is determined that the process can use the data stored in one local memory based on the data in the local memory status storage unit, the allocation unit allocates the process to each processor based on the processor allocation table. Since processing is assigned to the processor with priority, there is no need to transfer unnecessary data, and overall processing becomes faster.

(Embodiment) Hereinafter, an embodiment of a processing allocation device for a parallel computer according to the present invention will be described based on the drawings.

2 to 5 show an embodiment of a processing allocation device for a parallel computer according to the present invention. In this embodiment, the processing allocation device 31 includes a processor allocation table 34 that stores the allocation status of processing to a plurality of processors (not shown), and a storage of data stored in each local memory (not shown). A local memory status storage unit 35 that stores the status, and processing is assigned to each processor based on the processor allocation table 34, and based on the data of the local memory status storage unit 35,
It consists of an allocation section 36 which, when it is determined that data stored in a local memory can be used for processing, preferentially allocates the processing to the processor to which the local memory belongs.

In this embodiment, the local memory status storage unit 35 stores which processing environment is stored in a pointer to a processor number to which each local memory belongs, as shown in FIG. In this example, the local memory of processor number l has process 98, the local memory of processor number 2 has processes 99 and 100, and processor number 3 has process 99 and process 100.
This shows that no process is stored in the local memory of processor number n, and an environment for process 123 is built in the local memory of processor number n.

Furthermore, in this embodiment, the processor allocation table is
As shown in FIG. 4, the processing status of each processor is stored. In this example, processor 1 and processor 3 are in an empty state (
Ready state), and it is stored that processor 2 is executing process 99 and processor n is executing process 123.

Based on this information, the allocation unit 36 uses an evaluation function to determine a processor to execute a process in response to a process request, and allocates the process by outputting a processor number.

Next, the operation of the processing allocation device for a parallel computer according to this embodiment will be explained.

FIG. 5 is a flowchart showing the operation of the processing allocation device for a parallel computer according to the present invention.

First, when a processing request comes, the allocator looks at the local memory status store (STI) to find out which processor the request processing environment is on.

If no processor has an environment to execute the process, normal processing is performed, and if a processing environment is stored in some processor, another process is assigned to that processor by referring to the processor allocation table. (ST2), and if no other processing is assigned, the processing is assigned to that processor. At this time, if another process is assigned to the processor, a processor that does not require rewriting the contents of the local memory is searched for (ST3), and the process is assigned to the processor.

For example, when there is a request for the process 98 in the state shown in FIGS. 3 and 4, the allocation unit is not the processor 3, but the processor 1 that has the environment of the process 98 in the local memory.
Assign processing to.

This eliminates the need for unnecessary data transmission.

Therefore, according to this embodiment, processing is prioritized and assigned to a processor that has an environment that can perform the processing, so there is no need to transfer unnecessary data, and the processing as a whole becomes faster. .

In the above embodiment, it is also necessary to control the contents stored in the common memory, but in this regard, the shared memory can also be generalized as one type of local memory. Further, each processor may have a cache memory instead of a local memory, and in this case, the present invention can be applied by considering the cache memory as a small-capacity local memory.

Furthermore, although the above embodiment has been explained assuming that a device separate from each processor is used as a processing allocation device for a parallel computer, one processor is also operated as a processing allocation device, and the local memory is provided with a local memory status storage section. Processor allocation tables can also be stored and processed.

〔Effect of the invention〕

As explained above, according to the present invention, a process allocation device that allocates processes to each processor of a parallel computer having a plurality of processors and each processor is provided with a local memory can be used to monitor the status of process allocation to the processors. The stored processor allocation table, a local memory status storage unit that stores the storage status of data stored in each local memory, and a local memory status storage unit that allocates processing to each processor based on the processor allocation table and the data in the local memory status storage unit. Based on this, when a process determines that data stored in one local memory can be used, an allocation unit is provided that assigns the process preferentially to the processor to which the local memory belongs. When it is determined that the local memory can be used, processing is preferentially assigned to the processor to which the local memory belongs, eliminating the need for unnecessary data transfer and resulting in faster processing overall.

[Brief explanation of drawings]

Fig. 1 is a diagram showing the principle of the present invention, Fig. 2 is a diagram showing an embodiment of the processing allocation device for a parallel computer according to the invention, and Fig. 3 is a local memory of the processing allocation device for a parallel computer shown in Fig. 2. FIG. 4 shows the processor allocation table of the processing allocation device for the parallel computer shown in FIG. 2. FIG. 5 shows the operation of the processing allocation device for the parallel computer shown in FIG. 2. 6 and 7 are flow charts showing a parallel computer to which the present invention is applied, and FIG.
This figure shows the storage state of the local memory of the parallel computer shown in FIG. 7. 1-1~L. ...Processors 2-1 to lo...Local memory 3...Processing allocation device 4...Processor allocation table 5...Local memory status storage section 6...Allocation section IEI 2nd Figure 35 Flute 3 Figure A; Direction Ita・j's I movement Figure 5 Processor holder 1 Hitting one round r'3'l-Figure 4 11-2 1 Wooden metal light i & IJ1 ! Dobaroshinu Dimensions Figure 6 17-2 7-N Local Memory Person A 2nd Crisis Figure 400

Claims (1)

[Claims] A parallel system having a plurality of processors (1_-_1 to 1_-_n) and each processor (1_-_1 to 1_-_n) provided with a local memory (2_-_1 to 2_-_n). A process allocation device (3) that allocates processes to each processor (1_-_1 to 1_-_n) of a computer, comprising a processor allocation table (3) that stores the status of process allocation to the processors (1_-_1 to 1_-_n). 4); a local memory status storage unit (5) that stores the storage status of data stored in each local memory (2_-_1 to 2_-_n); (1_-_1 to 1_-_n), and when it is determined that the process can use the data stored in one local memory (2_-_i) based on the data of the local memory status storage unit (5), the local memory A processing allocation device for a parallel computer, comprising: an allocation unit (6) that preferentially allocates processing to a processor (1_-_i) to which (2_-_i) belongs.