JPS63292252A - Storage area management device - 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 Object of the Invention [Field of Industrial Application] The present invention relates to a storage area management device that manages an area in a data processing system so that a plurality of requesters can use the storage area.

[Prior Art] Conventionally, such storage area management devices include devices that statically allocate storage areas from the beginning and devices that dynamically allocate storage areas only when required by a request source. The dynamically allocated device is more efficient in terms of utilization.

This dynamic allocation device will be explained below based on FIG. 9. As shown in the figure, the storage area A1 is divided into n blocks A2 of a predetermined size, and each block A
A storage area management table A3 consisting of cells corresponding to numbers 2-1 to A2-n is provided, which allocates the area requested by the requestor in block units to the storage area A1, and also provides a table corresponding to the allocated block. It was configured to write information indicating that the cell has been allocated (for example, a value "1" is written) in the cell in the storage area management table TBL.

[Problems to be Solved by the Invention] However, the conventional technology has the following problems, and further improvements have been desired.

In other words, the area requested by the requester for allocation does not match an integral multiple of one block capacity, for example, if each block capacity is 1
If 0 bytes and the requested amount are 24 bytes, information indicating that the corresponding three cells have been allocated is written to the storage area management table A3, but in reality there are three cells as shown in Figure 10. A 6-byte free area A4 will be created in the second block A2-3. Therefore, if multiple request sources sequentially allocate, free areas A4 in the block will occur everywhere. There was a problem in that the storage area could not be used effectively. Although the above problem can be alleviated by subdividing the storage area blocks, it is not possible to completely solve this problem unless the area requested by the request source matches an integral multiple of the block size. This is not possible, and area management becomes complicated by subdividing blocks.

The present invention has been made in view of the above problems, and an object of the present invention is to provide a storage area management device that can effectively utilize storage areas without complicating area management.

[Means for solving the problem] The storage area management device of the present invention for achieving the above object, as shown in FIG. 1, divides the storage area M1 into blocks M2 of a predetermined size. a first allocation means M that allocates the area requested by the area requestor M3 to the storage area M1 in units of blocks;
4, and a first display means M5 for creating and displaying data indicating the block M2 allocated by the first allocation means M4, the data displayed on the first display means M5 is provided. Free area M6 between blocks 2 that is not filled with the area requested for allocation.
a second display means M7 for creating and displaying data indicating the
The free area M6 is detected based on the data displayed on the second display means M7, and part or all of the area requested for allocation by another area request source M3 is allocated to the free area M.
The gist is that a second allocation means M8 is provided for allocating the data to the second allocation unit M8.

[Operation] The storage area management device of the present invention configured as described above has the following features:
The first allocation means M4 transfers the data requested for allocation from the area requestor M3 to the storage area M1 in the block M2.
The blocks are allocated in units and the allocated blocks are displayed by the first display means M5.
The display means M7 displays the unfilled free space M6 of the area requested by the area requestor in each of the allocated blocks, and the second allocation means M
8, the free area M6 is detected based on the display result of the second display means M7, and part or all of the data requested by another area request source M3 is allocated to the free area M6.

[Example] Hereinafter, a preferred embodiment of the present invention will be described with reference to the drawings.

FIG. 2 is a block diagram showing the configuration of a storage area management device as an embodiment of the present invention. As shown in the figure, the storage area management device includes a data processing device 1 and a storage area 3 as an internal memory. The data processing device 1 is
It fetches and executes instructions one by one, and includes an area requesting unit 5, an area managing unit 7, and the like. The area request unit 5 includes m request sources 11, executes the data processing desired by the user under the control of the data processing device @1, and secures a work area for the data processing device. requests the allocation of an area of a desired size, requests reference to the allocated area, or requests release (return) of the allocated area after use. The area management unit 7 uniformly manages areas requested by the area request unit 5, and includes an allocation processing management unit 13 that manages area allocation in response to the allocation request, and an allocation processing management unit 13 that manages area allocation in response to the reference request. It is composed of a reference processing management section 15 that manages references and updates of the allocated area, and a release processing management section 17 that manages the release of the allocated area in response to the release request.

The storage area 3 includes a storage area allocation area 21 that is divided into n blocks BL of a predetermined size and managed, and a storage area management table TBL1 . Block management table TBL2 and request source management table T
It is composed of a storage area management information area 23 that stores B13 and the like.

