JPS62235646A - Resource managing system - Google Patents

Abstract

PURPOSE:To efficiently manage resources by measuring a load state of the resources and informing it to a queue registering mechanism, monitoring whether an allocation of resources has been executed to the most backward registered task of a queue or not at the time of registering a task, and managing the registration. CONSTITUTION:Whether an allocation has been executed or not within a prescribed time to a task 11 which has been registered in the most backward part of a resource queue 10 is monitored by a resource load measuring instrument 20, and when the allocation has been executed, it is decided that a load is low, and if it is not so, it is decided that the load is high, and it is informed to a resource queue registering mechanism 30. Also, it is informed in advance that a load of the task 11 or a priority 7 is high, and the task 11 of a priority 4, which has been generated newly by the mechanism 30 is registered, after the task 11 of the priority 7, and before the task 11 of a priority 9, to which a prescribed time does not elapse.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a resource management method for a computer data processing system, and more particularly to a resource management method by dynamically changing queue control.

[Conventional technology]

Conventionally, tasks are registered in a resource queue using a fixed method, such as always registering tasks at the end of the resource queue regardless of the resource load status, or always registering tasks with high priority at the front. Ta.

The case where tasks are registered in order of priority will be described below with reference to the drawings.

Figure 2 (a), (b), (C) and Figure 3 (a)
, (b), and (c) are diagrams illustrating, in order of steps, a conventional method of registering tasks based on priorities in a state where the load on resources is low and when the load on resources is high.

In Figures 2 and 3, 10 is the main memory, 11 is the task, 1
2 is a pointer indicating the first task on the resource queue lO;
111 is a pointer indicating the next task on the resource queue, 3
0 is a resource queue registration mechanism that registers a task in resource queue 1, and the numerical value in parentheses of task 11 indicates the priority of the task, and the smaller the value, the higher the value.

Suppose that a task with priority (6) requests a resource as shown in FIG. 2(b) in the state shown in FIG. 2(a).
The resource queue registration mechanism 30 registers the task after the priority level 5 task, resulting in the state shown in FIG. 2(C).

Here, the load is not as high as #1, where the resource requests of tasks with priorities (31, (5), and (6)) do not occur until resources are allocated to tasks with priority (7). In this case, even if the priority is low, resources will be allocated to a certain number of queues K.

However, in a highly loaded state where resource requests for tasks with priorities (3), (5), and (6) occur before resources are allocated to tasks with priority 7, resources may not be allocated at all. I can't do it anymore.

FIGS. 3A to 3C show that the task with priority (3) requested the resource again before the resource was allocated to the task with priority (5). In such a high load state, a task with a high priority repeatedly receives resource allocation, while a task with a low priority cannot receive any resource allocation at all until its load becomes low.

[Problem that the invention seeks to solve]

The conventional general resource allocation described above is performed in order from the request of the task registered at the head of the resource queue, so the time from when the request is made until the resource is allocated is
It depends on the load status of the resource and how it is registered in the resource queue. In this way, if tasks are registered in a resource queue using a fixed method regardless of the load status of the resource, even if the registration method focuses on low load conditions, it may become inappropriate under high load conditions. However, if a method focuses on a high-load state, the problem is that it is inappropriate for a low-load state.

An object of the present invention is to provide a resource management method that can dynamically change the method of allocating resources to tasks in a resource queue by measuring the load status of resources, thereby managing resources efficiently. It is in.

[Means for solving problems]

The configuration of the resource management method of the present invention includes a resource queue registration mechanism that registers a task requesting the resource in a resource queue in which a plurality of tasks in a resource waiting state are registered, and a resource queue registration mechanism that measures the load state of the resource and and a resource load measuring device that notifies the resource queue registration mechanism of the result, and when registering the task in the resource queue, the resource load measuring device determines whether the task is busy within a certain period of time or at the end of the resource queue. It monitors whether or not the resource has been allocated to the task registered in the task, and if the resource has been allocated, it is determined that the load is low, and if it has not been allocated, it is determined that the load is high. Notify the resource queue registration mechanism to that effect, and as a result of this notification, if the resource queue is in the low load state, the priority of the task is +1i1.
In addition, in the high load state, even if the task that occurs later has a high priority, the task is not registered ahead of the task that has been waiting for assignment on the wage source queue for more than the certain period of time, and , and behind it, the priority is Jl!
It is characterized by dynamic task registration and management.

