JP5050601B2 - Resource allocation method for job, resource allocation method for job, and program - Google Patents

Description

  The present invention relates to a resource allocation method for a job, and more particularly to a resource allocation method for a job, a resource allocation method for a job, and a program for adjusting a load balance when a plurality of jobs are executed in a single system.

As a conventional method for allocating resources to a job, there is a method for providing a schedule method for guaranteeing the CPU allocation time for the job (for example, Patent Document 1). In this conventional scheduling method, a CPU allocation guarantee target job is determined in advance, the CPU usage time of the job is measured, and if a CPU for a predetermined time or more is not allocated within a predetermined unit time, the CPU is preferentially used. Is assigned. To achieve this, it is determined whether the job is a CPU allocation guarantee target job at the start of the job. If it is determined that the job is a CPU allocation guarantee target job, the job management table of the job is assigned to the CPU allocation Register in the guaranteed job management table, and then determine whether the job is waiting for shared resources. If it is determined that the job is waiting for shared resources, the job that previously secured the shared resources It is determined whether or not the job is an allocation guarantee target job. If it is determined that the job is not a CPU allocation guarantee target job, the job management table of the job with the temporary priority flag set is registered in the CPU allocation guarantee job management table, and the shared resource Process to release. Further, the CPU allocation guarantee control unit activated from the timer processing unit updates the priority schedule queue with reference to the CPU usage time, CPU allocation guarantee time, and CPU allocation monitoring time after the job is activated, The scheduler is configured to perform CPU allocation processing for the job.

