JP2002007148A - Exclusive control system for shared resource and resource lock method and recording medium - Google Patents

Abstract

PROBLEM TO BE SOLVED: To solve the problem that when plural programs are simultaneously executed, dead lock that the execution of those programs is stopped occurs since a waiting state for the release of the lock of mutually locked shared resources is continued unless the program design is performed under the consideration of the order of the lock of the shared resources. SOLUTION: This system is provided with plural shared resources, an exclusive control managing table in which the priority order of exclusive control set for those respective shared resources is stored, a program executing means for independently executing the plural programs using the plural shared resources, and a program controlling means for exclusively locking the corresponding shared resources successively in the priority order stored in the exclusive control managing table when the program executing means independently executes the plural programs using the plural shared resources.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a computer system which independently executes a plurality of programs using a plurality of shared resources, and more particularly to an exclusive control for storing the priority of the exclusive control set for each of the plurality of shared resources. Exclusive control of shared resources that can prevent a plurality of independently executed programs from occupying each other and falling into a deadlock state by exclusively locking the corresponding shared resources sequentially according to the management table The present invention relates to a system, a resource locking method, and a recording medium.

[0002]

2. Description of the Related Art With the recent development of hardware / software technology, computer systems for realizing calculation models for independently executing a plurality of programs have appeared, and their importance has been increasing in the future.

FIG. 11 is a diagram conceptually showing a configuration of a conventional computer system capable of independently executing a plurality of programs as described above. In the figure,
Reference numerals 1 and 2 denote files which are shared resources in which data is written and read when the arithmetic and control unit 10A in the computer system 30A executes the programs 100 and 200. Further, when the arithmetic and control unit 10A independently executes the programs 100 and 200, the files are locked so as not to write and read data to and from the files 1 and 2 at the same time. 10A is an arithmetic and control unit in the computer system 30A, which is composed of a CPU, a high-speed main storage device, etc., stores programs 100 and 200 in the main storage device (not shown),
It performs arithmetic processing by reading and decoding the instructions constituting 0 and 200 as appropriate, and also performs control processing such as reading and writing of data required for the arithmetic processing and data of processing results by accessing the files 1 and 2. 20A is file 1, 2
Hard disk as an auxiliary storage device for storing
Is a computer system including the above configuration, which has a configuration other than the above that a normal computer system has. 100 and 200 are programs stored in the main storage device (not shown) of the arithmetic and control unit 10A, which are sequentially read, decoded, and executed according to an instruction sequence constituting the programs 100 and 200.

Next, the operation will be described. Since the present invention relates to exclusive control of shared resources in a computer system, the exclusive control operation of shared resources will be described here. FIG. 12 is a flowchart showing a processing operation using a shared resource in the computer system of FIG. First, the execution flow of the program 100 will be described. The arithmetic and control unit 10A reads an instruction constituting the program 100 from a main storage device (not shown) and starts executing the program 100 (step ST11-).
1). The predetermined process of the program 100 is executed by the arithmetic and control unit 10A (step ST11-2). Here, it is assumed that, for example, a process of writing data generated as a processing result to the files 1 and 2 is performed.

[0005] In order to write the data generated in step ST11-2 to the file 1, the arithmetic and control unit 10
A locks file 1 exclusively (step ST1)
1-3). As a result, the process by the program 100 can perform processing using the file 1, and other processes cannot use the file 1 until the process by the program 100 releases the lock on the file 1. That is, if a process that attempts to use file 1 occurs during this time, the program 100
Is in a waiting state until the process of the file 1 releases the lock of the file 1.

When the locking of file 1 is completed, arithmetic and control unit 10A writes a part of the data generated in step ST11-2 (step ST11-4). This data is written to file 1 in hard disk 20A via a data bus (not shown) or the like. Next, the arithmetic and control unit 10A exclusively locks the file 2 (step ST11-5), and writes the rest of the data generated in step ST11-2 (step ST11-).
6). This write operation is the same as that in step ST11-4. When the above write operation is completed, the arithmetic and control unit 10A terminates the execution of the program 100 and releases the lock on the files 1 and 2 (step ST11-7).

As described above, if the program accesses the file 2 after the file 1 in the same manner as the program 100, the program 100
If the two programs are executed at the same time, one of them can exclusively lock files 1 and 2 and then access them. it can.