〔Example〕

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

FIGS. 1A, 1B, and 1C are block diagrams illustrating a task registration method according to an embodiment of the present invention in the order of steps.

In the figure, 10 is a main memory, 11 is a task, and 12 is a pointer or mechanism indicating the top task on the resource queue 10.

In this embodiment, the resource queue 1o is registered and managed in a state where the load is low so that the tasks are arranged in order of priority, and when the load is high, tasks that occur later are kept waiting for a certain period of time even if their priority is high. Tasks waiting for assignment on the queue are also registered and managed so that they are not registered earlier on the queue, and the tasks later on are arranged in order of priority.

In addition, the resource load measuring device 20 monitors whether or not resources have been allocated to the task that is registered as the last busy in the resource queue 10 within a certain period of time, and if the resource has been allocated, the load is reduced. If it is determined that the load is low and no allocation has been made, it is determined that the load is high, and the resource queue registration mechanism 30 is notified of this fact.

In FIG. 1(a), the resource load measuring device 20 monitors whether or not a task with a priority level (1) receives resource allocation within a certain period of time.

The resource load measurement device 20 notifies the resource queue registration mechanism 30 that the resource load is high because the task with priority (7) has not received resource allocation within a certain period of time (8
Figure 1 (b)).

As a result, the υ resource queue registration mechanism 30 assigns the newly generated task with priority (4) later than the task with priority (4) that has not received resource allocation within a certain period of time, and after starting queuing. It is registered before tasks with priority (9) for which a certain period of time has not elapsed (FIG. 1(C)).

Note that the priority of the task monitored by the resource load measuring device 20 has been changed to (9)K at the stage shown in FIG. 1(b).

〔Effect of the invention〕

As explained above, by measuring the load status of resources and dynamically changing the method of registering tasks in the resource queue based on the load status, flexible and efficient resource management is possible. .

[Brief explanation of drawings]

FIGS. 1(a), (b), and (C) are block diagrams illustrating a task registration method according to an embodiment of the present invention in the order of steps, and FIG. 2(a). (b), (C), Figure 3 (a), (b3. (C)
1 is a block diagram illustrating, in order of steps, a conventional method of registering tasks based on priorities in a state where the load on resources is low and when the load on resources is high; FIG. 10...Main storage device, 11...Task, 12...Pointer indicating the first task on the resource queue, 20...Resource load measuring device ,3o・
. . . Resource queue registration mechanism, 111 . . . Pointer indicating the next task on the resource queue. ,''--' Agent Patent Attorney Susumu Uchihara 31.

Claims (1)

[Claims] A resource queue registration mechanism that registers a task requesting the resource in a resource queue in which a plurality of tasks in a resource waiting state are registered; and a resource queue registration mechanism that measures the load state of the resource and notifies the resource queue registration mechanism of the result. and a resource load measuring device that performs a resource load measuring device, and when registering the task in the resource queue, the resource load measuring device measures the resource for the task registered at the rear of the resource queue within a certain period of time. If the allocation has been made, it is determined that the load is low, and if the allocation has not been made, it is determined that the load is high, and this fact is sent to the resource queue registration mechanism. As a result of this notification, the resource queue is arranged in order of priority of the tasks when the load is low, and when the load is high, the tasks that occur later are ordered to queue the resources for more than the certain period of time even if they have a high priority. The task is managed by dynamically registering tasks so that they are not registered ahead of the task waiting for assignment on the queue, and in order of priority after that task. resource management method.