JP3980729B2 - Storage area management system and medium storing storage area management program - Google Patents

Description

[0001]
BACKGROUND OF THE INVENTION
The present invention relates to a storage area management system that allocates a part of an empty storage area as necessary in response to acquisition requests from a plurality of programs, and a medium on which a storage area management program is recorded.
In the storage area management system, a part of a storage area that is shared by a plurality of programs and divided into a plurality of partitions is allocated as necessary to acquisition requests from the plurality of programs.
[0002]
In one partition where the storage area is divided, only a request for one attribute is accepted, and for a request for a storage area with a different attribute, an acquisition request must be made for a different partition. There wasn't.
In current computer systems where processing applications are diversified, the processing of attributes required for each system changes, and the required attributes increase. Development of a storage area management system that can cope with such diversification of required attributes is desired.
[0003]
[Prior art]
As a storage area of the conventional storage area management system, for example, there is a storage area as shown in FIG.
In FIG. 8A, the storage area 101 is composed of a plurality of partitions 102. That is, the storage area 101 is divided into a plurality of sections 102 due to differences in attributes. Attributes are determined as attribute 1 to attribute n by the address.
[0004]
Each partition 102 has an attribute, and a partition 102 having only the same attribute from a plurality of programs can be obtained for a certain partition 102. In other words, each divided partition 102 of the storage area 101 can only accept a request for a certain attribute. In response to an acquisition request for a storage area 101 having different attributes, an acquisition request must be made for a different partition 102.
[0005]
FIG. 9 is a flowchart for explaining a conventional free block allocation process. In FIG. 9, in step S101, an empty block queue in one partition 102 having the storage area 101 is searched.
In other words, conventionally, when a storage area 101 acquisition request is issued from a program to a storage area 101 of a partition 102 shared by a plurality of programs, only an acquisition request for only one predetermined attribute is permitted. In response to a request for that attribute, the queue of free blocks is searched.
[0006]
Next, in step S102, it is determined whether or not the process of allocating the last free block in one partition 102 is completed. When the process is completed, the process proceeds to step S105, and when the process is not completed, the process proceeds to step S103. Proceed to
In step S103, it is determined whether there is an empty block size that satisfies the required size of the empty block requested by the program. If there is no empty block satisfying the requested size, the process returns to step S101 to search for the next empty block. If there is an empty block size satisfying the requested size, the process proceeds to step S104. In step S104, the process returns to step S101 with the empty block satisfying the requested size as an allocation target.
[0007]
In step S101, the empty block queue is searched, and when the processing of the last empty block is completed in step S102, the process proceeds to step S105, and the empty block with the smallest size among the empty blocks to be allocated in step S105. Allocate a block.
[0008]
[Problems to be solved by the invention]
However, in the conventional storage area management system, only one request for one attribute can be accepted in one section of the storage area divided. In other words, for storage area acquisition requests with different attributes, acquisition requests must be made for different partitions. Therefore, when a new attribute is to be added, it is necessary to consider the determination of the partition size by subdividing the partition more than the current state as described above as necessary.
[0009]
That is, as shown in FIG. 8B, when a new attribute is added, for example, one partition 102 is divided into two, the partition 102a has a certain attribute, and the partition 102b The storage area 101 has various attributes. In this case, the size of the partition 102a and the size of the partition 102b obtained by dividing the partition 102 into two must be determined.
[0010]
However, in today's computer systems with diversified processing applications, the types of required attributes will change from system to system, and depending on how the partition size is estimated, there is a possibility that area shortages will concentrate on a certain partition. For this reason, if the partitions are subdivided more than necessary, it becomes difficult to facilitate management of the storage area, and there arises a problem that effective storage area management is not performed.
[0011]
The present invention has been made to solve the above-described conventional problems, and requests for a plurality of attributes in one partition of a storage area while maintaining the current number of storage areas. It is an object of the present invention to provide a storage area management system and a medium on which a storage area management program is recorded.
[0012]
[Means for Solving the Problems]
  In order to achieve this object, the present invention is configured as shown in FIG. The invention of claim 1 is a storage area management system having a storage area shared by a plurality of programs and divided into a plurality of partitions, and allocating a part of the storage area in response to the acquisition request for the program. When an acquisition request is issued from the program for a storage area of a certain partition, search means 10A for searching a queue of free blocks;Free blocks searched by the search meansWhen an empty block size determination unit 10B that determines whether there is an empty block size that satisfies the size requested by the program and an attribute is specified by the programAn area attribute of an empty block determined to satisfy the requested size by the empty block size determining meansRequested attributesMatch withAttribute determination processing means 10C;The free block size determination means determines that the required size is satisfied andThe free block area attribute isDesignated by the programMatches the attributeThe attribute determination processing means determines thatAnd allocating means 10D for allocating the empty block as an allocation target.