JP 2000-148512 A

  However, in this conventional method, in order to schedule a job and assign a CPU, it is necessary to execute a complicated process such as creating a job management table and registering it in the CPU assignment guaranteed job management table as described above. As a result, there is a problem that the overhead is large and the versatility is lacking.

  SUMMARY OF THE INVENTION An object of the present invention is to provide a resource allocation method for a job, a resource allocation method for a job, and a program which are excellent in versatility with a simple configuration with little overhead when a plurality of jobs are executed by a single system. There is.

  A resource allocation method for a first job according to the present invention includes a timer for notifying job switching based on a predetermined processor priority allocation time for each job and an instruction execution for executing a process instruction in an information processing system. A dispatcher that takes out the first process from the ready queue including the process corresponding to the job selected as the priority job based on the notification from the timer, assigns it to the instruction execution means, and executes the instruction of the process; Equipped with.

  The resource allocation method for the second job of the present invention is the resource allocation method for the first job, in which the dispatcher has the ready queue of the job selected as the priority job empty. Select the next priority job.

  The resource allocation method for a third job according to the present invention is the resource allocation method for the first or second job, wherein the processor preferential allocation time has a fixed time period as a system allocation ratio for each job. It is the time distributed by.

  The resource allocation method for a fourth job of the present invention is the resource allocation method for any of the first to third jobs, wherein the dispatcher includes an exception ready including an exception process for executing a predetermined process. If the exception process exists in the queue, the highest priority job corresponding to the exception process is prioritized over the priority job, the exception process at the head of the exception ready queue is taken out and assigned to the instruction execution means. The instruction of the exception process is executed.

  The resource allocation method for a fifth job of the present invention is the resource allocation method for any one of the first to fourth jobs, wherein the dispatcher has a priority order among processes corresponding to the priority job. If changed, the process being executed is returned to the corresponding ready queue, the process at the head of the ready queue is taken out, assigned to the instruction execution means, and the instruction of the process is executed.

  The resource allocation method for the sixth job of the present invention is the resource allocation method for the fourth to fifth jobs, wherein the dispatcher changes the priority order among the exceptional processes corresponding to the highest priority job. In this case, the exception process being executed is returned to the corresponding exception ready queue, the exception process at the head of the exception ready queue is taken out and assigned to the instruction execution means to execute the instruction of the exception process.

  The resource allocation method for a seventh job according to the present invention is the resource allocation method for any one of the first to sixth jobs, wherein the instruction execution means executes one process instruction by the timer. Each time, the time value of the priority period of the job corresponding to the process being executed is updated, and it is confirmed whether or not the processor priority allocation time of the job has been reached.

  The resource allocation method for the eighth job of the present invention is the resource allocation method for any one of the first to seventh jobs, wherein the processor priority allocation is performed in response to the end or addition of the job. A means for recalculating the time was provided.

  A resource allocation method for a job according to a first aspect of the present invention is a resource allocation method for a job in an information processing system, which notifies job switching based on a processor priority allocation time for each predetermined job, The head process is taken out from the ready queue including the process corresponding to the job selected as the priority job based on the notification, and the instruction of the process is executed.

  In the resource allocation method for the second job of the present invention, in the resource allocation method for the first job, when the ready queue of the job selected as the priority job based on the notification is empty Select the next priority job.

  The resource allocation method to a third job according to the present invention is the resource allocation method to the first or second job, wherein the processor preferential allocation time is a fixed time period and a system allocation ratio for each job. It is the time distributed by.

  The resource allocation method for a fourth job of the present invention is the resource allocation method for any one of the first to third jobs, wherein the exception is added to the exception ready queue including an exception process for executing a predetermined process. If there is a process, the highest priority job corresponding to the exception process is prioritized over the priority job, the exception process at the head of the exception ready queue is taken out, and the exception process instruction is executed.

  In the resource allocation method for a fifth job according to the present invention, in the resource allocation method for any of the first to fourth jobs, when the priority order changes between processes corresponding to the priority job. The process being executed is returned to the corresponding ready queue, the process at the head of the ready queue is taken out, and the instruction of the process is executed.

  The resource allocation method to the sixth job of the present invention is the resource allocation method to any one of the first to fifth jobs, wherein the priority order is changed between exceptional processes corresponding to the highest priority job. In this case, the exception process being executed is returned to the corresponding exception ready queue, the exception process at the head of the exception ready queue is taken out, and the instruction of the exception process is executed.

  According to a seventh method of allocating resources to a job of the present invention, in the resource allocating method to any one of the first to sixth jobs, a process being executed every time one instruction of the process is executed. Is updated, and it is checked whether or not the processor priority allocation time of the job has been reached.

  The resource allocation method to the eighth job of the present invention is the resource allocation method to any one of the first to seventh jobs, wherein the processor priority allocation in response to the end or addition of the job. A means for recalculating the time was provided.

  The program of the present invention notifies the information processing system of job switching based on a predetermined processor priority allocation time for each job and includes a process corresponding to the job selected as the priority job based on the notification. The first process is taken out from the queue, and processing for executing the instruction of the process is performed.

  According to the present invention, in the case where a plurality of jobs are executed in a single system, even when the load of a specific job increases, it is possible to prevent the performance degradation of other jobs and the situation where the jobs cannot be executed. It is possible to provide a resource allocation method for jobs with excellent versatility with a simple configuration with little overhead. The reason is that notification of switching of the priority period of the job is made based on the processor priority allocation time for each predetermined job, and the processor of the job selected as the job to be executed in the priority period based on the notification This is because the process is taken out from the head of the ready queue in which executable processes are queued, assigned to the processor and executed.

  Next, the present invention will be described in detail with reference to the drawings.

  Referring to FIG. 1, the first embodiment of the present invention includes an instruction execution unit 111, a dispatcher 112, a timer 113, a ready queue storage unit 114, and an allocated time storage unit 115.

  The instruction execution unit 111 executes instructions constituting the executable process selected by the dispatcher 112.

  The dispatcher 112 selects one of the executable processes that should execute the instruction from the group of executable processes 311 shown in FIG. The dispatcher 112 transmits a job priority period allocation time to the timer 113. When receiving the switching instruction from the timer 113, the dispatcher 112 switches the job in the priority period.

  When the timer 113 receives the allocation time, the timer 113 measures the priority period of the job, and outputs a switching instruction to the dispatcher 112 when the priority period reaches the allocation time.

  The ready queue storage unit 114 stores a ready queue group in which executable processes are queued for each job.

  Referring to FIG. 3, the ready queue group 303 includes ready queues 304 to 309 and a ready queue 310. The ready queues 304 to 309 correspond to jobs A to F, respectively, and constitute a queue of executable processes subordinate to the corresponding jobs A to F in the executable process group 311. For example, the ready queue 306 constitutes a queue of executable processes under the job C.

  The ready queue 310 corresponds to the highest priority job and constitutes a queue of executable exception processes under the ready queue 310. The highest priority job is a system common process that does not correspond to jobs A to F or a process that corresponds to jobs A to F but requires urgency is defined as an exception process. Show.

  When an executable process is connected to the ready queue 310, the dispatcher 112 selects the executable process connected to the head thereof with the highest priority. The instruction execution unit 111 executes an instruction of the selected executable process. Since the highest priority jobs corresponding to the assignment ratios 202 to 207 to the jobs A to F are not defined, there is no job corresponding to the processor priority allocation time.

  The executable process group 311 is a process group selected from the dispatcher 112 and waiting to be executed by the instruction execution unit 111.

  In general, processes that are connected to a ready queue to form a queue and are taken out of the ready queue and executed are techniques well known to those skilled in the art, but make it easier to understand the present embodiment. The useful points will be described. In the present embodiment, a process in an execution state by the instruction execution unit 111 is referred to as an executing process. There is only one process running at any given time. The process has a priority regarding the execution order in the jobs A to F or the highest priority job.

  Each of the ready queues 304 to 309 and the ready queue 310 constitutes a queue of executable processes in a first-in first-out manner according to the priority order in each ready queue. A process with higher priority is connected to the head of the corresponding ready queue than a process with lower priority. If processes with the same priority are connected, the process connected earlier in time is connected to the head of the corresponding ready queue. .

  Therefore, the executable process connected to the heads of the ready queues 304 to 309 and the ready queue 310 has the highest priority among the executable processes constituting the ready queues 304 to 309 and the ready queue 310, and the instructions It is a process that can be executed by the execution means 111 and can be an executing process.

  FIG. 2 is an example of a system configuration in which the present embodiment operates. The present embodiment includes a processor 131, a memory 132, an input / output control unit 133, a service processor 134, a peripheral device group 135, and a console 136.

  In the present embodiment, the processor 131 executes data processing including calculation in accordance with an instruction of a program. The instruction execution unit 111, the dispatcher 112, and the timer 113 are realized by their corresponding programs and the processor 131.

  In this embodiment, the memory 132 stores a program, a work area of the program, a buffer, and the like, and includes at least a ready queue storage unit 114 and an allocated time storage unit 115.

  The input / output control unit 133, the service processor 134, the peripheral device group 135, and the console 136 are well-known technologies that constitute a general computer system, and are not particularly positioned in the present embodiment. Omitted.

  FIG. 4 is a diagram showing the structure of the process identification number 101 in the system to which the present invention is applied using this embodiment. The job identification number 102 is a unique number in the system corresponding to each job. The process identification number 103 in the job is a unique number in the job corresponding to each process. The process identification number 101 in the system is a number obtained by combining the job identification number 102 and the process identification number 103 in the job, and is a unique number in the system corresponding to each process. Each job and each process executed in a system to which the present invention is applied using this embodiment are identified by a process identification number 101, a job identification number 102, and a process identification number 103 in the system. And controlled.

  Next, the operation of the first exemplary embodiment of the present invention will be described in detail with reference to specific examples with reference to FIGS.

  FIG. 5 shows an example of the period 201 and the system allocation ratios 202 to 207 as a basis for calculating the processor priority allocation time in the system to which the present invention is applied using the present embodiment. A period 201 is a period of a certain time for repeating the system assignment. The system allocation ratios 202 to 207 correspond to the jobs A to F, respectively, and indicate the system allocation ratio to each job within the period 201. For example, if the cycle is 500 μS and the system allocation ratio 202 for job A is 20%, the processor priority allocation time that is the priority period of job A is 500 μS × 0.2 = 100 μS.

  FIG. 6 is an image showing the assignment of the instruction execution means 111 to each job and the relationship between the dispatcher 112 and the timer 113 in the system to which the present invention is applied using the present embodiment.

  The dispatcher 112 refers to the allocation time table 402 of the allocation time storage unit 115 based on the job identification number 102 and acquires the allocation time corresponding to the job identification number 102. The dispatcher 112 outputs the acquired allocation time to the timer 113.

  The timer 113 acquires the allocated time and starts measuring the priority period of the job corresponding to the job identification number 102. The timer 113 outputs a priority job switching instruction 405 to the dispatcher 112 when the timing of the priority period reaches the allocated time. When the dispatcher 112 acquires the switching instruction 405, the dispatcher 112 switches the priority job. That is, the switching instruction 405 is an instruction for switching an executable process to be executed by the instruction execution unit 111.

  Execution periods 406 to 419 indicate that the corresponding job becomes a priority period and the instruction execution unit 111 is assigned. In the execution periods 406 to 411, the instruction execution unit 111 is assigned corresponding to the assignment time of the jobs A to F. The execution period 413 of the highest priority job exists between the execution periods 412 and 414 of the job A. In the execution period 412, an executable process is connected to the ready queue 310 of the highest priority job, and the execution of the top execution is performed. This represents a state where the possible process has the highest priority and the instruction execution means 111 is assigned. When there is no executable process connected to the ready queue 310 (when the ready queue 310 becomes empty), an execution period 414 follows the execution period 412 of the suspended job A. In the execution periods 414 to 417, the instruction execution means 111 is assigned corresponding to the assignment time of the jobs A to D. There is no execution period of job E between the execution periods 417 and 418, which represents that the ready queue 308 of job E is empty at this point. When the execution period 418 of the job F ends, the execution period 419 of the job A starts.

  FIG. 7 is a flowchart showing the basic operation of resource allocation to a job in a system to which the present invention is applied using this embodiment.

  In the following description, the state of the instruction execution unit 111 is defined as a state in which an executing process, which is a process being executed by the instruction execution unit 111, is not on the instruction execution unit 111 (empty state) and on the instruction execution unit 111. There is a state (process state) that is taken in and exists on the instruction execution means 111. In the process state, only one executing process existing on the instruction execution unit 111 is executed. As the executing process to be fetched into the instruction execution unit 111, only one executable process having the highest priority at that time is selected by the dispatcher 112 from the executable process group 311 connected to the ready queue group 303.

  In the following description, the ready queue m and the ready queue n indicate that they are any ready queues of the ready queue 304 to the ready queue 309.

  The dispatcher 112 checks whether there is an executing process belonging to the highest priority job on the instruction execution unit 111, and if there is, branches to step 511, and if not, proceeds to step 502 (step 501).

  The dispatcher 112 checks whether or not there is an executable process in the ready queue 310 of the highest priority job. If there is an executable process, the dispatcher 112 branches to step 514. If not, the dispatcher 112 proceeds to step 503 (step 502).

  The dispatcher 112 checks whether there is a priority job switching instruction 405 from the timer 113. The process branches to step 518 if the priority job switching instruction 405 exists, and proceeds to step 504 if not (step 503).

  The dispatcher 112 checks whether or not there is a process being executed on the instruction execution unit 111, and if there is, the process proceeds to step 505, and if not, the process branches to step 523 (step 504).

  The dispatcher 112 checks whether there is a process switch factor in the same job. If there is a process switch factor, the process proceeds to step 506, and if not, the process proceeds to step 507 (step 505). The process switch returns the process being executed on the instruction execution unit 111 to the executable process group 311, selects one executable process according to the regulation from the executable process group 311, and executes the instruction execution unit 111. This is the process to be executed above.

  The dispatcher 112 makes an executable process on the instruction execution unit 111 return to the corresponding ready queue m to be an executable process, and the executable process existing at the head of the ready queue m is loaded into the instruction execution unit 111 and is being executed. Let it be a process. Thereby, the process switch in the same job is implemented, and the process proceeds to Step 507 (Step 506).

  The instruction execution unit 111 executes one instruction of the process being executed on the instruction execution unit 111. This instruction is one of the instruction groups constituting the process, and is an instruction selected from the instruction group according to a predetermined rule. Thereafter, the process proceeds to step 508 (step 507).

  The timer 113 updates the time value of the job to which the executing process on the instruction execution unit 111 belongs, and measures the allocated time given to the job. Thereafter, the process proceeds to step 509 (step 508).

  The dispatcher 112 checks whether or not the process being executed on the instruction execution unit 111 can be continuously executed. This is because, depending on the execution result of the instruction in step 507, the in-execution process has a rule for transition from an executable state to another state. If the process can be continued, the process branches to step 501; otherwise, the process proceeds to step 510 (step 509).

  The dispatcher 112 causes the running process on the instruction execution unit 111 to transition from the running state to an appropriate state defined by the rules. As a result, there is no executing process on the instruction execution unit 111. Thereafter, the process branches to step 501 (step 510).

  FIG. 8 is a flowchart showing an operation in the case where there is an executing process belonging to the highest priority job on the instruction execution unit 111. The dispatcher 112 checks whether there is a process switch factor in the highest priority job. If there is a factor, the process proceeds to step 512, and if not, the process proceeds to step 513 (step 511).

  The dispatcher 112 makes an executable process on the instruction execution unit 111 return to the ready queue 310 of the highest priority job, and makes the executable process existing at the head of the ready queue 310 on the instruction execution unit 111. The process is being executed (step 512).

  The dispatcher 112 executes one instruction of the process being executed on the instruction execution unit 111. The process being executed in this step 513 belongs to the highest priority job. Thereafter, the processing proceeds to step 509. Since there is no highest priority job corresponding to the processor priority allocation time, step 508 is not executed (step 513).

  FIG. 9 is a flowchart showing an operation when there is no executing process belonging to the highest priority job on the instruction execution unit 111 and there is an executable process in the ready queue 310 of the highest priority job. The dispatcher 112 checks whether or not there is an executing process belonging to the jobs A to F on the instruction execution unit 111, and if there is, the process proceeds to step 515, and if not, the process proceeds to step 516 (step 514). .

  The dispatcher 112 returns the executing process belonging to the jobs A to F on the instruction execution unit 111 to the corresponding ready queue m to be an executable process. Thereafter, the process proceeds to step 516 (step 515).

  The dispatcher 112 fetches the executable process existing at the head of the ready queue 310 of the highest priority job into the instruction execution unit 111 and sets it as an executing process (step 516).

  The dispatcher 112 executes one instruction of the executing process fetched in step 516. Thereafter, the process branches to step 509. Since there is no highest priority job corresponding to the processor priority allocation time, step 508 is not executed (step 517).

  FIG. 10 is a flowchart showing an operation when there is no executing process or executable process belonging to the highest priority job and there is a priority period switching instruction 405 from the timer 113. The dispatcher 112 checks whether there is a process being executed on the instruction execution unit 111. This executing process belongs to one of jobs A to F. The process proceeds to step 519 if there is an executing process on the instruction execution unit 111, and proceeds to step 520 if not (step 518).

  The dispatcher 112 returns the executing process on the instruction execution unit 111 to the corresponding ready queue m. This running process belongs to a job whose priority period has ended. Thereafter, the process proceeds to step 520 (step 519).

  The dispatcher 112 switches the priority period to the next job, and outputs the allocated time corresponding to the job to the timer 113. The priority job switching instruction 405 for the corresponding priority period is reset. Thereafter, the process proceeds to step 521 (step 520).

  The dispatcher 112 checks whether there is an executable process in the ready queue n (n = 304 to 309) corresponding to the job to which the priority period is switched, and if there is, the process proceeds to step 522. The process branches to step 501 (step 521).

  The dispatcher 112 fetches the executable process existing at the head of the ready queue n onto the instruction execution unit 111 and sets it as a process being executed. Thereafter, the process branches to step 507 (step 522).

  FIG. 11 shows that there is no executing process and executable process belonging to the highest priority job, there is no priority period switching instruction 405 from the timer 113, and the executing process belonging to jobs A to F on the instruction execution unit 111. It is a flowchart which shows the operation | movement when there is not. The dispatcher 112 checks whether there is an executable process in the ready queue m corresponding to the job to which the priority period is assigned, and proceeds to Step 524 if it exists. If not, the process branches to step 520, and the priority period is switched to the next job (step 523).

  The dispatcher 112 fetches the executable process existing at the head of the ready queue m corresponding to the job assigned the priority period into the instruction execution unit 111 and sets it as an executing process. Thereafter, the process branches to step 507 (step 524).

  In this way, the dispatcher 112 fetches the process belonging to the job from the head of the ready queue corresponding to the job in accordance with the rule within the priority allocation time of the job according to the rule described above, and executes the instruction execution means. It is assumed that the running process on 111.

  According to the first embodiment of the present invention, a processor allocation time based on a predetermined system allocation ratio for each job is set as a priority period for each job, and a ready queue corresponding to each job is assigned to each job. By connecting the executable processes that belong to each other and selecting the executable process connected to the head of the ready queue corresponding to each job in the priority period for each job, it can be assigned to the processor and executed. The processor allocation time for the system is almost the same as the preset system allocation ratio for each job, and when multiple jobs are executed on a single system, even if the load of a specific job increases, To prevent the situation where the job cannot be executed or the system allocation ratio decreases It has the advantage of being ability.

  Further, according to the first embodiment of the present invention, even if one job is in the priority job period, when there is no work to be executed and the ready queue of the priority job is empty, By switching the job to the priority job, the load of a specific job is reduced, and if the system usage time of the job is less than the predetermined system allocation ratio, the system time is not wasted, This has the effect that it is possible to assign a system to a job.

  Furthermore, according to the first embodiment of the present invention, a job requiring system common processing or urgency is defined as the highest priority job, and a ready queue corresponding to the highest priority job is provided, and an executable process is provided in the ready queue. When connected, that is, when a job to be executed in the highest priority job occurs, the system is assigned with the highest priority, so that the highest priority job is determined as to whether a general job is a priority job or not. Regardless, the system can be assigned with the highest priority.

  Next, a second embodiment of the present invention will be described in detail with reference to the drawings.

  FIG. 12 is a block diagram showing the configuration of the second exemplary embodiment of the present invention. In the second embodiment of the present invention, the allocation time calculation means 116 is added to FIG. 1 which is a block diagram showing the configuration of the first embodiment of the present invention. This is different from the first embodiment.

  The allocation time calculation unit 116 acquires, for example, the period 201 illustrated in FIG. 5 and the system allocation ratios 202 to 207 for each job input from the service processor 134 illustrated in FIG. 2 or the console 136. Then, the allocation time calculation means 116 calculates the processor priority allocation time for each job based on the cycle 201 shown in FIG. 5 and the system allocation ratios 202 to 207 for each job, and stores them in the allocation time table 402 in FIG. .

  The operation of the second embodiment will be described in detail with reference to the example shown in FIG. The allocation time calculation unit 116 sets “500” as the period 201 = T [μs] shown in FIG. 5 and “20” as the system allocation rate 202 = Ra [%] of the job A from any unit (not shown). System allocation rate 203 = Rb [%] of the job D, “30” as the system allocation rate 204 of the job C = Rc [%], and “12” as the system allocation rate 205 of the job D = Rd [%] Then, “18” is acquired as the system allocation ratio 206 of job E = Re [%], and “10” is acquired as the system allocation ratio 207 of job F = Rf [%]. Based on these, the allocation time calculation unit 116 sets the processor priority allocation time for job A = 500 [μs] × 0.2 = 100 [μs] and the processor priority allocation time for job B = 500 [μs] ×. 0.1 = 50 [μs], processor C processor priority allocation time = 500 [μs] × 0.3 = 150 [μs], job D processor priority allocation time = 500 [μs] × 0.12 = 60 [μs], job E processor priority allocation time = 500 [μs] × 0.18 = 90 [μs], job F processor priority allocation time = 500 [μs] × 0.1 = 10 [μs] Is calculated. The allocation time calculation means 116 stores the allocation time in the allocation time table 402 shown in FIG.

  Furthermore, the allocation time calculation means 116 has a recalculation function for recalculating the processor priority allocation time when a job ends or a job is added.

  The operation for recalculating the processor priority allocation time when job G is added to the state shown in FIG. 5 will be specifically described below. When the dispatcher 112 detects the addition of a job, it instructs the allocation time calculation unit 116 to recalculate the processor priority allocation time. The allocation time calculation unit 116 acquires the system allocation ratio Rg [%] = “10” of job G. Here, the cycle 201 = “500 [μs]” shown in FIG. 5 is distributed as the total “100%” of the system allocation ratios of the existing jobs A to F. For this reason, the allocation time calculation unit 116 recalculates the system allocation ratios of jobs A to F so that the total system allocation ratio of job G is 100%. The allocation time calculation means 116 is configured so that the system allocation ratio 202 of job A = Ra [%] = 20 [%] ÷ 1.1 = 18 [%], and the system allocation ratio of job B 203 = Rb [%] = 10 [%]. ] ÷ 1.1 = 9 [%], the same applies to job C and the following, and the system allocation ratio Rg [%] = 10 [%] ÷ 1.1 = 9 [%] of job G is calculated.

  Then, the allocation time calculation unit 116 recalculates the processor priority allocation time of each job based on the recalculated system allocation ratio of each job.

  In the above example, the case where the system allocation ratio is recalculated without changing the period has been described. However, for the period 201 = “500 [μs]”, the system allocation ratio Rg [%] of the job G = “ The processor preferential allocation time “50 μs” corresponding to “10” may be added to the cycle and recalculated as cycle 201 = “550 [μs]”.

  Also, the same method can be easily applied when a job is completed.

