JPH05204875A - Thread scheduling method - Google Patents

Abstract

(57) [Summary] [Purpose] To obtain a thread scheduling method that can secure a series of processors by creating threads. [Configuration] A parallel program 11 is executed, and a thread management unit 17 having a thread generation unit 12, a thread allocation unit 14, and a processor reservation execution unit 16 is called.
The thread generation unit 12 generates a thread required for program execution, and the processor reservation execution unit 16 that makes a processor reservation execution request calls the processor reservation unit 13 to reserve a necessary processor. The process returns to the thread management means 17 again, and the thread allocation means 14
Allocate a thread to the processor secured by. When the thread schedule ends, the parallel program 11 is executed.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a schedule of parallel programs executed on a multiprocessor system, for example.

[0002]

2. Description of the Related Art A conventional technique will be described with reference to FIGS. FIG. 3 shows an example of a general multiprocessor system, and is a configuration diagram of a multiprocessor system using a BUS type LAN (local area network). As shown in FIG. 3, in a multiprocessor system having a plurality of processors (CPUs), a program is divided into a plurality of units to generate threads as execution units, and a processor, which is a physical device for executing the programs, is generated. By allocating each of these threads and processing one program in parallel by a plurality of processors, the processing time of the program is saved and the processing load on the processors is distributed. As described above, the program executed in the multiprocessor system is called a parallel program (or parallel application program), and is a program created by the user in C language, for example. Then, assigning a thread generated to execute this parallel program to a processor is called a thread schedule. FIG. 4 is an example of a thread schedule when a parallel program is executed in a multiprocessor system.

In the thread scheduling method in this multiprocessor system, Gang Sche is used.
duling (Mach Processor Allocation Interface, 13A
August 1989, David L. et al. Black,
Carnegie Mellon University
y, p4 l31) based on a multiprocessor operating system that schedules (allocates) threads and processors in a one-to-one correspondence.
There is.

Specific processing will be described with reference to FIG. FIG. 5 is a diagram showing a thread scheduling method in execution of a conventional parallel program. Parallel program 11
When this is executed, this program issues an execution request to the processor securing means 13 which secures a processor, whereby the processor securing means 13 secures a set of currently available processors. After that, the process is returned to the parallel program 11 again. Next, the parallel program 11 issues an execution request to the thread generating means 12 for generating a thread in order to generate a thread necessary for executing the program, and the thread generating means 12 thereby generates a necessary thread. After that, the process is returned to the parallel program 11 again. The parallel program 11 has a thread allocating means 14 for allocating the threads to the processors in advance so that the threads and the processors have a one-to-one correspondence. Thread and processor securing means 1
Schedule the set of processors secured by 3. When executing the thread allocation means 14, it is necessary to be aware of the number of processors secured by the processor securing means 13 and the number of threads generated by the thread generation means 12.

The thread generating means 12 and the processor securing means 13 in this case are a part of the functions of the operating system 15.

[0006]

In the conventional thread scheduling method, generation of a thread, which is a unit for executing a parallel program, and reservation of a processor arranged in the parallel program are performed separately. Further, it is necessary to incorporate a thread allocating means for allocating threads to a processor into a parallel program. As a result, the generated threads may be simultaneously executed in parallel on different processors, so that the execution efficiency proportional to the number of threads may not be obtained. For example,
When the number of processors secured by the processor securing means is smaller than the number of threads generated by the thread generating means, there is a thread waiting until allocatable processors are created without executing all threads in parallel at the same time. Occurs. At this time, the execution efficiency proportional to the number of threads could not be obtained. Also for that,
It is necessary to be aware of the number of processors with respect to the number of threads when creating a parallel program, and the creation of the parallel program itself depends on the number of threads and is complicated.

The present invention has been made in order to solve the above problems, and an object thereof is to obtain a thread scheduling system in which a processor can be secured in series by generating threads.

[0008]

According to the thread scheduling method of the present invention, a thread generation means for generating a thread, a processor reservation execution means for making a processor reservation execution request, and a thread for allocating a thread to the reserved processor are provided. It has a thread managing means having an allocating means and a processor securing means to be executed by an execution request from the thread managing means.

[0009]

In the thread scheduling method according to the present invention, in the thread management means, when the thread generation means generates a thread, the processor reservation execution means makes a processor reservation execution request. The processor securing means secures a processor in response to an execution request from the processor securing executing means of the thread managing means, and has a thread allocating means for allocating a thread to the secured processor, thereby creating a thread and securing a processor. Since the processes can be performed in series, it is not necessary to request execution of processor reservation from a parallel program.