[0013]
    According to the second aspect of the present invention, when the free block size satisfies the required size of the program and no attribute is specified, the free block is stored regardless of the attribute of the free block area attribute. Assign as an assignment target. The invention of claim 3Each of the sections is configured to include a plurality of pages having a fixed size, and at least one page is attributeless with no blocks in use as a whole,SaidattributeThe determination processing means 10CIt was determined by the free block size determination means that the required size is satisfied.Address setting means 10E for setting the highest address of the empty block, and the area attribute of the page set by the highest addressDesignated by the programFirst attribute determination means 10F for determining whether the attribute matches,When the first attribute determination means determines that the page matches the attribute specified by the program, the determination target address is subtracted from the highest address by the size requested by the program. When it is determined that the attribute does not match between the subtracting means and the attribute determining means, the highest address is as much as the requested size requested by the program.Decision target address changing means 10GConsists of,The assigning means includes
  The requested size requested by the program by the address changing unit when the second attribute determining unit determines that the determination address portion subtracted by the subtracting unit matches the attribute specified by the program When the value is rounded down, the free block is assignedA storage area management system.
[0014]
  The invention of claim 4 has a storage area shared by a plurality of programs and divided into a plurality of partitions, and a part of the storage area is allocated to the acquisition request of the programComputer-readable memory that stores the programIn the medium,
  On the computer,
  Search that searches the queue of free blocks when an acquisition request is issued by the program to a storage area of a certain partitionStepWhen,In the free block searched in the search stepEmpty block size determination for determining whether there is an empty block size that satisfies the size requested by the programStepWhen the attribute is specified by the programDetermining whether the free block area attribute determined to satisfy the requested size in the free block size determining step matches the requested attributeAttribute determination processAnd determining that the required size is satisfied by the free block size determining meansThe area attribute of the free block isWhen the attribute determination processing step determines that the attribute matches the attribute specified by the programAllocation that allocates the free block as an allocation targetAnd a program for executing the steps.
[0015]
  According to the invention of claim 5, when the free block size satisfies the required size of the program and no attribute is specified, the free block is stored regardless of the attribute of the free block area attribute. Assign as an assignment target. The invention of claim 6Each of the sections is configured to include a plurality of pages having a predetermined size, and at least one page is attributeless with no blocks in use for the whole,SaidattributeDetermination processStepIsIt was determined that the requested size was satisfied by the free block size determination step.Address setting to set the highest address of empty blocksStepAnd the area attribute of the page set with the highest address isDesignated by the programFirst attribute determination that determines whether the attribute matchesStepWhen,Subtraction for subtracting the determination target address from the highest address by the size requested by the program when the first attribute determination means determines that the page matches the attribute specified by the program Step and the attribute determination step, when it is determined that the attributes do not match, the highest address is requested by the size requested by the program.It consists of a judgment target address change step to be rounded down,
  The assigning step includes
  When the second attribute determining means determines that the determination address portion subtracted in the subtracting step matches the attribute specified by the program, or the requested size requested by the program in the address changing step Allocate target free block when rounded down by.