Next, the execution flow of the program 200 will be described. Arithmetic controller 10A reads an instruction constituting program 200 from a main storage device (not shown) and starts execution of program 200 (step ST11-1).
a). The predetermined process of the program 200 is executed by the arithmetic and control unit 10A (step ST11-2a).
Here, as in the case of the program 100, a process of writing data generated as a processing result to the files 1 and 2 is performed.

[0009] The arithmetic and control unit 10A exclusively locks the file 2 (step ST11-3a).
A part of the data generated in 11-2a is written (step ST11-4a). Next, the arithmetic and control unit 10
A locks file 1 exclusively (step ST11-
5a), and write the rest of the data generated in step ST11-2a (step ST11-6a). When the above write operation is completed, the arithmetic and control unit 10A terminates the execution of the program 200 and releases the lock on the files 1 and 2 (step ST11-).
7a).

As described above, if the program accesses the file 1 after the file 2 like the program 200, the program 200
If the two programs are executed at the same time, one of them can exclusively lock files 1 and 2 and then access them. it can.

As described above, the conventional computer system locks the shared resources exclusively when independently executing a plurality of programs using the shared resources, such as the files 1 and 2, thereby providing a plurality of programs. Function as a shared resource exclusive control system that can perform processing exclusively without conflict.

[0012]

Since the conventional shared resource exclusive control system is configured as described above, unless a program is designed while taking into account the order in which the shared resources are locked, a plurality of programs can be simultaneously executed. When executed, there is a problem that a deadlock occurs in which the execution of the program is stopped while waiting for the unlocking of the mutually locked shared resources.

To describe the above problem in detail, for example, considering that the arithmetic and control unit 10A starts executing the programs 100 and 200 at the same time, when the program 100 is executed, the program 200 executes step ST11-3.
a, the file 2 is locked until the lock on the file 2 is released.
Since the file 2 cannot be locked in 11-5, the execution of the program 100 is put into a wait state (step ST11-8). On the other hand, when the program 200 is executed, the program 100 locks the file 1 in step ST11-3, and the program 100 locks the file 1 until the lock on the file 1 is released in step ST11-5.
a, the file 1 cannot be locked, and the execution of the program 200 waits (step ST1).
1-9).

As described above, the programs 100 and 200 wait for the unlocking of the files 1 and 2 locked to each other, and the execution of the programs 100 and 200 is stopped (deadlock). In order to avoid this deadlock, it is necessary for a program designer to perform design in consideration of the order of file locking by the programs 100 and 200 and to ensure consistency of the order of file locking (for example, the Changes the order in which file 2 is locked after file 1).

However, the number of programs and files used in the actual computer system is enormous, and the order of file use in the program depends on the processing purpose of the program. Was very complicated.

The present invention has been made to solve the above-described problems, and sequentially excludes corresponding shared resources according to an exclusive control management table that stores the priority of exclusive control set for each of a plurality of shared resources. It is an object of the present invention to obtain a shared resource exclusive control system that can prevent a plurality of independently executed programs from occupying the shared resource and causing a deadlock state by locking the shared resources.

Further, the present invention is independently executed by exclusively locking the corresponding shared resources sequentially according to the exclusive control management table storing the priority of the exclusive control set for each of the plurality of shared resources. It is an object of the present invention to provide a resource locking method capable of preventing a plurality of programs from occupying a shared resource and causing a deadlock state.

Further, the present invention is independently executed by sequentially locking the corresponding shared resources exclusively in accordance with the exclusive control management table storing the priority of the exclusive control set for each of the plurality of shared resources. An object of the present invention is to provide a computer-readable recording medium storing an exclusive control program for a shared resource that can prevent a plurality of programs from occupying the shared resource and causing a deadlock state.

[0019]

An exclusive control system for a shared resource according to the present invention comprises: an exclusive control management table for storing a plurality of shared resources; and an exclusive control priority set for each of the plurality of shared resources. A program execution means for independently executing a plurality of programs using a plurality of shared resources, and a program execution means for executing a plurality of programs using a plurality of shared resources independently of each other. Program control means for exclusively locking the corresponding shared resources in sequence according to the priority.

In the exclusive resource control system for shared resources according to the present invention, the program executing means changes and / or adds program logic to execute a plurality of programs including programs whose order of using the shared resources has been changed. It is what the means do.

[0021] In the shared resource exclusive control system according to the present invention, when the shared resource is changed in the exclusive control management table, the changed shared resource is set to the priority before the change.

In the shared resource exclusive control system according to the present invention, when a shared resource is newly added, a priority order corresponding to the added shared resource is set in the exclusive control management table.

