JPH03147137A - System for allocating resources to resources waiting process - Google Patents

Abstract

PURPOSE:To exactly execute the resources allocation to a process decided to be optimal at that time point by the system in accordance with priority by executing the priority control and the request resources management of the resources waiting process. CONSTITUTION:A priority determining/storage means 1 determines the priority of a process which becomes resources waiting at the time of processing for allowing the process for requesting to secure resources to wait due to resources shortage or other factor and stores it in a priority storage part 7. A request resources storage means 2 stores request resources of the process in which the priority is stored in the priority storage part 7 in a request resources storage part 8 by the priority determining/storage means 1. A request storage allocating means 5 allocates resources read out by a request resources reading-out means 4 to the process in order of high priority in a priority table read out by a priority table reading-out means 3, and a priority storage changing means 6 deletes the priority of the process to which resources are allocated by the request resources allocating means 5 from the priority storage part 7. In such a way, the allocation of resources being faithful to the priority can be executed.

Description

[Detailed Description of the Invention] [Industrial Application Field] The present invention relates to a resource allocation method to a resource waiting process.
In particular, the present invention relates to a method for allocating resources to processes waiting for resources, which reallocates resources to processes waiting for resources due to resource shortages, etc.

[Conventional technology]

Conventionally, in this type of resource allocation method for resource-waiting processes, resource reallocation to resource-waiting processes is achieved by having all processes in a resource-waiting state re-request resources at the same time or sequentially. was.

[Problem to be solved by the invention]

In the conventional method of allocating resources to resource-waiting processes as described above, it is not possible to accurately determine whether the allocation will be successful as a result of re-requesting the resource, so there is no need to transfer wasteful processes from virtual storage space to real storage space. The disadvantage is that space loads may occur frequently, causing problems in execution performance.

Furthermore, when all processes waiting for a resource are made to re-request the resource at the same time, the process that acquires the resource is not necessarily the process that has the highest resource waiting priority (hereinafter simply referred to as priority). First, there is a drawback that the scheduling of processes may not match the intentions of the system designer.

In view of the above-mentioned points, an object of the present invention is to provide a method for allocating resources to processes that are waiting for resources, which eliminates the need for re-requesting resources from processes that are waiting for resources, and which makes it possible to allocate resources faithfully to priorities. Our goal is to provide the following.

[Means to solve the problem]

The method of allocating resources to resource-waiting processes according to the present invention is to determine the priority of a process that is waiting for a resource and to store it in a priority storage unit when a process that requests resource reservation is made to wait due to lack of resources or other factors. a priority determination/storage means; a requested resource storage means for storing, in a requested resource storage, the requested resources of a process whose priority is stored in the priority storage by the priority determination/storage means; and resource release for other processes. priority list reading means for reading out from the priority storage unit a priority list of processes waiting for resources released at the time of reallocation processing, etc.; and priorities in the priority list read by the priority list reading means. requested resource reading means for reading out the requested resources of a process having the requested resource from the requested resource storage unit; request resource allocation means for allocating the issued resources;
and priority storage changing means for deleting the priority of the process to which resources have been allocated by the requested resource allocation means from the priority storage.

[Effect]

In the resource allocation method for resource-waiting processes of the present invention, the priority determination/storage means determines the priority of the resource-waiting process and gives priority to it when the process that requests resource reservation is made to wait due to lack of resources or other factors. The requested resource storage means stores in the requested resource storage section the requested resources of the processes whose priorities have been stored in the priority storage section by the priority determination/storage means, and the priority list reading means At the time of reallocation processing due to process resource release, etc., the priority list of the process waiting for the released resource is read from the priority storage unit, and the request resource reading means selects the priority list from the priority list read by the priority list reading means. The requested resources of the processes having the rankings are read from the requested resource storage section, and the requested resource allocation means reads out the requested resources to the processes in descending order of priority in the priority list read out by the priority list reading means. The priority storage changing means deletes the priority of the process to which the resource has been allocated by the requesting resource allocation means from the priority storage section.

〔Example〕

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

FIG. 1 is a block diagram showing the configuration of a method for allocating resources to processes waiting for resources according to an embodiment of the present invention. A priority determination/storage means 1 determines the priority of a process that is to wait for resources when a process is made to wait due to lack of resources or other factors and stores it in a priority storage section 7, and a priority determination/storage means 1 determines the priority of a process that is to wait for resources due to resource shortage or other factors. Request resource storage means 2 stores the requested resources of processes whose priorities are stored in the storage unit 7 in the requested resource storage unit 8, and the priority of processes that wait for resources released during reallocation processing due to resource release etc. of other processes. The priority list reading means 3 reads out the priority list from the priority storage section 7, and the requested resource of the process having the priority order in the priority list read out by the priority list reading means 3 is read from the requested resource storage section 8. requested resource reading means 4; requested resource allocation means 5 for allocating the resources read by the requested resource reading means 4 to processes in order of priority in the priority list read by the priority list reading means 3; a priority storage changing unit 6 for deleting the priorities of processes to which resources have been allocated by the resource request allocation unit 5 from the priority storage unit 7; a priority storage unit 7 for storing the priorities of processes; and a requested resource storage unit 8 that stores .