[0016]
According to the present invention having such a configuration, it becomes possible to receive a mixture of acquisition requests for storage areas having different attributes in one partition without further subdividing the storage area partition. Compared to when the partition is subdivided, flexible storage area management can be realized even for various different attribute requirements, and the storage area can be used effectively.
[0017]
For programs that are not aware of attributes, the free blocks that satisfy the required size are unconditionally targeted for allocation, so compared with the case of selecting and assigning free blocks with no attributes. There is an effect of suppressing fragmentation as much as possible, and it is possible to reduce an area acquisition failure due to a lack of a storage area.
[0018]
DETAILED DESCRIPTION OF THE INVENTION
FIG. 2 is a block diagram showing an embodiment of the present invention.
In FIG. 2, 1 is a CPU, and a terminal 2, a disk device 3, and a main storage device 4 are connected to the CPU 1. The disk device 3 stores data input from the terminal 2. The data stored in the disk device 3 is expanded in the virtual storage device 5 in the main storage device 4. The data expanded in the virtual storage device 5 is displayed on the terminal 2 by referring to the address of the virtual storage device 5.
[0019]
The virtual storage device 5 includes, for example, a system program storage area 6, a user program storage area 7, a storage area management program storage area 8, a storage area 9, and the like. The system program storage area 6 stores system programs. The system program requests area acquisition for one partition of the storage area 9. A part of the storage area 9 is allocated to the acquisition request from this program as necessary.
[0020]
A plurality of programs are stored in the user program storage area 8, and this program requests area acquisition to one partition of the storage area 9. A part of the storage area 9 is allocated to the acquisition request from this program as necessary. A storage area management program 10 is stored in the storage area management program storage area 8.
The storage area management program 10 performs processing for allocating free blocks according to a plurality of attributes requested by a program that requires the storage area 9. Therefore, the storage area management program 10 includes a search unit 10A as a search unit, a free block measurement unit 10B as a free block size determination unit, an attribute determination processing unit 10C as an attribute determination processing unit, and an allocation unit 10D as an allocation unit. Have
[0021]
When an acquisition request is issued from a program stored in the program storage area 7 used for a storage area of one partition or a program stored in the system program storage area 6, the retrieval unit 10A sets a queue of empty blocks. Search for.
The free block size determination unit 10B determines whether there is a free block size that satisfies the size requested by the program.
[0022]
The attribute determination processing unit 10C determines whether the area attribute of the free block matches the requested attribute when the attribute is specified by the program.
The allocation unit 10D allocates the empty block as an allocation target when the area attribute of the empty block matches the attribute requested by the program.
The attribute determination processing unit 10C includes an address setting unit 10E as an address setting unit, a first attribute determination unit 10F as a first attribute determination unit, a determination target address change unit 10G as a determination target address change unit, and a subtraction. A subtracting unit 10H serving as a means, and a second attribute determining unit 10I serving as a second attribute determining unit serving as a second attribute determining unit.
[0023]
The address setting unit 10E sets the highest address of the empty block requested by the program.
The first attribute determination unit 10F determines whether the area attribute of the page set with the highest address matches the requested attribute.
The determination target address changing unit 10G rounds down the determination target address in units of pages when they do not match.
[0024]
The subtraction unit 10H subtracts the determination target address by the required size.
The second attribute determination processing unit 10I determines whether the requested attribute matches the attribute of the page to which the subtracted address belongs.
The storage area 9 is divided into a plurality of partitions shared by a plurality of programs.
[0025]
FIG. 3 is a diagram showing a configuration example of the storage area 9.
In FIG. 3, the storage area 9 is composed of a plurality of partitions 11, and each partition 11 is composed of a plurality of pages 12. In other words, the storage area 9 is provided with a unit having a certain size of page 12, and the attribute is determined for each page when an acquisition request is issued from the program to the storage area 9.
[0026]
Conventionally, one partition of the storage area could not accept a request for a certain attribute, but it can respond to requests for multiple attributes by using the page 12 of the storage area 9 of this embodiment. To be able to.
FIG. 4 is a diagram showing management of a section 11 of the storage area 9.
A section 11 of the storage area 9 is initially managed by one free block. When an area acquisition request is issued from a certain program to one partition 11 of the storage area 9, a used block is configured for the first time according to the requested size. By repeating acquisition and cancellation of the storage area 9, empty blocks and in-use blocks as shown in FIG. 4 are mixed.
[0027]
This partition 11 is composed of page 1, page 2, page 3, page 4, page 5, page 6, and page 1 and page 2 occupied by the first in-use block 13 are attribute 1 and second usage. The page 3 occupied by the middle block 14 is already given the attribute 2, and the pages 5 and 6 occupied by the third busy block 15 are already given the attribute. These attributes 1 to 3 are determined by the address of the storage area 9, for example.
[0028]
In the case of page 4, if there is no block in use for all of one page, the attribute for page 4 is not given, it is attributeless, and it can be assigned to any attribute request It is. The first empty block 16 exists on page 2 with attribute 1 and page 3 with attribute 2. The second empty block 17 exists on page 3 with attribute 2, page 4 with no attribute, and page 5 with attribute 3. The third empty block 18 exists on the page 6 with the attribute 3.
[0029]
When there is an acquisition request for the storage area 9 of a partition 11 in the state of the storage area 9 as shown in FIG. 4, the empty block queue is searched to find a block that satisfies the requested size. When a free block satisfying the requested size is found, a determination is made regarding the attribute to which the free block belongs.
FIG. 5 is an explanatory diagram for explaining an attribute determination method.
[0030]
The attribute determination for the empty block is performed on the high address side as the first stage and on the low address side as the second stage.
In FIGS. 5A to 5D, 19 indicates the required size of the area requested by the program. Reference numeral 20 denotes an empty block. The empty block 20 includes, for example, a part of the page 21, one page of the page 22, and a part of the page 23. Reference numerals 24 and 25 denote page boundaries. The size of the empty block 20 satisfies the required size 19. In the first stage, the attribute is determined from the higher address side of the empty block 20, and the attribute of the page 21 to which the highest address 26 of the empty block 20 belongs is determined as shown in FIG. When the attribute requested by the program and the area attribute of the page 21 match, as shown in FIG. 5B, the page to which the address 27 to which the request size 19 is lowered from the maximum address 26 is assigned as the second stage. The attribute is determined for 22.
[0031]
When the area attribute of the page 22 matches the attribute requested by the program, the free block 20 is assigned. When the attribute of the page 22 and the request attribute do not match, the empty block 20 is excluded from allocation and another empty block is searched.
As shown in FIG. 5A, when the area attribute of the page 21 is determined and the attribute of the page 21 does not match the attribute requested by the program, the target address is shown in FIG. Is regarded as the highest address 26. Since the page to which the highest address 26 belongs is one page and has no attribute, no attribute is determined.
[0032]
Next, as a second stage, as shown in FIG. 5D, the attribute of the page 23 to which the address 27 to which the requested size 19 is lowered from the highest address 26 is determined.
When the area attribute of this page 23 matches the request attribute, this free block 20 is set as an allocation target. When the area attribute of the page 23 and the request attribute do not match, the empty block 20 is searched for other empty blocks as out of allocation targets.
[0033]
Next, the operation will be described.
FIG. 6 is a flowchart for explaining the operation of allocating free blocks.
In FIG. 6, when a new free block acquisition request is issued from the program in step S11, first, a free block queue is searched.
Next, in step S12, it is determined whether or not the last empty block has been processed. When the process is ended, the process proceeds to step S16. When the process is not ended, the process proceeds to step S13. When all the empty blocks are not searched, the sizes of the empty blocks are compared. That is, in step S13, it is determined whether there is an empty block that satisfies the requested size requested by the program.
[0034]
If there is no free block satisfying the required size, the process returns to step S11 to search for the next free block. If there is a free block having a size satisfying the required size, the attribute is specified by the program in step S14. It is determined whether or not. When the attribute is specified, the process proceeds to the attribute determination process shown in FIG. 7, and when the attribute is not specified, the process proceeds to step S15.
[0035]
That is, when an attribute is specified, an attribute determination process is performed, and an allocation determination process for an empty block having an appropriate attribute is performed as shown in FIG. For a program that is not aware of the attribute, at step S15, the empty block is unconditionally selected as an allocation candidate at this point, and the process returns to the search process for the next empty block (S11). Return). The purpose of unconditionally making a free block an allocation candidate for a program that is not aware of attributes is to suppress the occurrence of fragmentation as much as possible.
[0036]
In step S12, the above operation is performed up to the last empty block, and in step S16, the smallest empty block is selected from among the empty blocks that are candidates for allocation, and the selected empty block is selected for the requested program. Assign.
FIG. 7 is a flowchart for explaining attribute determination processing.
[0037]
If the attribute is specified in step S14 of FIG. 6, the attribute determination process shown in FIG. 7 is performed to determine whether the empty block is to be assigned.
In the attribute determination process, first, in step S21, the highest address of an empty block is obtained. For example, as shown in FIG. 5A, the highest address 26 of the empty block 20 is obtained.
[0038]
In step S22, it is determined whether the attribute of the page matches the requested attribute.
As shown in FIG. 5A, it is determined whether the attribute of the page 21 to which the highest address 26 belongs matches the attribute requested by the program. If the attributes match, the process proceeds to step S24, and if the attributes do not match, the process proceeds to step S23.
[0039]
In step S23, the determination target address is rounded down in units of pages. For example, as shown in FIG. 5C, the page boundary 24 between the page 21 and the page 22 is regarded as the highest address 26 of the empty block 20. Since the page 22 to which the highest address 26 belongs is one page and has no attribute, the attribute is not determined.
In step S24, the determination target address is subtracted by the required size. For example, as shown in FIG. 5B, the request size 19 is subtracted from the highest address 26 of the empty block 20 to obtain the address 27. Further, as shown in FIG. 5D, the address 27 is obtained by subtracting the requested size 19 from the address 26 regarded as the highest address of the empty block 20.
[0040]
In step S25, the attribute on the low address side is determined. That is, it is determined whether the attribute of the page matches the requested attribute. For example, as shown in FIG. 5B, it is determined whether or not the area attribute of the page 22 to which the address 27 to which the requested size of 19 minutes is subtracted matches the requested attribute. Further, as shown in FIG. 5D, it is determined whether or not the attribute of the page 23 included in the address 27 obtained by subtracting the requested size by 19 matches the requested attribute.
[0041]
If the attribute of the page to which the low address belongs matches the requested attribute, the empty block is recognized as a candidate for allocation in step S26, and the process returns to step S11 shown in FIG. 6 to search for the next empty block. . If it does not match the requested attribute, the empty block is not a candidate for allocation, and the process returns to step S11 shown in FIG. 6 to continue searching for the next empty block.
[0042]
In the present embodiment, it is possible to respond to requests for a plurality of attributes in one partition 11 of the storage area 9 while maintaining the current number of partitions in the storage area 9, and to effectively use the storage area 9. Can do.
Further, when no attribute is specified, since the empty block is unconditionally assigned, fragmentation can be suppressed as compared with the case of selecting and assigning an empty block having no attribute.
[0043]
【The invention's effect】
As described above, according to the present invention, since it is possible to accept a plurality of storage area acquisition requests having different attributes in one partition without further subdividing the storage area partition, Compared to the subdivision, it is possible to realize flexible storage area management even for various different attribute requests, and the storage area can be used effectively.
[0044]
For programs that are not aware of attributes, the free blocks that satisfy the required size are unconditionally targeted for allocation, so compared with the case of selecting and assigning free blocks with no attributes. There is an effect of suppressing fragmentation as much as possible, and it is possible to reduce an area acquisition failure due to a lack of a storage area.
[Brief description of the drawings]
FIG. 1 illustrates the principle of the present invention
FIG. 2 is a block diagram showing an embodiment of the present invention.
FIG. 3 is a diagram showing a configuration example of a storage area
FIG. 4 is an explanatory diagram illustrating management for one partition
FIG. 5 is an explanatory diagram of an attribute determination method
FIG. 6 is a flowchart for explaining free block allocation;
FIG. 7 is a flowchart for explaining attribute determination processing;
FIG. 8 is a configuration diagram of a conventional storage area.
FIG. 9 is a flowchart for explaining a conventional operation.
[Explanation of symbols]
1: CPU
2: Terminal
3: Disk unit
4: Main memory
5: Virtual storage device
6: System program storage area
7: User program storage area
8: Storage area management program storage area
9: Storage area
10: Storage area management program
10A: Search unit (search means)
10B: free block size determination unit (free block size determination means)
10C: attribute determination processing unit (attribute determination processing means)
10D: Allocation unit (allocation means)
10E: Address setting unit (address setting means)
10F: 1st attribute determination part (1st attribute determination means)
10G: Determination target address changing unit (determination target address changing means)
10H: Subtraction unit (subtraction means)
10I: second attribute determination unit (love 2 attribute determination means)
11: Section
12, 21-23: Page
13 to 15: first to third in-use blocks
16-18: First to third empty blocks
19: Requested size
20: Empty block
24, 25: Page boundary
26: Highest address
27: Address

