JPH0485637A - Dynamic area management system - Google Patents

Abstract

PURPOSE:To efficiently manage utilization are used by the function and processing of a system in a lump by securing the utilization area in a lump at the time of starting the processing of the system and adopting the construction reserving the areas from this, releasing the areas, and collecting plural space areas. CONSTITUTION:An area management routine 2 provided with the function of the secure/release of the utilization areas of the entire system, reserve routine 2-3, release routine 2-4, and pack routine 2-5, and an area management table 3 are provided inside the system, and the utilization area is get in a lump at the time of starting the processing of the system. The reserve routines 2 to 3 pass the area cut from the utilization area based on the area management table 3 corresponding to the area reserve request or the like fro a program during processing, the release routine 2-4 releases the reserved area, and pack route 2-5 collects plural space areas. Thus, the utilization area used by the function and processing of the system can be efficiently managed in a lump.

Description

[Detailed Description of the Invention] [Summary] Regarding a dynamic area management method that secures and releases areas used for variable-length data, it is possible to eliminate the area allocation and release that previously required areas to be allocated and released in a distributed manner for each function and each process. The purpose is to perform the release process all at once and make the area usable efficiently for the entire system.In addition to securing and releasing the used area for the entire system, this used area is reserved as necessary. An area management routine is provided in the system that has a reserve routine to release the reserved area, a release routine to release the reserved area, and a pack routine to collect empty areas. During processing, in response to an area reserve request, lease request, or pack request from the program, the above reserve routine passes the area cut out from the used area, the above release routine releases the reserved area, and the pack routine The empty areas of the image are combined into a large empty area.

[Industrial application field]

The present invention relates to dynamic area management for securing and releasing areas used for variable length data.

[Prior art and problems to be solved by the invention] As the performance of computers improves, the size of data that can be processed by computers is increasing. However, in reality, there is an upper limit to the area that can be used for processing, and as a result, there is a shortage of areas necessary for processing, and a large amount of data cannot be processed.

In particular, with mathematical programming systems, as real-world problems become more complex, the size of data continues to grow, and conventional systems are running out of space and are unable to handle an increasing number of problems. .

In order to process large data, it is necessary to manage the area so that it is used without wasting space and takes up a large area for processing.
This must be done in a system that processes data.

Additionally, systems that process variable-length data, such as mathematical programming problems, are processing increasingly diverse data.
Data of very different sizes must be processed in one system. To do this, it is necessary for the system to manage the area so that it can efficiently process all types of data, from very small data to giant data.

Conventionally, systems that process variable-length data, such as mathematical programming, have measured the size of the data and then allocated the area necessary for each process for each function when securing an area for data processing. It was secured and released when processing was completed. For this reason, if each function secures a processing area separately, it becomes necessary to manage the area length, the start address of the secured area, etc. for each function. There was a problem in that it became necessary to secure the area. In addition, if the order of area allocation and area release are different, the area will be used in a state of worm-eaten condition when viewed from the whole area, and the efficiency of area usage will be extremely poor. There was a problem in that it became impossible to secure the necessary information and processing could not be performed. For example, a case in which the program A in FIG. 3 is executed will be specifically explained.

fl1%3 Figure (a) First line of program A “CALL”
The program C1 is called with "CI", and the called program C1 executes "GETMAIN C,4"" to secure area C from the memory (FIG. 1(b)).

(2) Figure 3 (a) Second line of program A “GET!”
Figure 3 (b) Area A from memory with '1AIN A, 4'
ensure that

(3) Figure 3 (a) Third line of program A “CALL
``Call program B, and execute ``GET!'' in the called program B. '! Execute "AIN B, 2" to secure area B from memory in Figure 3 (b), then execute "FREE?" I
Execute A INB" to release area B.

(4) Figure 3 (a) 4th line of program A “CALL
Call program C2 at C2°, execute "FREEMAIN" in the called program C2, and release area C from the memory in Figure 3 (B).The state of the memory at this time is shown in Figure 3 (C) on the left. show.

(5) Figure 3 (a) 5th line of program A “GE”
T Paste IN AA, 7” Figure 3 (c) From memory to area A
Although an attempt is made to secure area A, there is a problem in that area AA is larger than the empty area as shown in the figure and cannot be secured. Therefore, the empty area at the beginning of the memory and the empty area at the end of the memory are combined into one large empty area, and the area AA
It is hoped that it will be possible to secure the

The purpose of this invention is to collectively perform the process of securing and releasing areas, which used to be done separately for each function and each process, and to enable efficient use of areas as a whole system. There is.

[Means to solve the problem]