According to the resource locking method of the present invention, there are provided an exclusive control management table for storing a plurality of shared resources, an exclusive control priority set for each of the plurality of shared resources, and a plurality of programs using the plurality of shared resources. A shared resource exclusion control system comprising a program execution means for independently executing a plurality of programs, each of which independently executes a plurality of programs using a plurality of shared resources. The exclusive resources are sequentially locked in accordance with the priority stored in the shared resources.

[0024] A computer-readable recording medium storing an exclusive control program for shared resources according to the present invention is an exclusive control management system for storing a plurality of shared resources and a priority order of exclusive control set for each of the plurality of shared resources. When executing a plurality of programs using a plurality of shared resources independently of each other, the corresponding shared resources are exclusively locked sequentially according to the priority stored in the exclusive control management table.

[0025]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS One embodiment of the present invention will be described below. Embodiment 1 FIG. FIG. 1 is a diagram schematically showing a configuration of an exclusive control system for shared resources according to Embodiment 1 of the present invention. In the figure, reference numerals 1 and 2 denote computer systems 3 constituting an exclusive control system for shared resources according to the first embodiment.
0 is a file (shared resource) that is a shared resource in which data is written and read when the arithmetic and control unit 10 in 0 executes the programs 100 and 200. Further, when the arithmetic and control unit 10 executes the programs 100 and 200 independently, the files are locked so as not to write and read data to and from the files 1 and 2 at the same time. 3
Is a file lock management table (exclusive control management table) storing the exclusive lock priority set for each of the files 1 and 2 when the programs 100 and 200 are executed. Is stored in the main storage device. The priority stored in the file lock management table 3 is determined by the arithmetic and control unit 10.
Are sequentially read out and decoded according to the instruction sequence of the program executed by the CPU, and are used for exclusive control described later.

Reference numeral 10 denotes an arithmetic and control unit in the computer system 30 (program execution means, program control means)
The program 100, 20 comprises a CPU, a main storage device operating at a high speed, and the like.
0, and read and decode instructions constituting the programs 100 and 200 as appropriate to perform arithmetic processing, or access the files 1 and 2 to read and write data required for arithmetic processing and data of processing results. Control processing is also performed. Reference numeral 20 denotes a hard disk which is an auxiliary storage device for storing the files 1 and 2, and 30 denotes a computer system which constitutes an exclusive control system for shared resources including the above-mentioned configuration, which has a configuration other than the above which a general computer system has. And 100 and 200 are arithmetic and control units 1
The program stored in the main storage device (not shown) is sequentially read, decoded, and executed in accordance with an instruction sequence constituting the programs 100 and 200.

Next, the operation will be described. Since the present invention relates to exclusive control of shared resources in a computer system, the exclusive control operation of shared resources will be described here. FIG. 2 is a flowchart showing a processing operation using a shared resource in the shared resource exclusive control system of FIG. First, when the program 100 is executed, the arithmetic and control unit 10 stores the program 1 in a main storage device (not shown).
The instructions that make up 00 are read, and the execution of the program 100 is started (step ST2-1). In the example shown in the figure, the priority stored in the file lock management table 3 is sequentially read and decoded at the beginning of the instruction sequence constituting the program 100, and the file 1 in which the priority 1 is set is determined according to the priority. Lock exclusively,
Next, the file 2 to which the priority order 2 is set is exclusively locked (step ST2-2). As a result, the process by the program 100 can perform processing using the files 1 and 2, and other processes can use the files 1 and 2 until the process by the program 100 releases the lock on the files 1 and 2. Can not. That is, if a process that attempts to use the file 1 occurs during this time, the program 100 waits until the process by the program 100 releases the lock on the files 1 and 2.

The program 10 is executed by the arithmetic and control unit 10.
0 is performed (step ST2-3), a part of the data generated by this processing is written to file 1 (step ST2-4), and the remaining data is further written to file 2 (step ST2-5). ). The writing of these data is performed by the arithmetic and control unit 10 and the hard disk 20.
This is performed via a data bus (not shown) that connects When the data write operation on the files 1 and 2 is completed, the arithmetic and control unit 10 terminates the execution of the program 100 and releases the lock on the files 1 and 2 (step ST2-6).

