JPS60103457A - Resource control system for computer system - Google Patents

Abstract

PURPOSE:To reduce the overhead phenomena by controlling the logical resources used by a computer system with numbers, and referring to an index. CONSTITUTION:A resource security request is fed from a program by means of the resource number alloted to each resources. Then a resource control program 4 obtains a resource control area from the resource number and with reference to an index and then decides whether the control area of the corresponding resource number is idle or not from a security PID of resources K(=1-n). When said control area is idle, the resources K is alloted to the control area. While a resource packet related to the program 4 is allocated to the control area while another program is securing the resources K. Then the queue links which link the corresponding resource packet to the resorces K with another resource packet so far secured in the order of the priority are rearranged, and the program 4 is put under a queuing mode.

Description

DETAILED DESCRIPTION OF THE INVENTION The present invention relates to a resource management method in a computer system.

Operating systems provided for real-time systems such as process control computer systems are
It is also desired that resource management for exclusive use of various logical resources such as memory areas, input/output devices, and common blue routines be performed quickly.

In an exclusive resource control mechanism provided by a general operating system, a system service program allocates resources requested by various programs (jobs, tasks) according to selected priorities. Since the logical resources are identified by symbols (codes) for this allocation, the overhead in the allocation processing time becomes large, and the processing time required for a real-time system may not be satisfied. ), competition among many programs occurred during exclusive control, resulting in large overhead and was not suitable for real-time.

An object of the present invention is to provide a resource management method that can reduce the overhead of resource management.

The present invention is characterized in that logical resources used in the system are managed by numbers and overhead is reduced by performing index reference.

FIG. 1 is an overall configuration diagram of the system of the present invention. By system bus 1, CPU2. Memory 3. Input/output equipment, −
In the computer system to which Dn is connected, among the management (monitor) program and processing program for constructing the operating system O8 secured in the memory 3, resource management is performed as a resource management mechanism called K, one of the service programs in the processing program. A program 4, a resource management area 5, and a resource packet 6 are prepared. Resource management area 5 and resource packet 6 are secured in dynamic memory.

The resource management program 4 requests logical resources (CPU, input/output devices, memory) from various programs.

The resource management area 5 and resource packet 6 are referred to for allocation and release.

The resource management area 5 has the data structure shown in FIG. As header data, the number of resources coupled to the computer system and the size of the resource management area (in the illustration, the management area with resource numbers 1 to n4) are set. In the management area, n areas with numbers 1 to nt corresponding to each resource are set, and each area is provided with a resource K (1 to n) securing program identification number (PID) and a queue header. For example, a printer is assigned as resource 1 to the resource number 1 management area, the program number currently securing the printer is written to the resource 1 reserved number PID, and when the program returns the printer to the system, the next printer is allocated. The header at the head of the resource request queue of the program group requesting use of the printer is written to the queue header.

The resource packet 6 has the data structure shown in FIG. The queue link configures the resource request queue of each resource packet, and the start address of the packet whose resource request order is next to the packet is written @Resource packet size is the size of the resource packet 6 (packet The resource requesting program recognition number corresponding to the packet is written to the resource waiting PID, the priority number of the resource requesting program group is written to the priority, and the synchronization number is written to the resource requesting program recognition number corresponding to the packet. Number data is written when synchronization control with the program is required.

Using these resource management areas 5 and resource packets 6, the resource management program 4 manages logical resources by number, and performs resource allocation with reduced overhead by performing index reference. This resource management program 4 is the fourth
The configuration shown in FIG. 5 and the flowchart in FIG. 5 is adopted.

In FIG. 4, when a resource reservation request from a program is made using the resource number assigned to each resource, the resource management program 4 locates the resource management area by index reference from the resource number (step 81), and Resource K (=1 to n) is secured PID to determine whether the management area is pierced or not.
If the resource K is free, the resource K is allocated (step S3), and if another program is securing the resource K, the resource packet (FIG. 3) for the resource requesting program is allocated (step s4). , rearrange the queue links that connect the resource packet in priority order with other resource packets that have been reserved for the resource K (step 85), and make the resource requesting program wait (step 86). .

Next, when the program that has secured the resource finishes using the resource and requests its release using the resource number, the four resource management programs use the resource management area (the resource management area ( The management area corresponding to the resource number in Figure 2) is made vacant (step 511), and it is determined from the queue header of the management area whether a request for the resource is pending or not (step 512), and if there is no resource, release is completed, and if there is Step 513) of extracting the first packet from the queue header among the programs waiting for the resource;
Allocate resource K to the program from the resource waiting PII written in the packet (step 514), enter the resource securing program recognition number in the area for the resource number in the resource management area, or A resource packet is deallocated to relocate the queue link (step 515), and the program registered in the t# management area is released from the queue (step 816).

In addition, when constructing a packet queue link, a resource queue is created with priorities including deadlock prevention.

As described above, according to the method of the present invention, logical resources are managed by number, and the overhead in accessing the resource is minimized by referring to the index in the resource management area in the order of the resource number, and the waiting time for the logical resource is minimized. Since resources are managed in a queue, the overhead when releasing resources is minimized, so the overhead of resource management can be reduced. Furthermore, all the data (resource management area, resource bucket) configuration can be stored in the dynamic memory, and the increase or decrease in the number of resources can be handled without changing the program, improving maintainability.

[Brief explanation of drawings]

FIG. 1 is an overall configuration diagram of the system of the present invention, FIG. 2 is a configuration diagram of the resource management area in FIG. 1, FIG. 3 is a configuration diagram of the resource packet in FIG. 1, and FIGS. 2 is a flowchart of the resource management program in FIG. 1; 2...Scream...CPU 3...Bright...Memory J)-,
Dn-, input/output equipment 4...Resource management program 5.
...Resource management area 6...Resource packet No. I Y
:', :: 6 '4. ．． ”,”,2g”,;(ir)3 !・≧[

Claims (1)

[Claims] (1) In a resource management method that exclusively allocates various logical resources of a computer system according to the requests of various programs, there is a group of management areas with numbers corresponding to each logical resource, and the current car pattern logical resources are secured in each management area. Program li! ! A resource management area that has the identification number and the header data of the resource request queue of the program group that requests the logical resource, and the queue link along with the header data for each program that requests resources for each resource number in this resource management area. A group of resource packets with data on queue links and program recognition numbers for constructing the ``Resource Packets'', logical resource requests and releases from various programs are requested by resource numbers, and the resource numbers are stored in the resource management area mentioned above by referring to the index. A resource management method in a computer system, comprising: a resource management program that manages resource reservation and resource release for the program based on the recognition of the resources in the corresponding area and the queue link with the resource packet.