FIG. 1 shows the principle configuration diagram of the present invention. In FIG. 1, program l is a program that performs business processing of the system, and is a program that performs area reservation requests, release requests, bank requests, etc. be.

The area management routine 2 includes a reserve routine 2-3 that secures and releases areas used by the entire system and reserves areas, a release routine 2-4 that releases areas, a pack routine 2-5 that collects empty areas, etc. It consists of:

Area management 1-pull 3 manages the area length, area type (movable, non-movable, secured from the end), etc. for each area.

[Effect]

As shown in FIG. 1, the present invention provides an area management routine 2 and an area management table 3 that secure and release the used area of the entire system, a reserve routine 23, a release routine 2-4, a pack routine 25, etc. The area management table 3 is set up to secure the area to be used all at once at the start of system processing (for example, at the start of a task), and to respond to area reserve requests, release requests, and pack requests from the program during processing. Toni Reserve Blue Chin 2-
3 transfers the area 4 cut out from the used area L1, the release routine 24 leases the reserved area 1.1, and the pack routine 2-5 combines a plurality of empty areas into a large empty area.

Therefore, by allocating a space for use at the start of system processing, and then reserving the space, releasing the space, or combining multiple empty spaces, the space used by the system's functions and processes can be reduced. It becomes possible to manage them collectively and efficiently.

〔Example〕

Next, the configuration and operation of one embodiment of the present invention will be sequentially explained in detail using FIG. 1 and Part 2.

In FIG. 1, a program 1 is a program that performs business processing of the system, and performs business processing by making an area reservation request, release request, and bank request to reserve and release an area. Here, the program l is a program A, a routine called from this program A, a program B1, a program C1,
It consists of program C2.

Area management routine 2 includes a reservation (GET) routine 2-1 that secures an area to be used by the entire system at the start of a task, etc., and a release (FIIEE) routine to release an area to be used by the entire system at the end of a task, etc. 2-2, Reserve routine 2-3 that reserves space from the used area, Release routine 2-4 that releases the reserved area, Pack routine 2 that collects empty space.
-5, etc.

The area management table 3 sets the area start address, area length, area type (movable, non-movable, area secured from the end of memory), etc. of the reserved area that the reserve routine 23 cuts out from the used area of the entire system. This table is used by the release routine 24 to perform area management such as deleting the area start address of the released area when releasing the area. By referring to this area management table 3, the current area usage status can be known.

The memory 4 is a memory that provides a usage area.

Next, in accordance with the order not shown in the flowchart of Figure 2,
The operation of the diagram configuration will be explained in detail.