Here, it is assumed that the program 200 is executed before the program 100 ends. First, the arithmetic and control unit 10 reads an instruction constituting the program 200 from a main storage device (not shown),
0 is started (step ST2-1a). next,
At the beginning of the instruction sequence constituting the program 200, the priorities stored in the file lock management table 3 are sequentially read and decoded, and the files 1 and 2 are exclusively locked according to the priorities. At this point, the program 100 is running, and the file 1,
2 is exclusively locked to the process by the program 100, the program 100 ends and enters a wait state until the lock on the files 1 and 2 is released (step ST2-7).

When the program 100 ends, the file 1,
2 is released (step ST2-6).
In accordance with the priority stored in the file lock management table 3, the file 1 with priority 1 is exclusively locked, and the file 2 with priority 2 is locked exclusively (step ST2-2a). As a result, a process using the program 200 can perform processing using the files 1 and 2, and other processes can execute processes using the files 1 and 2.
Files 1 and 2 cannot be used until lock 2 is released. That is, if a process that attempts to use file 1 occurs during this time, the program 200
Is in a wait state until the process releases the lock on the files 1 and 2.

Next, a predetermined process of the program 200 is executed by the arithmetic and control unit 10 (step ST2-).
3a). Here, as in the case of the program 100, a process of writing data generated as a processing result to the files 1 and 2 is performed.

A part of the data generated in step ST2-3a is written in file 2 (step ST2-4).
a) Then, the remaining data is written to file 1 (step ST2-5a). The writing of these data is performed via a data bus (not shown) connecting the arithmetic and control unit 10 and the hard disk 20. File 1,2
Is completed, the arithmetic and control unit 10 terminates the execution of the program 200 and releases the lock on the files 1 and 2 (step S).
T2-6a).

As described above, although the program 200 writes data to the file 2 and then writes data to the file 1, the program 200 and the program 100 are written according to the priority stored in the file lock management table 3. Since the files 1 and 2 are exclusively locked in the same order, no matter what timing the programs 100 and 200 are executed, the mutual program 10
0, 200 does not fall into a deadlock state in which files 0, 200 compete with files 1, 2.

Further, the program designer need only design the file to be exclusively locked in accordance with the priority order stored in the file lock management table 3, and can omit the work of ensuring consistency of the file lock. ,
Since program design can be performed easily and quickly, the productivity of software can be improved.

As described above, according to the first embodiment, the files 1 and 2, the file lock management table 3 for storing the priorities of the exclusive control set for each of the files 1 and 2, Program 1 using 2
00 and 200 are executed independently, and the program 10 is executed.
In executing 0, 200, the arithmetic and control unit 10 that exclusively locks the corresponding files 1 and 2 sequentially according to the priority stored in the file lock management table 3 is provided. Even if it is executed, the arithmetic and control unit 10 can prevent the mutual programs 100 and 200 from causing a deadlock condition in which the files 100 and 200 compete with each other. In addition, it is possible to easily and quickly design a program, thereby improving the productivity of software.

In the first embodiment, the program 1
At the beginning of the instruction sequence of 00 and 200, an example has been shown in which the files 1 and 2 are exclusively locked according to the priority stored in the file lock management table 3.
The timing for exclusively locking the files 1 and 2 may be changed so that the time during which the other program waits is reduced.

Embodiment 2 In the second embodiment, the program execution means executes a plurality of programs including programs in which the order of using shared resources is changed by changing and / or adding program logic.

FIG. 3 is a diagram schematically showing a configuration of an exclusive control system for shared resources according to the second embodiment of the present invention. In the figure, reference numeral 100a denotes a program stored in the main storage device (not shown) of the arithmetic and control unit 10, which changes the program logic of the program 100 to a file 1,
The order of using 2 has been changed. Also, similarly to the program 100, it is sequentially read, decoded, and executed according to an instruction sequence constituting the program 100a. The same components as those in FIG. 1 are denoted by the same reference numerals, and duplicate description will be omitted.

Next, the operation will be described. Since the present invention relates to exclusive control of shared resources in a computer system, the exclusive control operation of shared resources will be described here. FIG. 4 is a flowchart showing a processing operation using a shared resource in the shared resource exclusive control system of FIG. The processing operation of the program 100 is the same as in the first embodiment. Here, the case where the program logic of the program 100 is changed and the program 100a is executed will be described. First, the arithmetic and control unit 1
0 reads an instruction constituting the program 100a from a main storage device (not shown) and starts execution of the program 100a (step ST4-1).

