JP3733402B2 - Processor resource selection method, processor resource selection system therefor, and computer-readable program recording medium - Google Patents

Description

[0001]
BACKGROUND OF THE INVENTION
The present invention relates to processor resource selection processing for assigning a processor to each job classified into classes, and in particular, processor resources (priority processors) that can be preferentially used and processor resources (extended processors) that can be used preliminarily in units of classes. This is related to processor resource selection processing in which the availability of an extended processor is examined when there is no free space in the priority processor of the corresponding class of the execution job.
[0002]
In general, jobs are classified according to their properties and the types of system resources required by them, processor resources that can be used for each class are determined in advance, and processor resources of the corresponding class are assigned to execution jobs.
[0003]
At this time,
-A processor resource that has both a class that has no available processor resources and has a job waiting to be allocated (hereinafter referred to as a "resource-waiting job") and a class that has no resource-waiting jobs and free processor resources. It is desirable to prevent the occurrence of a state where the entire resource cannot be used effectively or a state where the resource cannot be used fairly between classes sharing processor resources, and the present invention responds to such a demand.
[0004]
[Prior art]
5 and 6 are explanatory views showing an overview of conventional processor resource selection. Reference numerals 41, 42, 43, and 44 denote class parameters of a job statement of a job read from an input device (not shown). -A queue distributed based on the queue; 45, a processor resource used by the queue 41; 46, a processor resource used by the queue 42; 47, a processor resource shared by the queue 43 and queue 44; Yes.
[0005]
In the case of FIG. 5, the processor resources 45 allocated to the queue 41 are in use, and a plurality of resource waiting jobs are connected to the queue.
[0006]
On the other hand, the processor resources 46 allocated to the queue 42 remain empty, and there are no resource waiting jobs in the queue, and the entire processor resources 45 and 46 are not effectively used.
[0007]
In the case of FIG. 6, the queue 43 and the former of the queue 44 sharing the processor resource 47 and the former (queue 43) are continuously submitted, and then the job is submitted to the queue 44. Yes.
[0008]
Here, the shared processor resource 47 is allocated only to the job of the queue 43 that is input first, and the fair use of the processor resource between the queues is not ensured.
[0009]
[Problems to be solved by the invention]
As described above, the conventional processor resource selection method for assigning a processor to each classified job does not provide flexibility in the setting range of the processor used in each class.
[0010]
For this reason, class A processors are available, but all class B processors are in use, and jobs submitted to the job class remain in a waiting state for allocation of processor resources. There is a problem that the processor is assigned to only one class of job, and the processor resources are not used effectively and fairly between job classes.
[0011]
Therefore, according to the present invention, processor resources (extended processors) that can be used for preliminary use are distributed to each job class separately from the processor resources (priority processors) that are used preferentially there, and assigned to the corresponding job classes of the resource waiting jobs. It is an object of the present invention to make effective use and fair use of the entire processor resources by allocating an extended processor to this resource waiting job under a predetermined condition when there is no available priority processor.
[0012]
[Means for Solving the Problems]
The present invention solves this problem as follows.
(1) In a processor resource selection method in which an information processing apparatus assigns a processor to each job classified into classes,
The information processing apparatus includes:
By at least referring to a processor allocation definition table defining priority processors and pre-assignable expansion processors for each class,
When there is a vacancy in the priority processor defined in the first class to be executed, the priority processor is assigned to a job of the class ,
When the priority processor defined in the first class to be executed has no free space, the extended processor in the free state of the class is obtained, and the second processor class that defines the extended processor as the priority processor is determined. An extended processor that does not contain a resource waiting job is assigned to a job of the first class.
(2) In a processor resource selection system that assigns a processor to each job classified into classes,
A processor allocation definition table defining priority processors and expansion processors that can be preliminarily allocated for each class ;
When at least the priority processor defined in the first class to be executed is empty with reference to at least the processor distribution definition table, the priority processor is assigned to a job of the class, and the first target to be executed is When there is no free space in the priority processor defined in the class, the extended state in which there is no resource waiting job in the second class that defines the priority processor as a priority processor among the extended processors in the free state of the class Resource allocating means for allocating a processor to a first job of the class;
Is provided.
[0013]
According to the present invention, when assigning processors to C target jobs (resource waiting jobs) of the job class of FIG. 2, for example, at least by referring to the processor allocation definition table 14,
(a) When all the priority processors PE21 to 30 of the job class C are in use and the extended processor PE2 of the job class is empty,
(b) Rather than immediately assigning this extended processor PE2 to the target job,
(c) The extension processor PE2 obtains the job class A defined as the priority processor from the processor distribution definition table 14 and confirms that there is no resource waiting job in the job class A in the queue 12 for the first time. The processor PE2 is assigned to the target job.
[0014]
As a result, the present invention achieves more effective utilization and fair utilization of the entire processor resources.
[0015]
The present invention is also directed to a computer-readable program recording medium storing a program for causing a computer to realize this function.
[0016]
DETAILED DESCRIPTION OF THE INVENTION
An embodiment of the present invention will be described with reference to FIGS.
[0017]
FIG. 1 is an explanatory diagram showing an overview of a processor resource selection system, FIG. 2 is an explanatory diagram showing a processor in charge of processor resource allocation processing,
1 is a processor resource allocation unit that allocates a processor to a job read from an input device;
11 is an entry program for submitting a job to a queue, which will be described later, based on the job class specified in the job statement;
12 is a queue for holding the input resource waiting job for each job class;
13 is a resource allocation program for fetching a resource waiting job from the queue 12 and allocating processor resources;
14 is a processor allocation definition table (table format storage unit) indicating processor resources (priority processors) to be preferentially used in each job class and processor resources (extended processors) that can be used preliminarily;
15 is a processor usage status table (table format storage unit) indicating whether each processor resource is used;
Reference numerals 21 to 25 denote processors constituting processor resources,
Respectively.
[0018]
In FIG. 1, the distribution status of processor resources to each job class is as follows:
In the case of class A, the priority processors are processors 21, 22, and 23, and the extended processors are processors 24-N,
In the case of class B, the priority processors are processors 25 to N ′, and the extended processors are processors 21, 22, 23,
In the case of class C, the priority processors are processors 22, 23 and 24, and the extended processors are processors 25 to N ″,
It has become. Whether or not duplication between priority processors allocated to each job class or duplication between extended processors is recognized is arbitrary.
[0019]
The processor resource allocation unit 1 specifies a processor to be used by executing a processor resource allocation process (see FIG. 3) to be described later with reference to this definition content for the job read from the input device.
[0020]
In FIG.
Queue 12 contains class B and class C resource waiting queues,
The processor allocation definition table 14 indicates that, for example, the class A priority processors are the processors PE1 to PE10, and the extended processors are the processors PE11 to PE20.
The processor usage status table 15 indicates that, for example, the processor PE1 is in use and the processor PE1 is free.
[0021]
The entry program 11 classifies each job sent from an input device (not shown) and inputs it to the queue 12.
[0022]
Further, the resource allocation program 13 takes out the resource waiting job from the queue 12 based on the start priority described in the job statement, and prioritizes the job with reference to the processor allocation definition table 14 and the processor usage status table 15. Assign a processor or expansion processor.
[0023]
FIG. 3 is an explanatory diagram showing a processor resource allocation processing procedure for each job class, and the contents thereof are as follows.
(S1) It is determined whether or not a job of the corresponding job class (resource waiting job) is included in the queue 12. If “YES”, the process proceeds to the next step, and if “NO”, a series of processing is temporarily terminated. To do.
(S2) Referring to the processor allocation definition table 14 and the processor usage status table 15, it is determined whether or not there is a vacant priority processor for the job class. If “YES”, the process proceeds to the next step. If so, go to Step (S5).
(S3) Select one free priority processor and go to the next step.
(S4) Take out a job (resource waiting job) of the corresponding job class from the queue 12 based on its start priority, assign the priority processor selected in the previous step to this job, and end the series of processes once To do.
(S5) It is determined whether there is any processor that has not yet been selected in the current allocation process among the extended processors defined in the corresponding job class in the processor distribution definition table 14. If “YES”, Proceeding to the step, if “NO”, the series of processing is once terminated.
(S6) One processor is selected from the remaining, and the process proceeds to the next step.
(S7) Referring to processor usage status table 15, it is determined whether or not this selected processor is in use. If “YES”, the process returns to step (S5), and if “NO”, the process proceeds to the next step. .
(S8) The processor distribution definition table 14 is searched to obtain a job class in which the selected processor is defined as a priority processor, and the process proceeds to the next step.
(S9) It is determined whether or not a job (job waiting for resources) of this job class is included in queue 12. If “YES”, the process returns to step (S5), and if “NO”, the next step is performed. move on.
(S10) One job (resource waiting job) of the corresponding job class in step (S1) is extracted from queue 12 based on the start priority, and the processor selected in step (S6) is assigned to this job. The process ends.
[0024]
When the above processor resource allocation process is executed for class C in a situation where all the priority processors PE21 to PE30 are in use,
-Since queue-12 contains class C resource waiting jobs, step (S1) is set to "YES"
-When proceeding to step (S2), since all the priority processors are in use as described above, the corresponding step becomes "NO"
Proceeding to step (S5), when all the class C extended processors (processors PE1 to PE10) in the processor distribution definition table 14 are not selected, for example, the corresponding step becomes “YES”,
Proceed to step (S6), for example, select processor PE1,
-Proceeding to step (S7) and referring to the processor usage status table 15, the processor PE1 is "1: busy", so that step is "YES"
When returning to step (S5), since the processors PE2 to PE10 are not yet selected, the corresponding step becomes “NO”.
Proceed to step (S6), for example, select processor PE2,
-Proceeding to step (S7) and referring to the processor usage status table 15, processor PE2 is "0: empty", so that step is "NO"
When the process proceeds to step (S8) and the processor distribution definition table 14 is searched, a job class (class A) that defines the processor PE2 as a priority processor is obtained.
-Proceeding to step (S9) and looking at the queue 12, there is no class A resource waiting job, so that step is "NO"
Proceeding to step (S10), taking out one class C resource waiting job from the queue 12, and assigning the processor PE2.
It will be.
[0025]
In order to determine step (S5) in FIG. 3, for example, a flag is prepared in a one-to-one correspondence with each of the extended processors in the processor distribution definition table 14, and this is determined when step (S6) is selected. It may be changed and returned to the initial value at the end of “NO” in step (S5).
[0026]
Further, without providing the processor usage status table 15, it may be inquired whether each processor in use is in use at the time of the reference processing in step (S2) or step (S7).
[0027]
FIG. 4 is an explanatory diagram showing an outline of a computer system that reads and executes a program from a computer-readable recording medium. 3 is a computer system, 31 is a main body unit incorporating a CPU, a disk drive device, and the like. , 32 is a display for displaying an image in accordance with an instruction from the main body 31, 33 is a display screen, 34 is a keyboard for inputting various information to the computer system 3, and 35 is an arbitrary on the display screen 33. A mouse for designating the position of the computer, 36 is an external database (line-destination memory such as DASD), 37 is a modem for accessing the external database 36, 38 is a CD-ROM, floppy disk, etc. Each of these portable recording media is shown.
[0028]
As a recording medium for storing the program,
・ Program provider side database 36 (destination memory)
・ Portable recording medium 38
Any of the memories on the main unit 31 side or the like may be used, and the program is loaded into the main unit 31 and executed on the main memory.
[0029]
【The invention's effect】
As described above, according to the present invention, in addition to the priority processor of each job, an extended processor that can be used in a preliminary manner is defined for each class, and when allocating processor resources to a job, the priority processor free space is assigned to the job class. This is used when there is a space, and when there is no space, the extended processor of the class is used under a predetermined condition. Therefore, effective utilization and fair utilization of the entire processor resources can be achieved.
[Brief description of the drawings]
FIG. 1 is an explanatory diagram showing an overview of a processor resource selection system according to the present invention.
FIG. 2 is an explanatory diagram showing a processor in charge of processor resource allocation processing according to the present invention.
FIG. 3 is an explanatory diagram illustrating a processor resource allocation processing procedure for each job class according to the present invention.
FIG. 4 is an explanatory diagram showing an outline of a computer system that reads and executes a program from a computer-readable recording medium according to the present invention.
FIG. 5 is an explanatory diagram showing an outline (part 1) of conventional processor resource selection processing;
FIG. 6 is an explanatory diagram showing an outline (part 2) of a conventional processor resource selection process.
[Explanation of symbols]
1: Processor resource allocation unit 11: Entry-program 12: Queue for holding submitted jobs for each job class
13: Resource allocation program 14: Processor allocation definition table 15: Processor usage status tables 21, 22, 23, 24, 25
: Processors constituting processor resources 3: Computer system 31: Main unit 32 incorporating a CPU, disk drive device, etc.: Display 33: Display screen 34: Keyboard 35: Mouse 36: External database -S (Destination memory such as DASD)
37: modem 38: portable recording medium 41, 42, 43, 44: queue
45: Processor resource used by queue 41: Processor resource used by queue 42: Processor resource shared by queue 43 and queue 44

