JPH0454545A - Common area management method - Google Patents

Abstract

(57) [Summary] This bulletin contains application data before electronic filing, so abstract data is not recorded.

Description

[Detailed Description of the Invention] [Summary] Regarding a common area management method in a computer system that can execute multiple processing programs in parallel, the present invention provides a method for managing a common area in a computer system that can execute multiple processing programs in parallel, without setting an upper limit on the usage area on the processing program side. A common area management method for a computer system that can execute multiple processing programs concurrently, with the aim of providing a common area management method that prevents one processing program from acquiring an unlimited amount of usage area. In this case, when one processing program acquires a usable area in the common area, an unacquirable area is provided that cannot be used by the processing program but can be used by other processing programs. It is composed of

[Industrial Field of Application] The present invention relates to a shared area management method in a computer system that can execute a plurality of processing programs in parallel.

In order to effectively utilize the various resources of a computer system, operating systems have built-in multiprocessing functions that execute multiple processing programs simultaneously.

In such an operating system, it is necessary to manage the shared area so that the execution of one processing program does not interfere with the execution of other processing programs.

[Conventional technology]

In general, in an operating system with a multiprocessing function (hereinafter referred to as "O5"), the storage space that can be controlled by the O3 includes a control area containing address maps, etc., and a common area as a communication area for multiprocessing. , has a processing area used for storing individual processing programs or program processing instructions.

In response to an acquisition request from a processing program, O3 performs acquisition processing to acquire the usage area used by the processing program in the shared area, but since the shared area is limited, the usage area for one processing program If an unlimited number of programs are acquired, there will be insufficient area for other processing programs to run, which may lead to system failure.

Therefore, conventionally, the upper limit for acquiring a usage area has been set by the processing program.

[Problem B to be solved by the invention] However, the size of the common area varies greatly depending on the hardware resources and memory allocation structure of each computer system, so it is not possible to set it uniformly when creating a processing program. Can not.

For example, if the upper limit of the usable area is too low for a large system, it will not be practical because it cannot withstand the processing of large amounts of data, and conversely, if the upper limit of the usable area is too high for a small system, the processing This results in the program securing a useless area, which interferes with the execution of other processing programs.

Therefore, although system engineers actually set the common area according to the environmental conditions of each individual system, it is quite difficult and troublesome to investigate the individual environmental conditions and determine an appropriate upper limit. It was work.

Therefore, for example, if only a small area is used, the upper limit may not be set, and in such cases, the acquisition process may become a loop due to a bug in the processing program. By putting it away, there was a risk that the entire common use area would be acquired.

In view of the above-mentioned problems, the present invention provides a shared area management method that prevents one processing program from acquiring an unlimited amount of usage area without setting an upper limit on the usage area on the processing program side. is intended to provide.

[Means for Solving the Problems] In order to solve the above-mentioned problems, the management system according to the invention of claim 1 allows one processing program AP to operate in a common area 22. as shown in FIGS. When acquiring the use area G in step 32, an unacquirable area E is provided that cannot be used by the processing program AP in question but can be used by other processing programs AP.

The management method according to the invention of claim 2 is such that when an acquisition process for acquiring a usage area G in the common area 2232 is executed by a request from one processing program AP, the usage by the processing program AP that requested the acquisition process is At the same time, an area E that cannot be acquired and that can be used by another processing program AP is acquired.

In the management system according to the third aspect of the present invention, when acquiring the unobtainable area E, it is not possible to acquire the use area G that has already been acquired by a request from another processing program AP.

In the management method according to the invention of claim 4, when acquiring the unobtainable area E, it is also possible to acquire the unobtainable area E that has already been acquired by a request from another processing program AP.

In the management system according to the fourth aspect of the invention, the size of the unobtainable area E is set to be a constant ratio to the use area G acquired in the acquisition process.

[For production]

O3 performs acquisition processing to acquire the use area G in the common areas 22 and 32 in response to an acquisition request from one processing program AP.

In the acquisition process, in addition to acquiring the use area G, the unacquirable area E is virtually acquired.

The unobtainable area E is an area that cannot be used by the processing program AP that requested the acquisition process, but can be used by other processing programs AP.

Acquisition of unobtainable areas E is also performed for unobtainable areas E that have already been acquired by requests from other processing programs AP.