According to the second embodiment of the present invention, the processor priority allocation time for each job is calculated based on the allocation cycle and the system allocation ratio for each job, and in response to the end or addition of the job. By doing so, there is an effect that it is possible to provide a general-purpose resource allocation method for jobs that can save the effort of calculating the processor priority allocation time in advance.

  The present invention can be used in a general information processing apparatus, but is particularly effective when a plurality of functions are processed on one processor.

  As an application example of the present invention, when input / output processing of a network, a disk, a tape, a console, etc. is performed on one processor, the processor can be used efficiently at a predetermined rate for each processing. .

It is a block diagram which shows the structure of the 1st Embodiment of this invention. It is a figure which shows the system configuration | structure of the 1st and 2nd embodiment of this invention. It is a figure which shows the image of the ready queue group and executable process group in the 1st Embodiment of this invention. It is a figure which shows the structure of the process identification number in the 1st Embodiment of this invention. It is an example of the period 201 in the 1st Embodiment of this invention, and system allocation time. It is a figure which shows the assignment of the processor with respect to each job in the 1st Embodiment of this invention, and the relationship between a dispatcher and a timer. It is a flowchart which shows the basic operation | movement of the resource allocation to the job in the 1st Embodiment of this invention. It is a flowchart which shows operation | movement when the process under execution which belongs to the highest priority job exists on the processor in the 1st Embodiment of this invention. 6 is a flowchart showing an operation when there is no executing process belonging to the highest priority job on the processor and there is an executable process in the ready queue of the highest priority job in the first embodiment of the present invention. 7 is a flowchart showing an operation when there is no executing process or executable process belonging to the highest priority job and there is a priority period switching instruction from the timer according to the first embodiment of the present invention. There is no executing process and executable process belonging to the highest priority job in the first embodiment of the present invention, there is no priority period switching instruction from the timer, and an execution belonging to jobs A to F on the processor It is a flowchart which shows operation | movement when there is no process. It is a block diagram which shows the structure of the 2nd Embodiment of this invention.