As shown in FIG. 3, the storage area management table TBL1 includes a block management table address indicating the storage location of the block management table TBL2, and a request source management table TBL.
3, the request source management table address indicating the storage location of item 3, the number n of blocks in the entire storage area allocation area, the number of completely free blocks in these blocks BL to which no area has been allocated, and the free area size of the entire storage area allocation area. and the size of one block BL. As shown in FIG. 4, the block management table TBL2 stores, corresponding to each block BL, m request source information items consisting of the free area size within the block, the request source Nα, and the allocation relative position within the block. It shows. As shown in FIG. 5, the request source management table TBL3 stores, for each request source, the request source allocation area size, the total number of occupied blocks indicating the number of blocks occupying the entire block, and the allocated blocks. n consisting of NO and the size of the area allocated within that block
block information items.

Next, the allocation processing management routine executed by the allocation processing management section 13 will be explained based on the flowchart of FIG. 6.

The allocation processing management routine is started by specifying the requested capacity ■ from the area requesting unit 5. First, the requested capacity ■ is read (step 100), and the request source management table TBL3 is searched for the free request source Nα. (Step 105).

Next, the requested capacity (hereinafter also referred to as allocated capacity) ■ is compared with the free area size of the storage area management table TBL, and the requested area is allocated to the storage area allocation area 2.
Determine whether it can be assigned to 1 (step 110)
. If it is determined that it is possible, it is then determined in step 120 whether the allocated capacity is larger than O, and if it is determined that V>O, the storage area management table TBL1 is referred to and it is determined whether the allocated capacity is larger than O or not. Determine whether the number of complete free blocks is greater than 0 (step 130).
). If the number of completely free blocks BL is greater than 0,
Referring to the block management table TBL2 shown in FIG. 4, the free block BL is searched for, and the free area size within the block is full to the block size (step 140). Next, the allocated area is allocated to the free block BL. The detected vacant block Nα to be secured
The request source Nα retrieved in step 105 and the relative position of the area to be allocated within the block are set in the request source information item corresponding to the empty block N.
Update the free area size in the block corresponding to α (
Step 150). Next, request source management table TBL
Set the block Nα to be allocated and the size of the area to be allocated to the block information item corresponding to the request source Nα in a, and also update the request source allocated area size and block occupancy number corresponding to the request source N0 (step 160). Next, the storage area management table TBL
The free area size of 1 and the number of free blocks are updated (step 170), then the size VB of 1 block is subtracted from the allocated capacity V (step 180), and the process returns to step 120 again.

On the other hand, if it is determined in step 130 that the number of free blocks is O or less, the block management table TBL shown in FIG.
2, a block BL having even a small amount of free space is detected (step 190 of detecting a block in which the free area size in the block is less than one full block size).

Next, in order to allocate a desired area to the detected free area, the block management table TBL2 and the request source management table TB are created in the same manner as steps 150 and 160.
L3 is updated in steps 200 and 210>, and then the free area size of the storage area management table TBL1 is updated (step 220>). After step 220, the capacity vX of the area allocated in steps 190 to 220 is calculated from the allocated capacity V. After step 230>, the process returns to step 120 again.

On the other hand, if it is determined in step 110 that allocation is not possible, the request source 11 is notified of the fact that allocation is impossible (step 240), and then the process is performed. ETU
The program moves to RN J and ends this routine once. Further, if it is determined in step 120 that the allocated capacity ff1V is less than or equal to O, it is determined that all the requested capacity has been allocated and that the request source N on the management table searched in step 105 is confirmed.
step 250> to notify the request source 11 of α;
Similarly, this routine is temporarily ended.

Next, the reference processing management routine executed by the reference processing management section 15 will be explained based on the flowchart of FIG. 7.

The reference processing management routine is started when the area requesting unit 5 specifies the request source Nα requesting reference or update and the relative position of the data to be referenced or updated in the requested area of the request source. First, the request source Nα and the relative position are read (step 300).
Then, it is determined whether the area indicated by the relative position is within the range of the requested area of the request source (step 310).

If it is determined that it is within the range, then search for which block the area indicated by the relative position corresponds to by sequentially referring to the information items of the corresponding request source block in the request source management table TBL3. Step 320, Step 33
0. Step 340) If the corresponding block BL is found, then block management table TBL2
The allocation relative position of the desired request source is searched from , and it is calculated at which address in the storage area allocation area the relative position specified by the request source is located (step 35
0). After that, the process goes to [RETURNJ] and temporarily ends the process of this routine. On the other hand, if it is determined in step 310 that the area indicated by the relative position is outside the range, the request source 11 is notified of the out-of-area reference in order to stop the reference (step 360), and the processing of this routine is temporarily stopped. finish.