[0010]

【Example】

Example 1. An embodiment of the present invention will be described below with reference to the drawings. FIG. 1 shows an embodiment of a thread scheduling method according to the present invention. 11 is a parallel program to be executed, 12 is thread generation means for generating threads required for program execution, 13 is processor securing means for securing a necessary processor, 14 is thread allocating means for allocating threads to the secured processor,
Reference numeral 16 is a processor reservation execution means for making an execution request to the processor reservation means, and 17 is a thread management means having a thread generation means 12, a thread allocation means 14, and a processor reservation execution means 16. 15 is an operating system of a multiprocessor system that executes a program.

Next, FIG. 2 is a flow chart showing the execution procedure of the thread scheduling method in the present invention. The flow of the thread scheduling method of the present invention will be described with reference to FIG. When the parallel program 11 starts executing, it first calls the thread management means 17 2
1. In the called thread management means 17, first, the thread generation means 12 generates a required thread 22. Next, the processor reservation execution means 16 calls 23 the processor reservation means 13. The processor securing unit 13 that has been called secures the processor 24, returns to the thread managing unit 17 again, and the thread allocating unit 14 pairs the threads generated by the thread generating unit 12 with the processor secured by the processor securing unit 13. Allocate to be 25. Then, it is checked 26 whether the required number of threads have been created, and when the thread schedule is completed, the program is executed 27.

At this time, the thread managing means 17 and the processor securing means 13 are independent of the function of the operating system 15.

Embodiment 2. Although the processor securing means 13 is separate from the thread managing means 17 in the first embodiment, the processor securing means 13 and the thread managing means 17 may be integrated into one means. Further, the thread generation means 12, the processor reservation execution means 16, and the thread allocation means 14 included in the thread management means 17 may exist independently and are called from each means.

Example 3. In the present invention, the thread managing means 17 and the processor securing means 13 do not have to exist on the same processor. Further, the processor having the processor securing unit 13 may be located at a remote location and may be via a communication device or the like.

Example 4. In the present invention, the type of source code of the parallel program is not particularly limited. C language, COBO
L or another language may be used.

Embodiment 5. In the first embodiment, the processor securing means 13 is requested to be executed by the thread managing means 17, but the processor securing means 13 may be able to execute alone.

[0017]

As described above, according to the present invention, the thread generation means for generating threads, the processor reservation execution means for making a processor reservation execution request, and the thread allocation means for allocating threads to the reserved processor are provided. By having the thread managing means and the processor securing means that is requested to be executed by the processor securing executing means, it is possible to generate threads and secure the processor in series, so that a parallel program issues a processor securing execution request. There is no need. This eliminates the need to make an entry for activating the processor securing means and an entry for allocating threads in the parallel program. Therefore, it is not necessary to be aware of the number of threads and the number of processors when creating a parallel program. Program creation becomes easy. Furthermore, it is possible to reduce the capacity of the parallel program itself. Furthermore, since the generated threads are simultaneously executed in parallel on different processors when the program is executed, execution efficiency proportional to the number of threads can be obtained.

[Brief description of drawings]

FIG. 1 is a diagram showing an embodiment of a thread scheduling method according to the present invention.

FIG. 2 is a flow diagram showing an example of an execution procedure of a thread scheduling method according to the present invention.

FIG. 3 is a diagram showing an example of a general multiprocessor system in a conventional example.

FIG. 4 is a diagram showing an example of a thread schedule in a conventional example.

FIG. 5 is a diagram showing a conventional thread scheduling method.

[Explanation of symbols]

 11 parallel program 12 thread generating means 13 processor securing means 14 thread allocating means 15 operating system 16 processor securing executing means 17 thread managing means 21 calling thread managing means 22 generating threads 23 calling processor securing means 24 securing processors 25 Allocate threads 26 Did the required number of threads be created 27 Program execution

Claims (1)

[Claims] 1. A thread scheduling method for associating a thread, which is an execution unit of a program, with a processor executing the same in a multiprocessor system, the thread scheduling method having the following elements: (a) an execution request from another A processor securing means for securing a processor required for program execution, (b) a thread managing means for managing threads having the following elements, (b1) a thread generating means for generating a thread required for program execution, b2) processor reservation execution means for making an execution request to the processor reservation means; and (b3) thread allocation means for allocating threads generated by the thread generation means to the processor reserved by the processor reservation means.