Next, at the beginning of the instruction sequence constituting the program 100a, the priorities stored in the file lock management table 3 are sequentially read and decoded, and the files 1 and 2 are exclusively locked according to the priorities. (Step ST4-2). In the instruction sequence of the program 100, data is written to the file 2 after writing the data to the file 1. However, in the instruction sequence of the program 100a in which the program logic is changed, the data of the file 1 is written after the data is written to the file 2.
The order in which data is written to has been changed. However, the program 100a also exclusively locks the files 1 and 2 in accordance with the priority order stored in the file lock management table 3, so that there are programs other than the program 100a that attempt to exclusively lock the files 1 and 2. No deadlock.

Next, predetermined processing of the program 100a is executed by the arithmetic and control unit 10 (step ST4).
-3). Part of the data generated in step ST4-3 is written to file 2 (step ST4-4), and the remaining data is written to file 1 (step ST4).
-5). Writing of these data is performed by the arithmetic and control unit 10.
This is performed via a data bus or the like (not shown) connecting the hard disk 20 and the hard disk 20. When the operation of writing data to the files 1 and 2 is completed, the arithmetic and control unit 10 terminates the execution of the program 100a, and
2 is released (step ST4-6).

As described above, even when the program logic is changed and the use timing of the file is changed from the initial design, the file is exclusively locked according to the priority stored in the file lock management table 3. With such a design, it is possible to omit the work of maintaining the consistency of the file lock, and it is possible to easily and quickly design a program, thereby improving the productivity of software.

FIG. 5 is a diagram schematically showing another configuration of the shared resource exclusive control system according to the second embodiment. In FIG. 3, reference numeral 3a denotes a file lock management table (exclusive control management table) that stores the exclusive lock priority set for each of the files 1, 2, and 4 when executing the programs 100 and 100b. It is stored in a main storage device (not shown) in the device 10. Also,
The priorities stored in the file lock management table 3a are sequentially read and decoded according to the instruction sequence of the program executed by the arithmetic and control unit 10, and are used for exclusive control described later. Further, even if a process using a new file 4 is added due to the addition of the program logic, the priority order corresponding to the file 4 is additionally set in the file lock management table 3a. 4
Is an arithmetic and control unit 10 in the computer system 30 which constitutes the shared resource exclusive control system according to the second embodiment.
Is a file (shared resource) that is a shared resource in which data is written and read when the programs 100 and 100b are executed. Further, when the arithmetic and control unit 10 executes the programs 100 and 100b independently, the file is locked so that data is not written to or read from the files 1 and 2 at the same time. Reference numeral 100b denotes a program stored in the main storage device (not shown) of the arithmetic and control unit 10, and a process of adding a program logic to the program 100 and using the file 4 is added. Also,
Like the program 100, it is sequentially read, decoded, and executed according to an instruction sequence constituting the program 100b. The same components as those in FIG. 1 are denoted by the same reference numerals, and duplicate description will be omitted.

Next, the operation will be described. Since the present invention relates to exclusive control of shared resources in a computer system, the exclusive control operation of shared resources will be described here. FIG. 6 is a flowchart showing a processing operation using a shared resource in the shared resource exclusive control system of FIG. In the processing operation of the program 100, the priorities stored in the file lock management table 3a are sequentially read and decoded at the beginning of the instruction sequence constituting the program 100, and the files 1, 2, and 4 are excluded according to the priorities. It is the same as the first embodiment, except that it is locked. In the processing operation of the program 100, no processing is performed on the file 4 exclusively locked.

Next, the case where the program 100b in which the program logic is added to the program 100 is executed will be described. First, the arithmetic and control unit 10 reads an instruction making up the program 100b from a main storage device (not shown) and starts executing the program 100b (step ST6-1). At the beginning of the instruction sequence constituting the program 100b, the priorities stored in the file lock management table 3a are sequentially read and decoded, and the files 1, 2, and 4 are exclusively locked according to the priorities (step ST6). -2).

Next, predetermined processing of program 100b is executed by arithmetic and control unit 10 (step ST6).
-3). Part of the data generated in step ST6-3 is written to file 1 (step ST6-4), and further data is written to file 2 (step ST6-).
5) Finally, the data is written to file 4 (step ST6-6). The writing of these data is performed via a data bus (not shown) connecting the arithmetic and control unit 10 and the hard disk 20. When the data write operation on the files 1, 2, and 4 is completed, the arithmetic and control unit 10 terminates the execution of the program 100b and releases the lock on the files 1, 2, and 4 (step ST6-7).

As described above, even when the program logic is added and the use of a new file is added from the initial design, the priority of the added file is additionally set in the file lock management table 3a. By doing so, the task of ensuring the consistency of the file lock can be omitted, and the program design can be performed easily and quickly, thereby improving the productivity of the software.