Claims (6)

In a storage area management system having a storage area shared by a plurality of programs and divided into a plurality of partitions, and assigning a part of the storage area to the acquisition request for the program,
Search means for searching a queue of free blocks when an acquisition request is issued from the program to a storage area of a certain partition;
Empty block size determination means for determining whether there is an empty block size that satisfies the size requested by the program in the empty blocks searched by the search means ;
When the attribute is specified by the program, attribute determination processing means for performing a match determination between the area attribute of the empty block determined to satisfy the requested size by the empty block size determining means and the requested attribute ;
The free come to have been determined by said attribute determining processing means area attribute of the free blocks together is determined to satisfy the requested size matches the attribute specification is made by the program by the free block size determining means An allocation means for allocating blocks as allocation targets;
A storage area management system comprising: The storage area management system according to claim 1,
If the attribute is not specified when the free block size satisfies the required size of the program, the free block is allocated as an allocation target regardless of the attribute of the free block area attribute. A storage area management system. The storage area management system according to claim 1,
Each of the sections is configured to include a plurality of pages having a certain size, and at least intermediate pages are attributeless with no blocks in use as a whole.
The attribute determination processing means includes
Address setting means for setting the highest address of the empty block determined to satisfy the required size by the empty block size determining means;
First attribute determination means for determining whether the region attribute of the page set at the highest address matches the attribute specified by the program;
When the first attribute determining means determines that the page matches the attribute specified by the program, the determination target is minimum by subtracting the size requested by the program from the highest address. Subtraction means for obtaining an address ;
Said can and determines that the attribute does not match with the first attribute determining means is composed of a determination target maximum address changing means devalue the highest address of the empty block to the highest address of the next page,
The assigning means includes
When the second attribute determining unit determines that the determination target minimum address portion subtracted by the subtracting unit matches the attribute specified by the program, or the highest address is changed to the determination target highest address When the means is rounded down to the highest address of the next page, the address portion matches the attribute specified by the program in the first attribute determination means, and the determination target minimum address portion obtained by the subtraction means is specified by the program. A storage area management system characterized in that, when the second attribute determination means determines that the attribute matches the attribute being assigned, the free block is targeted for allocation . A computer-readable storage medium having a storage area shared by a plurality of programs and divided into a plurality of partitions, and storing a program for allocating a part of the storage area in response to the acquisition request for the program,
On the computer,
A retrieval step of retrieving a queue of free blocks when an acquisition request is issued from the program to a storage area of a certain partition;
An empty block size determination step for determining whether an empty block size satisfying the size requested by the program exists in the empty block searched in the search step;
When an attribute is specified by the program, an attribute determination processing step of performing a match determination between an area attribute of a free block determined to satisfy a requested size by the free block size determination step and a requested attribute;
When the free block size determining step determines that the requested size is satisfied and the free block size region attribute matches the attribute specified by the program, the free space size is determined. An allocation step for allocating blocks as allocation targets;
The computer-readable recording medium provided with the program for performing this. The recording medium of claim 4, wherein,
If the attribute is not specified when the free block size satisfies the required size of the program, the free block is allocated as an allocation target regardless of the attribute of the free block area attribute. recording medium body, characterized. The recording medium according to claim 4, wherein
Each of the sections is configured to include a plurality of pages having a certain size, and at least intermediate pages are attributeless with no blocks in use as a whole.
The attribute determination processing step includes:
An address setting step of setting the maximum address of a free block is determined to satisfy the required size by the free block size determining step,
A first attribute determination step for determining whether or not the region attribute of the page set at the highest address matches the attribute specified by the program;
If the is the page in the first attribute determination step it is determined that they match with the attribute specification is made by the program, by subtracting previous SL size of requested by the program from the highest address judgment target A subtraction step to obtain a minimum address ;
The can and attributes in a first attribute determination step determines that no match is composed of the determination target maximum address changing step devalue the highest address of the empty block to the highest address of the next page,
The assigning step includes
When it is determined in the second attribute determination step that the determination target minimum address portion subtracted in the subtraction step matches the attribute specified by the program, or the highest address is changed to the determination target highest address When the step is rounded down to the highest address of the next page, the address portion matches the attribute specified by the program in the first attribute determination step, and the determination target minimum address portion obtained in the subtraction step is specified by the program. A recording medium characterized in that, when it is determined in the second attribute determination step that the attribute matches the attribute being assigned, the empty block is targeted for allocation .

Images