JPH02310745A - Work buffer sharing system - Google Patents

Abstract

PURPOSE:To improve the utilizing efficiency of a memory and to shorten processing time as a whole by providing a utilizing state managing table to manage the utilizing state of a work buffer at every processing. CONSTITUTION:A control part 3 performs the management and control of the area of the work buffer 1 by referring to the utilizing state managing table 2. The utilizing state managing table 2 holds utilizing status by respective processing in the area of the work buffer 1 corresponding to each of the processings A-D. For example, when the processing D is unable to secure the area of designated bytes in an unused area, the unused area is extended by releasing the area of an adjacent processing C, and still it is insufficient, the area of the processing B is released by repeating such processing. Thereby, since data can be held as far as sufficient unused areas exist in the area of the work buffer without deleting preseeding data, it is possible to shorten the processing time by reducing the developmental possibility of a re-processing, and also, to effectively use the area of the work buffer.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] ° The present invention relates to a work buffer sharing method, and particularly to a work buffer sharing method in a program that shares a large capacity work buffer among a plurality of different processes.

[Conventional technology]

Conventionally, when multiple different processes share the same work buffer, when a process attempts to use that work buffer, it is difficult to understand how the work buffer was used by the previous process. The entire area of the work buffer was initialized and the necessary data was stored unconditionally starting from the first address, without being aware of the current state of the work buffer.

[Problem to be solved by the invention]

In the conventional work buffer sharing method described above, the process being executed occupies the entire area of the work buffer, and the data previously stored in the work buffer is removed from the work buffer when a new process starts. It had been erased. Therefore, if you want to refer to data that was previously stored in the work buffer after performing other processing, you must re-execute the same processing to create that data, and the conversation It has the disadvantage of delaying the response of shape processing and increasing the total execution time of the program.

In addition, the work buffer area is determined by considering the maximum length of data stored in each process, so in most cases only a part of the work buffer area is used, which improves memory usage efficiency. The disadvantage is that it is bad.

SUMMARY OF THE INVENTION It is an object of the present invention to provide a work buffer sharing method that eliminates the above-mentioned drawbacks, improves memory usage efficiency, and reduces overall processing time.

[Means to solve the problem]

The work buffer sharing method of the present invention includes a use state management table that manages the use state of the work buffer area for each of the processes in the work buffer sharing method in which one work buffer area is used in a plurality of different processes. , an area securing means that refers to the usage state management table when starting each of the processes and secures an area of a specified size according to a predetermined procedure if there is sufficient unused space in the work buffer; If there is no unused area that can secure an area of a specified size in the buffer, the area releasing means releases the used area according to a predetermined procedure and expands the unused area.

〔Example〕

Next, embodiments of the present invention will be described with reference to the drawings.

FIG. 1 is a block diagram of an embodiment of the present invention. In FIG. 1, 1 is a work buffer shared by four processes A, B, C, and D, 2 is a usage status management table that manages the usage status of the area of work buffer 1, and 3 is a usage status management table 2. This is a control unit that refers to and manages and controls the area of the work buffer 1. As shown in FIG. 1, the usage status management table 2 has management columns corresponding to processes A, B, C, and D, each of which holds the usage status of each process in the area of the work buffer 1.

FIG. 2 is a configuration diagram showing the detailed structure of the usage status management table 2. As shown in FIG. A column indicating the number of processes to be shared, a usage status flag indicating whether or not an area is currently reserved in work buffer 1 for each process, the start address of the area reserved, and the area reserved for each process. A column is provided to store the end address of the area being stored.

Next, an example of actual operation will be explained with reference to FIGS. 3 to 7. FIG. 3 shows a state in which no process is using the work buffer yet. At this time, the usage status flags for each process in the usage status management table are all "0", and the area start address and area end address both point to the start address of the work buffer.

In this state, when process A requests to secure an area of an arbitrary number of bytes, area A of the requested size is allocated from the beginning of the work buffer as shown in FIG.

At this time, the usage status flag of process A becomes "1" and the area end address is updated. At the same time, the area start addresses and area end addresses of processes B, C, and D other than process A are all replaced with the area end address of process A.

Next, when process C tries to use the work buffer, the area start address of process C is the area end address of process A, so process A is followed by process C as shown in Figure 5.
area is secured. At this time, the area start and end addresses of process A are replaced with the area end addresses of process C, but the area start and end addresses of process B remain unchanged, and the area end addresses of process A and the area start address of process C are replaced. It's the same.

In this state, when process B acquires an area in the work buffer, the area of process B is inserted between the areas of processes A and C, as shown in Figure 6, and the area of process C is is shifted by the area bone of process B.

Next, an example of the operation when the area of the specified number of bytes cannot be secured in the unused area of the work buffer will be described with reference to FIGS. 6 and 7. When the processing tries to acquire an area in the state shown in Figure 6, it checks whether the specified number of bytes can be secured in the unused area, and if the area cannot be secured with just the unused area, first The area of adjacent processing C is released to expand the unused area. If the amount is still insufficient, this process is repeated to release the area for process B. As a result, when the unused area is expanded until an area of the specified number of bytes is secured, an area for processing is secured as shown in FIG. 7, and its status is reflected in the usage state management table.

As explained above, if there is sufficient unused space in the work buffer, control is performed to secure a new area without erasing the previous data, so there is no need to refer to previously processed data. It is possible to reduce the chances of performing reprocessing when a program occurs and shorten the processing time for the entire program. Note that when re-executing a process for which an area has already been secured in the work buffer, the previous area is released once and then a new area is secured.

The above embodiment is an example in which an area is secured in the work buffer so that the order of processes A to D is not changed in a hierarchical structure, but the area is secured without such limitations depending on the type of process. You may do so. That is, when the area for process C is secured after process A, the area start address for process B in the usage status management table is changed to the area end address for process C instead of the area end address for process A as shown in FIG. If configured to do so, the processing B area is secured below the processing C area.

〔Effect of the invention〕

As explained in detail above, the present invention introduces a usage status management table to manage the area start and end addresses of the work buffer area that stores data for each process. As long as there is sufficient unused space, previous data can be retained without being deleted.

Therefore, the overall processing time can be shortened by reducing the chances of reprocessing occurring, and the work buffer area can be used effectively.

BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1 is a configuration diagram of one embodiment of the present invention, FIG. 2 is a configuration diagram of the usage status management table in FIG. 1, and FIGS.
It is an explanatory diagram for explaining operation of an example of a figure.

1...Work buffer, 2...Usage status management table, 3...Control unit.

Claims (1)

[Claims] In a work buffer sharing method in which an area of one work buffer is used in a plurality of different processes, a usage status management table for managing the usage status of the area of the work buffer for each of the processes, and a usage status management table for managing the usage status of the area of the work buffer for each process; an area securing means for securing an area of a specified size according to a predetermined procedure when there is sufficient unused area in the work buffer by referring to the usage state management table; A work buffer sharing method characterized by comprising an area release means for releasing a used area and expanding an unused area according to a predetermined procedure when there is no unused area.