JPS63129428A - Lock management control system - Google Patents

Abstract

PURPOSE:To perform the processing of lock management at high speed, by distributing and allotting the lock management of plural common resources to plural managing processes, and deciding the managing process with takes in charge of the resource based on a value obtained by a hash function from the identification name of the resource. CONSTITUTION:The process 1 that is a lock request origin finds a function value by a prescribed hash function evaluating part 3 from the identification name 2 of a required resource 6 at the time of requesting lock. The process indexes the hash table 4 of a system based on the function value, and obtains the identifier of a required managing process 5, and calls the managing process 5 by the identifier, and requests the lock management by the identification name 2. The managing process 5 processes the lock management of a designated resource as usual by the identification name of the resource designated by the request. In such way, it is possible to distribute the resource 6 to the plural managing processes 5 and allot management, and to call a required managing process classified by every resource after identifying the managing process easily, and to improve processing efficiency.

Description

[Detailed Description of the Invention] [Summary] This is an improved control method for lock management for exclusive control of resources shared by multiple processes in a computer.

Lock management of a plurality of shared resources is distributed among a plurality of management processes, and the management process that owns the resource is determined based on a value obtained from the resource's identification name using a hash function.

This method makes it easy to configure a system that speeds up lock management processing by sharing lock management among multiple management processes.

[Industrial application field]

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

[Conventional technology]

In a computer where multiple processes can coexist, if there are computer resources (hereinafter simply referred to as resources) shared by those processes, for example, in the case of a resource such as a predetermined data unit of a database, publicly known Thus, while one process is using that resource, so-called exclusive control is required to prohibit other processes from using that resource.

As is well known, locks are widely used as a means of exclusive control. In this case, a process that uses a resource that requires exclusive control indicates the resource's identification name to the management process and locks it before using it. request.

For example, the management process connects the requesting process to a well-known so-called queuing port established for each resource with a specified identification name, and when it becomes the head of the queue for that boat, only that process can use the resource. control to allow.

[Problem that the invention seeks to solve]

Conventionally, management processes that perform this kind of control have controlled so that only one management process is executing processing at the same time, taking into account contention for control over 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 to this problem, it is conceivable to define one management process that performs lock management for each resource, and distribute the resources in charge to a plurality of management processes.

By doing so, in an environment of a computer having multiple processors, it becomes possible to process lock requests for different resources in parallel by those management processes, and a reduction in processing waiting time can be expected.

However, in that case, it is necessary to identify the correspondence between multiple management processes and shared resources in the lock request and issue a request to the required management process, but no efficient control method has been provided to date. .

[Means for solving problems]

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

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

[For production]

When making a lock request, the lock requesting process 1 uses a predetermined hash function evaluation unit 3 to obtain a function value from the identification name 2 of the required resource 6.

Using the function value, the hash table 4 of the system is indexed to obtain the necessary identifier of the management process 5, the management process 5 is called using the identifier, and lock processing is requested using the identifier 2.

The management process 5 handles lock management for the specified resource in the usual manner, depending on the resource identification name specified in the request.

With this method, the resources 6 can be distributed to multiple management processes 5 to share management tasks, and the necessary management processes for each resource can be easily identified and called. Lock management can be processed in parallel, improving processing efficiency.

〔Example〕

In the figure, process 1 corresponds to various processing tasks.
Generally, they are processes with different content, but with the same mechanism for lock requests as shown.

On the other hand, the management process 5 is a process with the same contents that has a normal control function for well-known lock management. By creating a corresponding hash table 4, each management process 5 will automatically share different resources 6.

When making a lock request, the lock requesting process 1 uses a predetermined hash function evaluation unit 3 to obtain a function value from the identification name 2 of the required resource 6.

Since resource identification names are usually composed of relatively long character strings, the hash function evaluation unit uses the following function as a hash function to convert it into a relatively short bit string value as unbiased as possible. 3.

In other words, for example, a 12-byte identifier is divided into 4 3-byte identifiers.
Divide into groups, invert the bit order for 2 groups, and then calculate the exclusive OR of the bit strings of 4 groups.
Obtain a 4-focus bit string.

Using this focus sequence as a divisible 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.

If, for example, an 8-bit function value output is obtained as in the above example, the hash table 4 is
A table consisting of 256 entries is provided, and the identifier of the management process 5 is displayed in each entry.

In this example, a maximum of 256 management processes can be provided, and if there are fewer than that, the identifier of one management process is displayed in two or more columns.

Each lock requesting process 1 obtains the necessary identifier of the management process 5 by indexing the hash table 4 of the system using the function value obtained above, calls the management process 5 using the identifier, and allocates the resource using the identifier 2. Specify,
Request the lock processing.

With this method, the resources 6 can be distributed to a plurality of management processes 5 to share management duties, and the necessary management processes can be easily identified and called for each resource.

In addition, when changing the number of management processes 5 or the distribution of resources to the management processes 5 depending on the operation results, either or both of the contents of the hash table 4 and the function of the hash function evaluation unit 3 are changed. This can be handled by changing the management process 5, and there is no need to change the management process 5.

〔Effect of the invention〕

As is clear from the above description, according to the present invention, regarding lock management processing regarding shared resources in a computer,
This method is easy to implement, provides highly flexible speedup, and has a remarkable industrial effect of improving computer processing efficiency.

[Brief explanation of the drawing]

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

Claims (1)

[Scope of Claims] In lock management for exclusive control of the use of a plurality of computer resources (6) shared by a plurality of processes (1) executed on a computer by the processes (1), the computer resources include: A plurality of management processes (5) are provided to share the lock management of (6) without duplication, and the identification name (2) of each computer resource (5) is evaluated using a predetermined hash function (3), and based on the result, A lock management control method, characterized in that it is configured to (4) determine the management process that shares the computer resources.