Explanation of symbols

DESCRIPTION OF SYMBOLS 101 Process identification number in system 102 Job identification number 103 Process identification number in job 111 Instruction execution means 112 Dispatcher 113 Timer 114 Ready queue memory | storage part 115 Allocation time memory | storage part 116 Allocation time calculation means 131 Processor 132 Memory 133 Input / output control part 134 Service Processor 135 Peripheral Device Group 136 Console 201 Period 202 to 207 System Allocation Ratio 304 to 309 Ready Queue 310 Ready Queue 311 Executable Process Group 402 Allocation Time Table 405 Priority Job Switching Instruction 406 to 419 Execution Period

Claims (11)

A timer for notifying job switching based on a processor priority allocation time in which a predetermined period of time is distributed at a system allocation ratio for each job;
An instruction execution means for executing an instruction of the process;
A dispatcher that takes out the first process from the ready queue including the process corresponding to the job selected as the priority job based on the notification from the timer, assigns it to the instruction execution means, and executes the instruction of the process;
Means for recalculating the processor priority allocation time based on the system allocation ratio for each job in response to the end of the job and the additional occurrence ,
The dispatcher checks whether the exception process exists in an exception ready queue including an exception process that executes a predetermined process each time the instruction execution unit executes one instruction of the process, and the exception ready queue If the exception process exists, the highest priority job corresponding to the exception process is prioritized over the priority job, and the exception process at the head of the exception ready queue is extracted and assigned to the instruction execution means. A resource allocation method for jobs that execute instructions of exceptional processes . The resource allocation method for a job according to claim 1, wherein the dispatcher selects the next priority job when the ready queue of the job selected as the priority job is empty. When the priority order changes between processes corresponding to the priority job, the dispatcher returns the process being executed to the corresponding ready queue, extracts the head process of the ready queue, and assigns it to the instruction execution unit. Te resource allocation scheme to claim 1 or 2 Symbol placement job, characterized in that to execute the instructions of the process. When the priority changes between the exception processes corresponding to the highest priority job, the dispatcher returns the exception process being executed to the corresponding exception ready queue and extracts the exception process at the head of the exception ready queue. The resource allocation method for a job according to any one of claims 1 to 3, wherein an instruction of the exception process is executed by being assigned to the instruction execution means. The timer updates the time value of the priority period of the job corresponding to the process being executed each time the instruction execution means executes one instruction of the process, and whether the processor priority allocation time of the job has been reached. resource allocation scheme to a job according to any one of claims 1 to 4, characterized in that to check whether. Computer system
Notification of job switching based on the processor priority allocation time in which a predetermined period of time is distributed at a system allocation ratio for each job,
From the ready queue including the process corresponding to the job selected as the priority job based on the notification, the head process is taken out and the instruction of the process is executed.
Completion of the job, out again calculated on the basis of the corresponding additional generating said processor priority allocation time to the system allocation ratio for each of the jobs,
Each time the instruction execution unit executes one instruction of the process, it checks whether the exception process exists in an exception ready queue including an exception process that executes a predetermined process, and the exception process is executed in the exception ready queue. The priority job corresponding to the exception process is prioritized over the priority job, the exception process at the head of the exception ready queue is taken out and assigned to the instruction execution means, and the instruction of the exception process is assigned. To allocate resources to jobs that execute . Wherein when the ready queue of the job selected as the priority job based on the notification is empty, the resource allocation method to claim 6 Symbol mounting job and selects the next priority job. When the priority order changes between processes corresponding to the priority job, the process being executed is returned to the corresponding ready queue, the process at the head of the ready queue is taken out, and the instruction of the process is executed. resource allocation method to claim 6 or 7 Symbol mounting job to. When the priority changes between the exception processes corresponding to the highest priority job, the exception process being executed is returned to the corresponding exception ready queue, the exception process at the head of the exception ready queue is taken out, and the exception process resource allocation method to the job according to any one of claims 6 to 8, wherein the executing instructions. Each time one instruction of the process is executed, the time value of the priority period of the job corresponding to the process being executed is updated to check whether or not the processor priority allocation time of the job has been reached. resource allocation method to the job according to any one of claims 6乃 optimum 9,. Computer system,
Notification of job switching based on the processor priority allocation time in which a predetermined period of time is distributed at a system allocation ratio for each job,
From the ready queue including the process corresponding to the job selected as the priority job based on the notification, the first process is taken out,
Recalculating the processor priority allocation time in response to the end of the job and the occurrence of addition based on the system allocation ratio for each job ,
Each time the instruction execution unit executes one instruction of the process, it checks whether the exception process exists in an exception ready queue including an exception process that executes a predetermined process, and the exception process is executed in the exception ready queue. The priority job corresponding to the exception process is prioritized over the priority job, the exception process at the head of the exception ready queue is taken out and assigned to the instruction execution means, and the instruction of the exception process is assigned. A program characterized by causing a process to be executed .

Images