When a process using a new file 4 is added by adding program logic,
The operation of additionally setting the priority order corresponding to the file 4 in the file lock management table 3a may be automatically performed by a program processed by the arithmetic and control unit 10, and the user of the computer system 30 may input the data (not shown). The setting may be made appropriately using a unit.

As described above, according to the second embodiment, a plurality of programs including a program in which the order in which the files 1, 2, and 4 are used are changed by changing and / or adding the program logic to execute arithmetic control. Since the program is executed by the apparatus 10, even when the program logic is changed, the files 1 and 2 are locked with the priority set in the file lock management table 3 as before, or the added file 4 is locked. By simply setting the priority order in the file lock management table 3a, it is possible to omit the work of maintaining the consistency of the file lock, and it is possible to easily and quickly design a program, and thus to produce software. Performance can be improved.

Embodiment 3 In the third embodiment, when there is a change in the shared resources, the priorities of the changed shared resources before the change are set in the exclusive control management table.

FIG. 7 is a diagram schematically showing a configuration of an exclusive control system for shared resources according to Embodiment 3 of the present invention. In the figure, reference numeral 100c denotes a program stored in the main storage device (not shown) of the arithmetic and control unit 10; The use of program logic has been changed. Also, similarly to the program 100, they are sequentially read, decoded, and executed according to an instruction sequence constituting the program 100c. The same components as those in FIGS. 1 and 5 are denoted by the same reference numerals, and redundant description will be omitted.

Next, the operation will be described. Since the present invention relates to exclusive control of shared resources in a computer system, the exclusive control operation of shared resources will be described here. FIG. 8 is a flowchart showing a processing operation using a shared resource in the shared resource exclusive control system of FIG. In the processing operation of the program 100, the priorities stored in the file lock management table 3a are sequentially read and decoded at the beginning of the instruction sequence constituting the program 100, and the files 1, 2, and 4 are excluded according to the priorities. It is the same as the first embodiment, except that it is locked. Here, a case where the file design is changed and the program 100c is executed will be described. First, the arithmetic and control unit 10 reads an instruction constituting the program 100c from a main storage device (not shown) and starts executing the program 100c (step ST7-).
1).

Next, at the beginning of the instruction sequence constituting the program 100c, the file lock management table 3
a is sequentially read out and decoded,
The files 1, 2, and 4 are exclusively locked according to the priority (step ST7-2). In the instruction sequence of the program 100, the data is written to the file 2 after the data is written to the file 1. However, the instruction sequence of the program 100c in which the file design is changed and the program logic is changed correspondingly is changed. The order has been changed to write data to file 4 after writing data to file 1. However, the program 100c also divides the files 1, 2, 4 according to the priority stored in the file lock management table 3a.
Is exclusively locked, there is no deadlock even if there is a program that exclusively locks the files 1, 2, 4 other than the program 100c.

Next, a predetermined process of the program 100c is executed by the arithmetic and control unit 10 (step ST7).
-3). Part of the data generated in step ST7-3 is written to file 1 (step ST7-4), and the remaining data is written to file 4 (step ST7).
-5). Writing of these data is performed by the arithmetic and control unit 10.
This is performed via a data bus or the like (not shown) connecting the hard disk 20 and the hard disk 20. When the data write operation to the files 1 and 4 is completed, the arithmetic and control unit 10 terminates the execution of the program 100c, and
Release the locks on 2, 4 (step ST7-
6).

As described above, according to the third embodiment, when the files 1, 2, 4 are changed, the program 1
00 is changed from the file 2 used by the program 100c to the file 4 used by the program 100c, the priority order of the file 2 before the change is changed to the file lock management table 3a.
, The file that has been changed can be used without causing a deadlock only by designing so that the file is exclusively locked according to the priority stored in the file lock management table 3a. .

Embodiment 4 In the fourth embodiment, when a shared resource is newly added, a priority order corresponding to the added shared resource is additionally set in the exclusive control management table.

FIG. 9 is a diagram schematically showing the configuration of a shared resource exclusive control system according to the fourth embodiment of the present invention. In FIG. 3, reference numeral 3b denotes a file lock management table (exclusive control management table) that stores the exclusive lock priority set for each of the files 1 and 2 and the newly added file 4 when the program 100 is executed. Then, it is stored in a main storage device (not shown) in the arithmetic and control unit 10. The file lock management table 3b
Are sequentially read out and decoded according to the instruction sequence of the program executed by the arithmetic and control unit 10, and are used for exclusive control described later. Further, even if a new file 4 is added,
Are additionally set in the file lock management table 3b. The same components as those in FIGS. 1 and 5 are denoted by the same reference numerals, and redundant description will be omitted.