In FIG. 2, ■ secures the maximum area to be used at the start of a task. For example, program A in Figure 1 executes "CALL GET" in the first line and secures it ([;E
T) Call routine 2-1, and this called reservation routine 2-1 secures the maximum area used by system functions and processes.

@ is CALL PACK (collects empty areas)
. In this case, the pack routine 2-5 refers to the area type in the area management table 3, takes out areas that are "movable", fills them in order from the beginning of the used area, and collects empty areas.

(2) determines whether or not the reservation request area can be reserved. If YES, perform ■; if NO (there is a movement rate rlJ among the empty areas, all the empty areas can be combined 4', and the reserve requested area is continuous from the combined empty area. (for example, in cases where we were unable to secure a head position), we will disclose the lack of headcount.

(2) executes CA i, l, R5V. This is, for example, the second line "(: A1, i, c1
In the program C1 called by the execution r of ``CA
11.R5V.

4. X'''t'Ji'H, Reserve (IIsV) Reaching 2-3 searches the area management boolean 3, confirms whether the reserve request area can be reserved, and reserves area C (f! Reserve). ) U5, area management - Set information such as the area head i' address of this area C, area length 1, and area type (movable/non-movable i1/secured from the end) in pull 3.

■ determines whether the area has been reserved or not. In the case of 6Y'ES, the process ends with "If the area has been reserved (ENr
)), in the case of NO, the area is not displayed.

7. ° This ensures the maximum area used by the system at the start of the task, and if there is a continuous empty area, it is reserved and handed over in response to the area reservation request from BuI Nigelam. (If there is no empty space for 7, you can combine them or regenerate the IN area and pass it on, allocating it as a system frame and securing the usage area, and then use this usage area as needed for processing.) The ability to cut out, darken, process, and manage efficiently is < Section Ii3.

Next, the reservation, release, and bank of the area 29 will be explained in detail when executing the program A in FIG.

First line CALL to the program, GET: The reservation routine 2-1 called by this execution allocates the maximum area used by the system.

CA1.1 in the second line of program A. C1: CALL of program C1 called by 4.2
As a result of the execution of R5V and 4X, the called reserve routine 2-3 is stored in area C as shown in the memory 4 on the left.
Reserve °. At this time, in the area management table 3, the area start address, area length, area type (movement 0), movement rate i=J, reserve from final technique, etc. of the reserved area C are set.

Third line to the program (7) CA1. , L R3V, 4
．． The reserve routine 23 called by the execution of X: reserves area A as shown in the memory 4 on the left. At this time, the area management table 3 is set with the area start address, area length, area type (movable, non-movable, advanced to reserved), etc. of the reserved area A.

CAI of the 4th line of program A, 1. B: CALL R5ν of program B called ζ by the execution of this
, 2. By executing X, the called reserve routine 2-3 reserves area B as shown in the left memory 4. At this time, set the reserved area B0') area start atlus, area length, area type (movable, non-movable, last technique Karari reserve), etc. in the area management table 36. Next, set the ( ]ALL RLS,H
Release routine 2-4 called by the execution of
releases the small number, ', area B to the left memory 4. At this time, the area head address, area length, area type (movable, movement rate iiJ, last technique to reserve), etc. of the reserved area I3 are deleted from the area management boolean 3.

CALL C2 on the 5th line to the program: CAI of program C2 called by execution of this,,L [
By executing iLS, C, the called release routine 2-4 releases area C from the left memory 4. At this time, the released area C is displayed in the area management table 3.
Delete the area start address, area length, area type (movement 6J, no movement, reserve from final technique), etc.

7' o l"j mu A (D line 6 17) CA1.1
．． The pack routine 2-5 called by PACI
JI area C and area B have been deleted), as shown in memory 4 on the right side, move to the beginning and collect empty areas. At this time, in Area Management Maple 3, move area A.
Change the area start address of 11.

CALL RSV of the 7th ma of program A, 7. X:
t: The reserve routine 23 called by this execution reserves the area AAt as shown in the memory 4 on the right side. At this time, in the area management team 3, the area start address, area length, area type (movement-iJ, moving vehicle lJ, final technique to reserve), etc. of the reserved area AA are set. Here, in memory 4 on the right side, we moved area A to the beginning and grouped the empty area with ', so area AA
This invention can be reserved (Figure 3) In the conventional configuration, as shown in Part 3 (C) 1, an area was reserved and released for each process. (Also, the area AA could not be secured, making it impossible to continue processing).

8th line CALL R1, S, A, 9th to the program
Row CALL R1, S, AA: Release routines 2-4 called by these executions are stored in memory 4 on the right side.
From Area A, 4-head AA was released. At this time, the area A, the area start address of area A, etc. are deleted from the area management table 3.

7'LJ Gouf J,, A (7) Line 10 CALL
FREE+ The release routine 2-2 called by the program frees the area of the memory 4 on the right side (the area reserved for the entire system).

〔Effect of the invention〕

As explained below, according to the present invention, a configuration is possible in which a used area is secured all at once at the start of system processing, and the area is then reserved, the area is released, and multiple empty areas are grouped together. By adopting this method, the areas used by system functions and processes can be collectively managed efficiently. When a process or function is required, it can be extracted from the used area and handed over, and the empty area can be consolidated as needed, making it possible to use the used area efficiently. It becomes possible to process the data. In addition, in order to collectively manage the usage information used by the system in the area management table 3, the usage status of the area can be referred to j1. can be easily understood. Furthermore, no matter what data is input, the area can be used flexibly.
It is possible to handle everything from small data to giant data with one system.

[Brief explanation of the drawing]

FIG. F is a block diagram of one embodiment of the present invention. FIG. 2 is a flowchart I explaining the operation of the present invention. FIG. 3 is an explanatory diagram of the prior art. Circular, 1 Niprogram 2; Area management routine! +, :fi Hold (GET) Routine 2-2: Release (FREE) Routine 2-3 = Reserve (RS V) Loop N 2-4 = Release (RIS) Routine 2-5: Buff (PACK)
Routine 3: Area management table 4: Memory error 1 Figure O (issued August v4 to 28/17 - Nayad Yuzu (A) also figure

Claims (1)

[Claims] In a dynamic area management method that secures and releases an area used for variable-length data, a reservation system that secures and releases a used area for use as a whole system and reserves this used area as necessary. Area management routine (2) that includes a routine (2-3), a release routine (2-4) that releases reserved areas, and a pack routine (2-5) that collects empty areas.
is provided in the system, allocates an area for use at the start of system processing (for example, at the start of a task), and responds to area reserve requests, release requests, and pack requests from program (1) during processing. The above reserve routine (2
-3) passes the area cut out from the used area, the above release routine (2-4) releases the reserved area, and the pack routine (2-5) combines multiple empty areas into a large empty area. A dynamic area management method characterized by being configured as follows.