JPH0328956A - Exclusive control method for resources - Google Patents

Abstract

PURPOSE:To attain the exclusive control of the system resources with no saturation of the overall processing ability of a decentralized system despite the increase of the system scale by enabling each computer to autonomously give the exclusive control to the resources of the system. CONSTITUTION:A computer 22 obtains the exclusive control information and decides whether the resources of computers 23 - 25 are kept under the exclusive process or not by reference to a resources state column 33. If not, the computer 22 puts its own identifier into an exclusive request column 32. If the identifier of another computer already exists in the column 32, the priority of the computer 22 is compared with that of the relevant computer. Then the column 32 is not updated if the priority of the computer 22 is lower than that of said computer and then updated vice versa. Thus the exclusive control of resources of a decentralized system is not concentrically controlled by a specific computer and all computers of the system can process the control in dispersion. As a result, the exclusive control is attained for the system resources with no saturation of the overall system processing ability caused by the processing ability of a single specific computer despite the increase of the system scale.

Description

DETAILED DESCRIPTION OF THE INVENTION Field of Industrial Application The present invention relates to a method for exclusive control of resources on a plurality of computers used in a distributed processing environment of electronic computers.

2. Description of the Related Art Conventionally, there has been a method for exclusive control of resources as a distributed processing method for electronic computers. For example, the configuration shown in FIG. 3 is known as one example. The configuration will be briefly explained below. FIG. 3 shows the computer environment in the distributed system. 1 is a computer with a lock manager which manages the lock status of resources on the distributed system. 2 is a computer with a user who is about to lock resources on the distributed system, and 3 to 5 are computers with resources that are about to be locked by Pa2. These 1 to 51
The computers at are connected to each other by six communication paths.

Next, the operation of the above conventional example will be explained. 1zu calculator 2
Assume that the user is trying to lock computers 3 to 5 in order to exclusively operate resources on computers 3 to 5. To do this, first ask computer 1 about the possibility of a Ronk from computer 3 to computer 5. This inquiry is exclusively controlled within the computer 1. If the answer to this inquiry is lockable, computer 2 locks computers 3 to 5 and operates the resources of computers 3 to 5 in a locked state. After the operation is completed, computer 2 unlocks computers 3 to 5, and locks computers 3b and 5.
Notify computer l that the locked state of computer l has been released. If the answer to the query to computer 1 is that it cannot be locked, the request is canceled or scheduled by computer 1 or computer 1.

In this way, even with the conventional method described above, exclusive control on a distributed system is possible by reducing the management of resources on the distributed system to exclusive control on one computer.

Problems to be Solved by the Invention However, in conventional exclusive control methods, the resource management of the entire distributed system is concentrated on one specific computer, so the overall processing capacity is determined by the processing capacity of the computer that performs this exclusive control. I want to put it away 5! ! There was a problem. One problem with conventional methods is that even if the scale of a distributed system increases, its processing capacity does not increase in proportion to the increase in scale, but becomes saturated at a certain point. The present invention is intended to solve such problems, and even if the scale of a distributed system increases, the processing power of the entire system will not become saturated with the processing power of a specific computer, and the system will not be affected. The purpose of this invention is to provide a method that allows exclusive control of resources.

Means for Solving the Problem In order to achieve the above objective, each computer sends a list of available resources that it owns to the communication path on the distributed system, and the computer that wants exclusive resources selects from the list of resources on the communication path. This is to ensure that the necessary resources are secured. This means that the management information held by computers that exercise exclusive control over the entire distributed system in the conventional example is sent over the communication path, and instead of being processed only by a specific computer, each computer on the distributed system processes it equally. It is designed to be processed.

Effects of the present invention: Each computer sends a list of available resources that it owns to a communication path on a distributed system, and a computer that wants exclusive resources secures the necessary resource from the list of resources on the communication path. Since there is no need for a specific computer to manage exclusive control information for the entire system, the processing capacity of the distributed system does not become saturated even if the overall scale of the distributed system increases.

Embodiment An embodiment of the present invention will be described below with reference to FIGS. 1 and 2.

FIG. 1 is a block diagram showing the resource exclusive control method of the present invention. In Figure 1, 21 and 21 are computers that each have their own resources, and are autonomous enough to request exclusive resources from others, provide exclusive resources requested by others, and manage exclusive control of the entire system. It is a typical computer section. A is the communication channel that connects these computers. FIG. 2 shows the format of exclusive control information flowing on the communication path. 31 is the resource name column, 3
2 is an exclusive request column, and 0 is a column indicating the resource status. Only one button of the exclusive control information shown in FIG. 2 is always circulated on that communication path, and each computer on the distributed system can refer to and change the information only when it receives the information.

The configuration and operation will be explained below. Suppose that Computer Ushio is trying to lock computer number 5 from Phantom in order to exclusively operate the resources on computer number 3 from number 2. To do this, the computer first waits for the exclusive control information shown in FIG. 2 to reach it. Next, the computer that has obtained the exclusive control information determines whether or not the resources on the Okara 5 computer are undergoing exclusive processing by looking at the resource status column. If the exclusion process is not in progress, place your own identifier in the exclusion request 32 column. At this time, if the identifier of another computer already exists, the priority of the computer is compared with that of that computer, and if the priority of the computer is weak, the exclusion request 32 column is not updated. If the priority is higher, the exclusive request 32 column is updated. Thereafter, the exclusive control information is retransmitted to the communication path and waits for the exclusive control information to be transmitted once on the distributed system. Next, when the exclusive control information is received, if the own exclusive request has not been updated by another computer, the resource state is set to exclusive control and sent out onto that communication path. Through the above steps, computer 22Fi gains exclusive control over the resources on the computer. Computer n locks and operates Okara B's computer resources. After the operation is completed, the computer Nana releases the lock of the computer from B to R, and sends an exclusive control information exclusive request 32 on the communication path in order to notify other computers that the locked state of the computer from Phantom to No. 5 has been released.
And clear that column of resource status.

In this manner, according to the embodiment described above, exclusive control of resources on a distributed system can be processed in a distributed manner by all computers on the system without centrally managing one specific computer. For this reason, it has the advantage that even if the overall scale of the distributed system increases, its processing capacity does not become saturated.

Effects of the Invention As described above, the effect of the present invention is that even if the scale of the distributed system increases, the processing power of the entire system will not become saturated with the processing power of a specific computer, and the system resources can be reduced. Exclusive control can be performed.

[Brief explanation of drawings]

FIG. 1 is a structural diagram showing the configuration of a resource exclusive control method that is an embodiment of the present invention, FIG. 2 is an information diagram showing exclusive control information flowing on the communication path of FIG. 1, and FIG. 3 is a conventional 1 is a configuration diagram showing a computer environment that can be used in a distributed system. 21-25...Computer, 26...Communication channel.

Claims (1)

[Claims] 1. A method for exclusive control of resources, characterized in that each computer on the distributed system autonomously performs exclusive control, thereby allowing exclusive control of resources on the distributed system.