Claims (3)

In the processor resource selection method in which the information processing apparatus assigns a processor to each job classified into classes,
The information processing apparatus includes:
By at least referring to a processor allocation definition table defining priority processors and pre-assignable expansion processors for each class,
When there is a vacancy in the priority processor defined in the first class to be executed, the priority processor is assigned to a job of the class ,
When the priority processor defined in the first class to be executed has no free space, the extended processor in the free state of the class is obtained, and the second processor class that defines the extended processor as the priority processor is determined. Assign an extended processor in a state in which no resource waiting job is entered to a job of the first class.
And a processor resource selection method. In a processor resource selection system that assigns a processor to each job classified into classes,
A processor allocation definition table defining priority processors and expansion processors that can be preliminarily allocated for each class ;
When at least the priority processor defined in the first class to be executed is empty with reference to at least the processor distribution definition table, the priority processor is assigned to a job of the class, and the first target to be executed is When the priority processor defined in the class has no free space, the extended processor in the free state of the class is obtained, and among them, there is no resource waiting job in the second class that defines it as the priority processor. Resource allocating means for allocating the status extension processor to the first class of jobs;
A processor resource selection system comprising: In a recording medium storing a program used for processor resource selection for assigning a processor to each job classified into classes,
The program is
At least referring to a processor allocation definition table defining priority processors and expansion processors that can be preliminarily allocated for each class;
When there is a vacancy in the priority processor defined in the first class to be executed, the priority processor is assigned to a job of the class ,
When the priority processor defined in the first class to be executed has no free space, the extended processor in the free state of the class is obtained, and the second processor class that defines the extended processor as the priority processor is determined. Assign an extended processor in a state in which no resource waiting job is entered to a job of the first class.
A computer-readable program recording medium characterized in that the function is realized by a computer.

Images