Note that in this specification, the processing program AP that makes an acquisition request includes a job executed by the processing program AP. Therefore, it can be said that the unobtainable area E is an area that cannot be used by the job that made the acquisition request, but can be used by other jobs. In other words, the unobtainable area E is obtained for each processing program AP or for each job.

〔Example〕 Embodiments of the present invention will be described below with reference to the drawings.

FIG. 1 is a diagram showing an example of a management method for a common area 22 according to the present invention.

In FIG. 1, a virtual storage space 11 of a computer system 1 is provided with a control area 21, a common area 22, and a processing area 23.

A control program is stored in the control area 21, and an address map AM for managing the usage status of the common area 22 is created.

The common area 22 has a plurality of processing programs APa and APb stored in the processing area 23 (collectively "
It is used as a communication area for multiple processing by processing programs (sometimes referred to as APJ), and is used for mutually receiving and passing data and for referencing common data.

In the common area 22, a use area G necessary for executing each processing program AP and an unobtainable area E, which will be described later, are acquired.

The processing area 23 includes a processing program APa.

APb is stored. These processing programs AP
a and APb are all or a part of a service program or a user-created program, and are composed of individual program processing instructions. When the processing program AP is executed, a job such as an acquisition request, which will be described later, is generated.

0310 can execute a plurality of processing programs APa and Apb simultaneously and in parallel, and also has a space control function to control and manage the virtual storage space 11.

0510, when a request to acquire a usage area G is received from the processing program AP, acquisition is performed to acquire the usage area G and also acquire an unobtainable area E of the same size as the usage area G in the common area 22. Perform processing.

The unobtainable area E acquired by the acquisition process of 0310 is an area that cannot be used by the processing programs APa, APb that requested the acquisition of the usage area G, but can be used by other processing programs APb, APa. That's true.

In other words, the area E that cannot be acquired is an area that cannot be used or re-acquired by the processing program AP that acquired it, and for other processing programs AP, it can be used by acquiring it as a usage area G. area.

In addition, the unobtainable area E cannot be acquired for the use area G that has already been acquired through an acquisition request from another processing program AP, but the unobtainable area E cannot be acquired from a usage area G that has already been acquired through an acquisition request from another processing program AP. It is possible for area E.

FIG. 2 is a diagram showing an example of address map AM.

The address map AM contains the acquisition processing number JN.

Addresses AD of the start and end positions of the used area G or the unobtainable area E, and an acquisition flag CM (in the case of the used area G) or EC (in the case of the unobtainable area E) indicating the type of acquired area are written.

As the acquisition processing number JN, for example, a program number, a task number, etc. are written.

The start position of the address AD is determined by the specification of 0310, and the end position is determined based on the size required by the use area G of the acquisition dependence.

Next, the acquisition processing by 0510 will be explained.

First, when an acquisition request is made to 0510 from the processing program APa, osto retrieves the current address map A.
Address AD that can obtain the usage area Ga by referring to M
, and sets the acquisition processing number JN "rJOBa", the address AD, and the acquisition flag rGM indicating that the area is in use G in the address map AM.

At the same time, 0510 searches for an address AD that can acquire an unobtainable area Ea that is the same size as the used area Ga, and sets the address AD and an acquisition flag "EG" indicating that it is an unobtainable area E, respectively. do.

Then, the use area Ga and the unobtainable area Ea are secured in the common area 22.

Next, when an acquisition request is made to 0310 from the processing program APb, the usage area c is
b and the address AD for the unobtainable area Eb, and enter the corresponding acquisition processing number JN in the address map AM.
JOBb, , address AD, and acquisition flag rGM,
rEG, respectively.

At this time, in the example shown in FIG.
In acquiring the use area cb according to a request from the processing program APb, the use area cb is acquired by superimposing it on the same address map as the unobtainable area Ea that was previously acquired according to the request from the processing program APb.

According to this embodiment, the processing program APa.

When there is a request to acquire usage area G from APb,
0510 acquires the use area G and the unobtainable area E through the acquisition process, so one processing program AP' can only acquire up to half of the use area G of the common area 22, and other areas, that is, acquisition The unavailable area E becomes usable by another processing program AP, and the processing program AP is prevented from acquiring the usable area G in the common area 22 without limit.

Therefore, even if the upper limit of the usage area G is set on the processing program AP side, and the processing program A
Even if P contains a bug or the acquisition process becomes a loop, the entire shared area 22 will not be acquired by such a processing program AP, and the This prevents the system from going down due to a lack of available area G and becoming impossible to execute.

Furthermore, if the processing program AP uses only a small area, the operation of the computer system 1 will not be hindered even if the upper limit for acquiring the use area G is not set in advance. Therefore, the work required to set the upper limit of the usage area G can be omitted, making it extremely easy to create the processing program AP and apply it to the system.

FIG. 3 is a diagram showing another example of the management method for the common area 32 according to the present invention.

FIG. 3 shows a virtual storage space 11a for a computer system la that employs the multiple virtual storage system O3.

Such a computer system 1a has a control area 31 and a table area (common area) 32 as areas common to all job spaces in the virtual storage space 11a. In the storage map SM in this control area 31, the usage flag GM (when the usage area G is secured) or the provisional usage flag EC (when the unobtainable area E is secured) of the table area 32 is posted.

As usage area G, DB, (Data Ba5e)
, DS (Data 5et) exclusive control area Gc
If this is considered, a large area may be secured as the exclusive control area Gc for these DBs and DSs.

For example, as shown in FIG. 3, when the loop of the exclusive control area acquisition process JOBc of the application program APc is executed, the large-scale exclusive control area G from AAI to AAn is
c is secured. In this case, since "n" is an extremely large number or infinite, conventionally there is a possibility that the entire table area 32 becomes the exclusive control area Gc, but according to this embodiment , every time one exclusive control area Gc is secured, unobtainable areas E and c of the same size are secured, so when the exclusive control area Gc becomes half of the table area 32, the exclusive control area Gc is secured. becomes impossible and abends.

As a result, application programs or jobs other than the application program APc stored in the user area 33 can use the area from ABI to ABn, which is secured as the unobtainable area Ec, so that an area shortage is prevented. Ru.

Therefore, when an application program APc or the like that uses the table area 32 goes out of control or performs large-scale exclusive use, the entire computer system 1a is prevented from going down due to a lack of resources in the table area 32.

In the above embodiment, the size of the unobtainable area E is the same as the use area G, but this ratio is, for example, 1.
You may change it as appropriate, such as 10 to 10.10 to 1. Also,
The size of the unobtainable area E may be constant regardless of the size of the use area G, or may be specified from the processing program AP.

In the above embodiment, management of the shared area 22.32 in the virtual storage space 1111a was explained.
It is also applicable to computer systems that do not have virtual storage space.

〔Effect of the invention〕

According to the present invention, it is possible to provide a common area management method that prevents one processing program from acquiring an unlimited amount of usage area without setting an upper limit on the usage area on the processing program side. .

[Brief explanation of the drawing]

FIG. 1 is a diagram showing an example of the common area management method according to the present invention, FIG. 2 is a diagram showing an example of an address map, and FIG. 3 is a diagram showing another example of the common area management method according to the present invention. FIG. In the figure, 1.1a is a computer system, 11 and lla are virtual storage spaces, 22 is a shared area, 32 is a table area (common area), AP is a processing program, G is a used area, and E is an area that cannot be acquired. Fig. 1 showing one 9'11 of the common area management method according to the present invention Fig. 2 showing -fll of the address map

Claims (5)

[Claims] (1) A management method for a common area (22) (32) in a computer system (1) (1a) capable of concurrently executing a plurality of processing programs (AP), wherein one of the processing programs (AP) is the said common area (
22) When acquiring the usable area (G) in (32), there is an unacquirable area (E) that cannot be used by the processing program (AP) but can be used by other processing programs (AP). A common area management method characterized by: (2) A management method for shared areas (22) and (32) by an operating system that allows multiple processing programs (AP) to run concurrently, wherein the shared areas (22) and (32) are Usage area (G) in area (22) (32)
When the acquisition process to acquire is executed, a non-acquisition area (E) that cannot be used by the processing program (AP) that requested the acquisition process and can be used by other processing programs (AP) is created. A common area management method characterized by simultaneous acquisition. (3) The acquisition of the unobtainable area (E) is made impossible for the use area (G) that has already been acquired by a request from another processing program (AP). Common area management method. (4) The acquisition of the unobtainable area (E) is made possible even for the unobtainable area (E) that has already been acquired by a request from another processing program (AP). The common area management method described in 3. (5) The size of the unobtainable area (E) is set to be a constant ratio to the use area (G) acquired in the acquisition process. A common area management method described in any of the above.