Referring to FIG. 2, the priority storage unit 7 stores process identifiers (hereinafter abbreviated as process ID) in descending order of priority.

Similarly, referring to FIG. 2, the requested resource storage unit 8 has the following information:
Requested resources are stored in correspondence with process IDs.

Next, the operation of the resource allocation method for the resource waiting process of this embodiment configured as described above will be explained.

It is assumed that before the process P1 enters the waiting state for the resource R1, the contents of the priority storage unit 7 and the requested resource storage unit 8 are as shown in FIG. 2, for example.

When the process PI enters the waiting state for the resource R1, the priority determination/storage unit 1 determines the priority n of all the processes currently in the resource waiting state for the process P1.
1, priority n1 and process ID (PL)
is stored in the priority storage unit 7. Also, at the same time,
The requested resource storage means 2 stores the requested resources R1,
R2 and R3 are stored in the request resource storage unit 8 with the process ID (P
l) Correspondingly stored. As a result, the contents of the priority storage section 7 and the requested resource storage section 8 become as shown in FIG.

In this state, resource R1 is released due to resource release of other processes, etc.
, R4 and R5, the priority list reading means 3 uses this as an opportunity to release all processes P2. A list of priorities n2n3 and nl of P3 and Pl is obtained from the priority storage unit 7.

Next, the requested resource reading means 4 reads the requested qualities 'tAR4 and R5 of the process P2 with the priority level n2, the requested resources R4 and R6 of the process P3 with the priority level n3, and the requested resources 'tAR4 and R5 of the process P2 with the priority level n2,
The required qualities 6 RIR2 and R3 of the process P1 are obtained from the required resource storage unit 8.

Subsequently, the request resource allocation means 5 assigns processes P2 . Resource allocation processing is performed for process P3 with priority n3 and process P1 with priority n1, and if resources R2 and R3 are not allocated υ1 to other processes, process P2 with priority n2 and priority ( The resource allocation process is successful for the process PI of stand n1, and resources 'aR4 and R5 and resource BR are
1, R2 and R3, respectively.

Finally, the priority storage changing means 6 stores the priority n2 of the process P2 to which the resources aR4 and R5 and the resources R1, R2 and R3 are allocated by the request resource allocation means 5.
Then, the process ID (R2), the priority n1 of the process P1, and the process ID (PI) are deleted from the priority storage section 7, and the priority is reset.

〔Effect of the invention〕

As explained above, the present invention enables resource allocation without unnecessary restarting of resource waiting processes during resource reallocation processing due to resource release etc. by controlling the priority of resource waiting processes and requesting resource management. It is now possible to judge processes, eliminating the need for unnecessary process space loading from virtual storage space to real storage space, and making it possible to accurately allocate resources to processes that the system determines to be optimal at that time according to priority. It has the effect of becoming

[Brief explanation of the drawing]

FIG. 1 is a block diagram showing the configuration of a resource allocation method for resource-waiting processes according to an embodiment of the present invention, and FIG.
A diagram illustrating an example of the contents of the priority storage section and the requested resource storage section in the figure before the resource waiting process of the process. FIG. 4 is a diagram showing an example of the contents after the resource reallocation process due to resource release in the priority list section 4g and the requested resource storage section in FIG. 1. In the figure, ■...Priority determination/storage means, 2...Required resource storage means, 3...Priority list reading means, 4...Required resource reading means, 5...Required resource allocation means. , 6...Priority storage changing means, nl, n2. n3 - priority, PI, R2, R3 - process, R1, R2, R3, R4, R5, R6 - resource. Figure 2 Figure 3 Figure 4

Claims (1)

[Scope of Claims] Priority determination/storage means that determines the priority of a process that is to wait for a resource when a process that requests resource reservation is made to wait due to lack of resources or other factors, and stores the priority in a priority storage unit; requested resource storage means for storing in a requested resource storage section the requested resources of the processes whose priorities are stored in the priority storage section by the priority order determination/storage means; priority list reading means for reading out a priority list of processes waiting for the requested resources from the priority storage unit; and requesting resources of processes having priorities in the priority list read by the priority list reading means. requested resource reading means for reading from the requested resource storage unit; and a request to allocate the resources read by the requested resource reading means to processes in order of priority in the priority list read by the priority list reading means. A method for allocating resources to processes waiting for resources, comprising: a resource allocating means; and a priority memory changing means for deleting the priority of a process to which resources have been allocated by the requested resource allocating means from the priority memory. .