FIG. 10 is a diagram showing a file lock management table of the shared resource exclusive control system according to the fourth embodiment. The left side of the figure shows the file lock management table 3 before the addition of the file 4, and the right side of the figure shows the file lock management table 3b after the addition of the file 4. The priority order corresponding to the newly added file 4 is additionally set to configure the file lock management table 3b.

Next, the outline will be described. First, FIG.
As shown in the file lock management table 3 on the left side of FIG. 5, the file lock management table 3 has a priority set to execute file locking so that the file 1 is locked and then the file 2 is locked. System 30
Each of the programs operating above prevents the occurrence of deadlock by locking the files used in each program according to the priority set in the file lock management table 3.

Here, when the file 4 is newly added, the priority of the file 4 is additionally set as shown in the file lock management table 3b on the right side of FIG. Each program operating on the system 30 locks files used in each program according to the priority set in the file lock management table 3b, so that programs using the newly added file 4 can be used by other programs. The file 4 can be exclusively locked and used without causing a deadlock with the program.

When a file 4 is newly added, the operation of additionally setting the priority corresponding to the file 4 in the file lock management table 3b is automatically performed by a program processed by the arithmetic and control unit 10. May be performed by the user of the computer system 30 using an input unit (not shown).

As described above, according to the fourth embodiment, when a file 4 is newly added in addition to the files 1 and 2, the priority corresponding to the added file 4 is set to the file lock management table 3b. Is set additionally to
Even when the file 4 is added, the priority order corresponding to the added file 4 is simply set additionally in the file lock management table 3b, and the consistency of the file lock order among the programs is specially considered. Thus, the newly added file 4 can be used while preventing a deadlock from occurring.

Further, the exclusive resource control program for causing the computer to execute the functions of the shared resource exclusive control system according to the above embodiment is recorded on a computer-readable recording medium, and the recording medium is read by the computer. By storing the information in the storage means, it is possible to construct a computer system exhibiting the effects of the shared resource exclusive control system according to the above embodiment, and to improve the versatility of the shared resource exclusive control system according to the above embodiment. Can be done.

In the above embodiment, the files 1 and 2 are shown as shared resources. However, the present invention is not limited to this.
As long as the resources are used by the processes executed by the arithmetic and control unit 10 of the computer system 30, the software and hardware can be applied.

[0065]

As described above, according to the shared resource exclusive control system of the present invention, an exclusive control management table for storing a plurality of shared resources and the priority of exclusive control set for each of the plurality of shared resources. And a program execution means for independently executing a plurality of programs using a plurality of shared resources, and storing the information in an exclusive control management table when the program execution means independently executes a plurality of programs using a plurality of shared resources. And program control means for exclusively locking the shared resources sequentially corresponding to the given priorities, so that no matter what timing a plurality of programs are executed, it is possible to prevent the program execution means from causing a deadlock condition. There is an effect that can be.

Further, it is only necessary for the program designer to design such that the shared resources are exclusively locked in accordance with the priorities stored in the exclusive control management table, and the work of securing lock consistency can be omitted. Since program design can be performed easily and quickly, there is an effect that the productivity of software can be improved.

According to the shared resource exclusion control system of the present invention, the program execution means executes a plurality of programs including a program in which the order of using the shared resource is changed by changing and / or adding the program logic. Therefore, even when there is a change in the program logic, the shared resources are locked with the priority stored in the exclusive control management table as before, or the priority for the added shared resource is stored in the exclusive control management table. By simply making an additional setting, it is possible to omit the task of locking consistency, and it is possible to easily and quickly design a program, thereby improving the productivity of software. is there.

According to the shared resource exclusive control system of the present invention, when the shared resource is changed, the exclusive control management table sets the priorities of the changed shared resources before the change. Even if the shared resources are changed, it is possible to use the changed shared resources without causing deadlock simply by designing the shared resources exclusively according to the priority stored in the exclusive control management table. effective.

According to the shared resource exclusive control system of the present invention, when a shared resource is newly added, the exclusive control management table additionally sets a priority order corresponding to the added shared resource. By simply setting the priority corresponding to the added shared resource in the exclusive control management table additionally, it is possible to prevent deadlock from occurring without special consideration of lock order consistency between programs. There is an effect that the shared resources added to the file can be used.