Next, the release processing management routine executed by the release processing management section 17 will be explained based on the flowchart of FIG. 8.

The release processing management routine is started by specifying a request source Nα from the area requesting unit 5 when the allocated area is no longer needed, and first reads the request source Nα (step 400). Next, the internal pointer points to the first block information corresponding to the request source Nα in the request source management table TBL3 (step 410), and the following processing is sequentially performed on the subsequent block information items.

First, the entire corresponding block is transferred to the specified request source 11.
Block management table T8L
Step 43: Refer to the allocation relative position in step 2.
0) If it is determined that the request source 11 is occupied, the request source information item of the corresponding request source 11 in the block management table TBL2 is initialized in step 440. step 450)
, similarly updates the free area size in the corresponding block in the block management table TBL2 (step 460).
On the other hand, if it is determined in step 430 that the specified request source does not occupy the entire corresponding block, the request source information item of the corresponding block in the block management table TBL2 is searched for in step 470. Step 4
80), the request source information item on the right side of FIG. 4 is shifted to the left from the corresponding request source information item to update the relative allocation position (step 490). Next, step 500 rearranges the data in the block of the storage area allocation area in accordance with the request source information item shifted in step 490.
), updates the block free area size corresponding to the corresponding block in the block management table TBL2 (step 510). Step 46O or Step 510
After executing , it points to the next block information item corresponding to the specified request source Nα, and steps 430 to 5
Repeat step 20.

When each block information item related to the request source 11 is processed in steps 430 to 510, it is determined that the block information item is completed (step 420).
), then the free area size and the number of free blocks in the storage area management table TBL1 are updated (step 530).
), and then the request source allocation area size and block occupancy number corresponding to the request source Nα in the request source management table TBL3.

Clear each item such as block information item etc. Step 540
), the processing is then transferred to rRETtlRNJ, and the processing of this routine is temporarily terminated.

The configuration of the storage area management device that is an embodiment of the present invention has been described in detail above.According to the allocation processing management unit of this storage area management device, areas are initially allocated to free blocks BL in order, When the area is exhausted, a block BL having an empty area is searched among the blocks BL to which areas have been allocated, and the requested area is allocated to this empty area. Therefore, even if an area request could not be allocated because there is no free block BL, it can always be allocated if the requested amount v is smaller than the sum of the free areas divided into each block BL. , the storage area 3 can be used effectively. Further, even in a storage area management device having such an effect, reference and release management are not complicated and simple as seen in the reference processing management section 15 and the release processing management section 17.

Note that the storage area management device of the present invention is not limited to the above-mentioned embodiments, and can be applied to, for example, semiconductor disk memories, direct access devices, etc. instead of the internal memory as in the above-mentioned embodiments. .

Effects of the Invention The storage area management device of the present invention, which has been described in detail above, can allocate space requests that could not be allocated due to lack of free blocks by using the free space within each block. This allows you to use storage space effectively. Furthermore, in spite of these advantages, various area management such as allocation management, reference, and release management can be easily performed.

[Brief explanation of drawings]

Figure 1 is a block diagram showing the basic configuration of the present invention, Figure 2 is a block diagram showing the configuration of an embodiment of the present invention, Figure 3 is an explanatory diagram of a storage area management table, and Figure 4 is block management. An explanatory diagram of the table, FIG. 5 is an explanatory diagram of the request source management table, FIG. 6 is a flowchart showing the processing executed by the allocation processing management section, and FIG. 7 is a flowchart showing the processing executed by the reference processing management section. FIG. 8 is a flowchart showing the processing executed by the release processing management unit, FIG. 9 is an explanatory diagram for explaining the prior art, and FIG. 10 is an explanatory diagram for explaining the problems of the prior art. , is. 1... Data processing device 3... Storage area 5... Area request unit 7... Area management unit 13... Allocation processing management unit 21... Storage area allocation area 23... Storage area management Information area BL...block

Claims (1)

[Scope of Claims] A first allocation means for dividing a storage area into blocks of a predetermined size and allocating an area requested by an area requester for allocation in the storage area in block units; and allocation by the first allocation means. a first display means for creating and displaying data indicating the allocated block; and a storage area management device comprising: a first display means for creating and displaying data indicating the allocated block; a second display means for creating and displaying data indicating a free space; and a second display means for detecting the free space based on the data displayed by the second display means, and detecting the free space and displaying one of the spaces requested for allocation by another space request source. A storage area management device comprising: second allocation means for allocating part or all of the data to the free area.