JPH0365732A - Resource management method - Google Patents

Abstract

(57) [Summary] This bulletin contains application data before electronic filing, so abstract data is not recorded.

Description

DETAILED DESCRIPTION OF THE INVENTION Field of Industrial Application The present invention relates to a resource management method used in an information processing system.

Conventional technology Traditionally, semaphores have been used to manage resources, and when a request to acquire a resource is made, the requested number is compared with the semaphore value, and the requested number is subtracted from the semaphore value. It was stated that resources could be acquired only within the range in which the value did not become negative.

Problems to be Solved by the Invention However, in conventional resource management methods, the number of newly obtainable resources is the number recorded in the semaphore, and the resource is acquired by a low-priority task that requested the resource first. There was a problem in that resources that had already been used could not be acquired, and high-priority tasks were forced to wait for lower-priority tasks. The present invention is intended to solve such conventional problems, and aims to provide an excellent resource management method that can effectively utilize resources.

Means for Solving the Problems In order to achieve the above object, the present invention has a part that stores the number of resources that have not been acquired by any task, and a part that stores the number of resources that each task has already acquired (hereinafter referred to as acquired). It has a part that stores the number of resources (referred to as the number of resources) and the number of resources that have not yet been acquired (hereinafter referred to as the number of unacquired resources), and the storage part is organized into keys arranged in descending order of priority for each task. It is designed to connect and manage resources.

Effect of the present invention With the above configuration, when a task (hereinafter referred to as the self-task) issues a resource acquisition request, the queue is always checked in order of the number of unused resources connected to the beginning, and the self-task is If there is a task that has already acquired the resources it needs, the task (
The result is subtracted from the number of acquired resources of the acquired task (hereinafter referred to as the acquired task) and the number of unacquired resources of the own task, and added to the number of unacquired resources of the acquired task and the number of acquired resources of the own task. This is repeated until the priority of the task on the queue becomes the same as the priority of the self-task, and by connecting the recording part of the number of acquired resources and the number of unacquired resources of the self-task to that location in the queue, it is possible to always Tasks with high priority can acquire resources preferentially.

EXAMPLE Hereinafter, an example of the present invention will be described with reference to FIGS. 1 and 2.

FIG. 1 is a block diagram showing the structure of a queue according to the present invention, and FIG. 2 is a flowchart showing a processing procedure when acquiring resources. In FIG. 1, reference numeral 11 indicates the configuration of a portion that stores the number of acquired resources and the number of unacquired resources, and 12 indicates the connection of queues. The operation of the configuration shown in FIG. 1 and the processing procedure shown in FIG. 2 as described above will be explained below. first,
The search starts from the unobtained resource portion 13 at the beginning of the kine. Key - Compares the priority of the task on the queue with the priority of the own task, and if the priority of the task on the queue is the same as or higher than the own task, the own task is moved before that task. Connect and finish acquiring resources. If the priority of the self-task is higher and the task on the queue has the resource that the self-task wants to acquire, the resource is acquired from the task on the key. Therefore, when all the resources that the own task wants to acquire have been acquired, the resource acquisition ends. Then, if there are resources that have not yet been acquired, the process of searching for the task one step ahead of the key is repeated.

Furthermore, if there are resources that have not been acquired even after searching to the end of the queue, the resources are managed by connecting the memory portion of the own task to the end of the queue.

Effects of the Invention As described above, the effect of the present invention is that by managing resources by connecting the storage part to a queue in which each task is arranged in order of priority, tasks with high priority are always You can acquire resources with priority.

[Brief explanation of drawings]

FIG. 1 is a block diagram showing the configuration of a queue in an embodiment of the present invention, and FIG. 2 is a flowchart showing a processing procedure when acquiring resources using the method of the present invention. 11... Number of acquired resources, 12... Key connection, 13
...Number of unobtained items.

Claims (1)

[Claims] A task that has multiple resources and uses multiple types of resources at the same time, and each task has a part that stores the number of resources that it has already acquired and the number of resources that it has not acquired. A resource management method characterized by managing resources by connecting them to a queue in which each task is arranged in order of priority.