According to the resource locking method of the present invention, an exclusive control management table for storing a plurality of shared resources and an exclusive control priority set for each of the plurality of shared resources,
A resource locking method for a shared resource exclusive control system, comprising: a program execution unit that independently executes a plurality of programs using a plurality of shared resources, wherein the program execution unit independently executes a plurality of programs using a plurality of shared resources. When executing multiple programs, the corresponding shared resources are exclusively locked in order according to the priority order stored in the exclusive control management table. There is an effect that the lock state can be prevented.

According to the computer-readable recording medium for recording the shared resource exclusive control program of the present invention, the exclusive control for storing the plurality of shared resources and the priority order of the exclusive control set for each of the plurality of shared resources. A management table is included, and when executing a plurality of programs using a plurality of shared resources independently of each other, the corresponding shared resources are exclusively locked sequentially according to the priority stored in the exclusive control management table. There is an effect that the versatility of the exclusive control system for the shared resources that has the effects of the paragraphs 0066 and 0067 can be improved.

[Brief description of the drawings]

FIG. 1 is a diagram schematically showing a configuration of a shared resource exclusive control system according to a first embodiment of the present invention;

FIG. 2 is a flowchart showing a processing operation using a shared resource in the shared resource exclusive control system of FIG. 1;

FIG. 3 is a diagram schematically showing a configuration of a shared resource exclusive control system according to a second embodiment of the present invention;

FIG. 4 is a flowchart showing a processing operation using a shared resource in the shared resource exclusive control system of FIG. 3;

FIG. 5 is a diagram schematically showing another configuration in the shared resource exclusive control system according to the second embodiment of the present invention;

6 is a flowchart showing a processing operation using a shared resource in the shared resource exclusive control system of FIG. 5;

FIG. 7 is a diagram schematically showing a configuration of a shared resource exclusive control system according to a third embodiment of the present invention;

8 is a flowchart showing a processing operation using a shared resource in the shared resource exclusive control system of FIG. 7;

FIG. 9 is a diagram schematically showing a configuration of a shared resource exclusive control system according to a fourth embodiment of the present invention;

FIG. 10 is a diagram illustrating a file lock management table of the shared resource exclusive control system according to the fourth embodiment.

FIG. 11 is a diagram conceptually showing the configuration of a conventional computer system.

FIG. 12 is a flowchart showing a processing operation using a shared resource in the computer system of FIG. 10;

[Explanation of symbols]

1,2,4 files (shared resources), 3,3a, 3b
File lock management table (exclusive control management table), 10 arithmetic and control unit (program execution means, program control means), 20 hard disk, 30 computer system (exclusive control system for shared resources), 1
00, 100a, 100b, 100c, 200 Program.

Claims (6)

[Claims] 1. An exclusive control management table for storing a plurality of shared resources, an exclusive control priority set for each of the plurality of shared resources, and a plurality of programs using the plurality of shared resources, respectively. A program execution unit that executes the plurality of programs using the plurality of shared resources independently of each other.
A shared resource exclusive control system comprising: a program control means for exclusively locking the shared resources sequentially corresponding to the priorities stored in the exclusive control management table. 2. The shared program according to claim 1, wherein the program executing means executes a plurality of programs including a program whose order of using shared resources is changed by changing and / or adding program logic. Exclusive resource control system. 3. The exclusive control system for shared resources according to claim 1, wherein the exclusive control management table sets the priorities of the changed shared resources before the change when the shared resources are changed. . 4. The exclusive control management table according to claim 1, wherein when a shared resource is newly added, a priority order corresponding to the added shared resource is additionally set.
Exclusive control system for the shared resources described. 5. An exclusive control management table for storing a plurality of shared resources, an exclusive control priority set for each of the plurality of shared resources, and a plurality of programs using the plurality of shared resources, respectively. A resource locking method for a shared resource exclusive control system comprising: a program execution unit that executes a plurality of programs using the plurality of shared resources independently of each other.
A resource locking method characterized by exclusively locking shared resources sequentially corresponding to the priorities stored in the exclusive control management table. 6. An exclusive control management table for storing a plurality of shared resources and an exclusive control priority set for each of the plurality of shared resources, wherein a plurality of programs using the plurality of shared resources are stored. A computer-readable recording medium recording a shared resource exclusive control program for exclusively locking a corresponding shared resource according to the priority order stored in the exclusive control management table in order to independently execute the shared resources.