JPH0769840B2 - Lock management controller - Google Patents

Description

DETAILED DESCRIPTION [Outline] This is a control device with improved lock management for exclusive control of resources shared by a plurality of processes in a computer.

The lock management of a plurality of shared resources is distributed and shared among a plurality of management processes, and the management process responsible for the resources is determined by a value obtained by a hash function from the identification name of the resource.

This device facilitates the configuration of a system in which lock management is shared by a plurality of management processes and the speed of lock management processing is increased.

[Industrial application field]

The present invention relates to a lock management control device for exclusive control of resources shared by a plurality of processes in a computer.

[Conventional technology]

In a computer in which a plurality of processes can coexist, if there is a computer resource (hereinafter simply referred to as a resource) shared by those processes, a known resource such as a predetermined data unit of a database is known. As described above, while one process is using the resource, so-called exclusive control is required to prohibit the use of the resource by another process.

As is well known, locks are widely used as a means of exclusive control. In that case, a process using a resource that requires exclusive control shows the identification name of the resource to the management process and requests a lock prior to use.

The management process connects a requesting process to a well-known so-called queue port, which is provided for each resource of a specified identification name, and when it becomes the head of the queue of that port, the resource is used only for that process. Control to allow.

[Problems to be solved by the invention]

Conventionally, a management process that performs such control controls the management process so that only one management process executes the process at substantially the same time in consideration of control competition for the same resource. When lock requests for various resources are concentrated, a decrease in system processing efficiency due to an increase in lock processing waiting time becomes a problem.

As a countermeasure, it is conceivable to set one management process for performing lock management for each resource and distribute the resource in charge to a plurality of management processes.

By doing so, in an environment of a computer having a plurality of processors, lock requests for different resources can be processed in parallel by their management processes, and a reduction in processing waiting time can be expected.

However, in that case, it is necessary to identify the correspondence between a plurality of management processes and the shared resources in the lock request and issue the request to the required management process, but conventionally, an efficient control method for that purpose has not been provided. .

[Means for solving problems]

 The figure is a block diagram showing the configuration of the present invention.

In the figure, 1 is a process of a lock request source, 3 is a hash function evaluation unit that outputs a predetermined hash function value from the identification name 2 of the resource 6, and 4 is a hash that indexes by the hash function value and gives a management process identifier. Table 5 is a management process called by the identifier.

[Action]

At the time of the lock request, the process 1 of the lock request source obtains the function value from the identification name 2 of the required resource 6 by the predetermined hash function evaluation unit 3.

Based on the function value, the hash table 4 of the system is indexed to obtain the required identifier of the management process 5, the management process 5 is called by the identifier, and the lock process is requested by the identification name 2.

The management process 5 handles the lock management of the designated resource as usual by the identifier of the resource designated by the request.

According to this method, the resources 6 are allocated to a plurality of management processes 5 so as to share the management, and the management resources are allocated so as not to share the same computer resources among the management processes. It is possible to efficiently perform parallel processing by multiple management processes in an environment in which multiple processors can perform parallel processing without having to consider inconvenient interference that may occur when performing lock management processing on the same computer resources at the same time. Also, since each process that requests lock management can easily identify and call a necessary management process for each resource, the processing efficiency of lock management can be improved.

〔Example〕

In the figure, process 1 corresponds to various processing tasks,
Generally, the processes have different contents, but have the same mechanism for the lock request as shown.

On the other hand, the management process 5 may be a process of the same content having a normal control function for publicly known lock management, and is distributed so as to handle only a specific group of resources 6 as shown in operation, and accordingly If the hash table 4 is created, each management process 5 automatically shares different resources 6.

At the time of the lock request, the process 1 of the lock request source obtains the function value from the identification name 2 of the required resource 6 by the predetermined hash function evaluation unit 3.

Since the identifier of a resource is usually composed of a relatively long character string, the hash function evaluation unit is used to convert it to a relatively short bit string value as evenly as possible by using the following function as a hash function. Make up 3.

That is, for example, a 12-byte identification name is divided into 4 groups of 3 bytes each, the bit groups of the 2 groups are inverted, and the exclusive OR of the 4 groups of bit strings is obtained to obtain a 24-bit bit string.

This bit string is used as a dividend integer, division is performed by an appropriate integer, and the remainder is output from the hash function evaluation unit 3 as a function evaluation result.

When the 8-bit function value output is obtained as in the above example, the hash table 4 is
A table consisting of 256 items is provided, and each item has a management process 5
Display the identifier of.

In the case of this example, a maximum of 256 management processes can be provided. If the number is smaller than that, one management process identifier is displayed in two or more terms.

Each lock requesting process 1 indexes the hash table 4 of the system by the function value obtained as described above to obtain the required management process 5 identifier, calls the management process 5 by the identifier 2 and allocates the resource by the identification name 2. Specify and request the lock processing.

With this method, it is possible to distribute the resources 6 to a plurality of management processes 5 and share the management, and easily identify and call the necessary management process for each resource.

Further, when changing the number of management processes 5 or distribution of shared resources to the management processes 5 according to the operation result, etc., either one or both of the contents of the hash table 4 and the function of the hash function evaluation unit 3 should be set. It can be changed and dealt with, and it is not necessary to change the management process 5.

[Effects of the Invention] As is clear from the above description, according to the present invention, the lock management process related to the shared resource in the computer,
It has a remarkable industrial effect that it is easy to realize, highly flexible, and has a high speed, and that it improves the processing efficiency of the computer.

[Brief description of drawings]

The figure is a block diagram showing the configuration of the present invention. In the figure, 1 is a process, 2 is an identifier, 3 is a hash function evaluation unit,
Reference numeral 4 is a hash table, 5 is a management process, and 6 is a resource.

Claims (1)

[Claims] 1. A plurality of processes executed by a computer (1)
In the lock management for exclusive control of use of the plurality of computer resources (6) shared by the process (1), the plurality of computer resources (6) share the lock management of the computer resources (6) without duplication. A management process (5) and a hash table (4) consisting of terms holding an identifier for instructing the management process are provided, and an input value is evaluated by a predetermined hash function for each process (1), and a result is obtained. A hash function evaluation unit (3) for outputting the evaluation value of is provided, and each process (1) requesting lock management assigns the identification name (2) of the required computer resource (5) to the hash function evaluation unit (3). 3) to obtain the evaluation value, index the item in the hash table (4) by the evaluation value, and issue a request to the management process determined by the identifier of the index result. Iruko Lock management control apparatus according to claim.