Partition formation method and deletion method, recording medium having program recorded thereon, and information processing device

Description: TECHNICAL FIELD [Detailed description of the invention]

【0001】

[Technical field to which the invention belongs]

The present invention relates to a storage device management system, and more particularly to a system that manages partition creation and deletion of a hard disk device.

【0002】

[Conventional technology]

In storage devices, especially hard disks, partitioning allows one physical hard disk to be used as if it were a separate hard disk. For this reason, a large-capacity hard disk can be divided into multiple partitions to facilitate disk management, switch between multiple OSs for booting, or files that are frequently read and written, and have few changes. It is often used for the purpose of preventing a decrease in processing speed due to the occurrence of so-called fragmentation by recording a system file or the like in a separate partition.

【0003】

Conventionally, when a user changes a partition, the partition is manually added or deleted by using a utility program or the like. That is, when adding a partition, the user determines the position of the partition to be created from the required partition size and the area that can be secured by the hard disk.

【0004】

[Problems to be Solved by the Invention]

By the way, conventionally, the partition is not changed so frequently, and it is limited to, for example, when a hard disk is added or when the operating system is changed.

【0005】

However, due to the large scale of hard disk capacity, the diversity of operating systems, and the need to handle files with various properties, there is a demand to add or delete partitions at any time.

【0006】

In such a case, if partitions are added and deleted in a disorderly manner, the hard disk may be divided into small partitions, which may reduce the utilization efficiency of the hard disk device.

【0007】

An object of the present invention is to provide a technique for improving the utilization efficiency of a storage device.

【0008】

[Means for solving problems]

In order to solve the above problems, the present invention is a partition creation method for creating a partition in a storage device, and the size of the created partition is the size of m to the nth power, where m and n are natural numbers. A partitioning method is provided, which comprises arranging a partition to be aligned with the size of the partition.

【0009】

Further, the present invention is a means for accepting a request for creating a partition having a size of m to the nth power, where m and n are natural numbers, and an area on a storage device capable of creating a partition with the accepted size. Provided is an information processing apparatus including means for creating a partition at an aligned position, and a recording medium on which a program for constructing these means on the information processing apparatus is recorded.

【0010】

BEST MODE FOR CARRYING OUT THE INVENTION

Embodiments of the present invention will be described in detail with reference to the drawings.

【0011】

FIG. 1 is a block diagram showing a configuration of an embodiment of a partition management system according to the present invention. In this figure, the partition management system 100 receives a partition addition request or a partition deletion request from a running program, an operator, etc., and returns the result of the interface unit 101, and the partition addition to the mounted storage device. It includes a partition management execution unit 102 that executes deletion and creates and updates a partition management table, and a partition management table 103. In this embodiment, a hard disk 110 is implemented as an example of a storage device. ing.

【0012】

The partition management system 100 includes a central processing unit (CPU), a main storage device, a reading device that reads data from a portable storage medium such as a CD-ROM or a DVD-ROM, a keyboard, a mouse, and a controller. Information having a general configuration that includes an input device such as a display device, a display device such as a display, and an interface that controls data transmission / reception between the above-mentioned components, and can mount a storage device such as a hard disk inside or outside. It can be configured on a processing unit, such as a personal computer, a server computer, or an entertainment unit.

【0013】

Further, the program for causing the information processing apparatus to execute the processing of the partition management system 100 can be included as, for example, utility software, a hard disk driver, a part of a development library, or the like. These programs can be recorded and distributed on a storage medium such as a CD-ROM or a DVD-ROM. It can also be distributed through a communication line.

【0014】

In this embodiment, a theoretical serial number (LBA: logical block address) starting from 0 is used to specify a sector that is a unit of a recording area in a hard disk. This number allows you to identify any sector on your hard disk. Of course, the present invention is not limited to this, and any sector on the hard disk may be specified by, for example, specifying a cylinder number, a head number, and a sector number. In the following, the theoretical serial number will be referred to as a sector number for convenience.

【0015】

FIG. 2 is a diagram for explaining a partition which is a divided area of the hard disk in this embodiment.

【0016】

Here, in the present invention, a partition created by an operator or a running program or the like and capable of reading and writing data is referred to as a defined (partition), and a storage area or creation in which a partition has not yet been created is referred to. The storage area from which the deleted partition has been deleted shall be referred to as the undefined area. For convenience, an undefined area may be referred to as an undefined partition.

【0017】

In this figure, four areas (110A, 110B, 110C, 110D) are formed on the hard disk 110. Of these, 110A and 110C are predefined partitions that can read and write data. The area 110B sandwiched between 110A and 110C is an undefined area. The area 110D behind 110C is an undefined area and is assumed to be continuous to the end of the hard disk 110. That is, this figure shows a state in which the partition 110A and the partition 110C are created on the hard disk in the initial state.

【0018】

Here, among the undefined areas, an area defined after the undefined area or an undefined area in which another undefined area exists, such as area 110B, is referred to as a "free undefined area". An undefined area whose undefined area is the last area of the hard disk, such as area 110D, is referred to as a "final undefined area".

【0019】

A header portion having a predetermined size is provided at the beginning of each area. In this header part, for example, information indicating that it is the beginning of a partition, a flag for identifying whether the partition (area) is defined or undefined, and the size of the partition are recorded. The size of the partition can be expressed by, for example, the number of sectors and the number of bytes. Alternatively, the size of the partition may be indirectly represented by recording the end sector number.

【0020】

However, the information recorded in the header portion is not limited to these. For example, it may be the first sector number of the partition instead of the information indicating that it is the beginning of the partition. Further, an identifier for identifying a partition, for example, a partition number can be recorded in the header portion. Further, the partition size may be set to 0 when the partition is undefined, for example, without using the above flag as the information for identifying whether the partition is defined or undefined.

【0021】

Next, the operation of the partition management system 100 in this embodiment will be described. The operation of the partition management system 100 is divided into a process of creating a partition management table 103, a process of adding a partition, and a process of deleting a partition.

【0022】

First, the process of creating the partition management table 103 will be described.

【0023】

The partition management table 103 is a table created by the partition management execution unit 102 on the main storage device or the like in order to manage information about the partitions on the hard disk. FIG. 3 is a diagram showing an example of the structure of the partition management table 103.

【0024】

In this figure, the partition management table 103 has an identifier 1031, a starting sector number 1032, a size 1033, and a status 1034.

【0025】

The identifier 1031 is used to identify the partition and is numbered in descending order in this example. Status 1034 is information for identifying whether the area is defined or undefined.

【0026】

The partition management execution unit 102 creates the partition management table 103 when the partition management system 100 is started or when the hard disk device is mounted.

【0027】

Specifically, by referring to the header part recorded on the hard disk 110, the first sector, size, and defined / undefined information of each partition (including the undefined area) are acquired, and the partition management table 103 Record in.

【0028】

In addition, such a management table may be created on the hard disk, for example, in the management area of the hard disk. In this case, the partition management execution unit 102 can manage the partition by referring to this area.

【0029】

Next, the process when adding a partition will be described.

【0030】

In this embodiment, the additional size of the partition is 2 to the nth power of the basic unit. The basic unit can be any size, for example, 1 sector (usually 512 bytes), 1 cluster, 1 Kbyte, 1 Mbyte, 100 Mbyte, 1 Gbyte, etc., but in this embodiment, the basic unit is Described as one sector.

【0031】

Therefore, the additional size of the partition is one of 1, 2, 4, 8, 16, 32, ..., 1024, ... Sector, which is 2 to the nth power of 1 sector. In the following description, if there is no particular confusion, the unit "sector" is omitted and the size is displayed. Further, the additional size is not limited to 2 to the nth power, and can be any natural number to the nth power, for example, 3 to the nth power, 4 to the nth power, and the like.

【0032】

Therefore, even if the partition size that is actually required is 3, for example, the partition size that is additionally requested from this system is 4 (2 to the 1st power <3 2 to the 2nd power), which is the square of 2. ). Similarly, if 1000 is required, 1024 (2 to the 10th power) is the required size. Of course, this judgment may be made by the program on the requesting side, but if the interface unit 101 has a judgment function and, for example, receives a partition addition request of size 5, it is large enough to satisfy it. You may want to add a size 8 partition, which is the minimum additional size of. In this embodiment, for the sake of simplicity, it is assumed that a size of 2 to the nth power is required for this system.

【0033】

Further, in this embodiment, the place where the partition can be arranged, that is, the start position of the partition can be limited to the position (sector number) where the partition size is aligned.

【0034】

Specifically, if the required partition size is 256 (2 to the 8th power) sector, the places where this partition can be placed are the positions where the size is aligned, sector numbers 0, 256, 512. , 768 ... (m times 256) is the starting position. Also, for example, if the size of the partition is 1 which is 2 to the 0th power, this partition can be placed in any sector number.

【0035】

On the premise of the above rules, when the interface unit 101 receives the partition addition request and the additional partition size, it requests the partition management execution unit 102 to execute the partition addition. The processing of the partition management execution unit 102 that receives this request will be described with reference to the flow chart of FIG.

【0036】

First, the partition management execution unit 102 refers to the partition management table 103 to check whether there is undefined free space equal to the requested size (S101).

【0037】

As a result, when a free area exists, a partition is created in the free area with the requested size (S106), and the requester is notified via the interface unit 101 that the partition has been created. In addition, the partition management table 103 is updated based on the arranged location and the creation size, and the header portion of the partition of the hard disk 110 is created.

【0038】

Since the undefined free area of the requested size is always aligned with the requested size by the process described later, it is possible to arrange a partition of the size in this free area.

【0039】

As a result of checking whether there is a free undefined area of the requested size, if there is no free space, there is no free space of 2 m times (2, 4, 6, 8 ...) of the requested size. Check if there is a definition area (S102).

【0040】

As a result, if there is a free undefined area that is 2 m times the requested size, the free undefined area is divided in half until it reaches the requested size, and the new area is divided. Create (S103). Then, when an area of the requested size is created, a partition is created in that area (S106). On the other hand, the newly created other area updates the partition management table 103 as a free undefined area and creates a header part.

【0041】

FIG. 5 is a diagram illustrating an example of processing at this time. This figure is an example when the creation of a partition of size 2 is requested in the state where there is a free undefined area of size 8 in sector number 8 (Fig. 5 (a)).

【0042】

Since the free undefined area of size 8 starting from sector number 8 is 2 × 4 times the required size 2, this area satisfies the condition of 2 m times. First, this area is divided into 1/2. Then, two undefined areas of size 4 are created (Fig. 5 (b)). Then, the undefined area having a young sector number is further divided into 1/2. Then, two free undefined areas of size 2 are created (Fig. 5 (c)).

【0043】

Since this free undefined area is equal to the requested size, a partition is created in the free undefined area of size 2 with a young sector number. Then, the partition management table 103 is updated, and the header is created and updated, using the newly created other area as a free undefined area (Fig. 5 (d)).

【0044】

As a result of checking whether there is a free undefined area that is 2 m times the requested size, if there is no free undefined area that is 2 m times the requested size, it is determined whether the final undefined area is aligned with the requested size. Examine (S104).

【0045】

As a result, if the final undefined area is aligned with the requested size, a partition is created with the requested size from the start position of the final undefined area (S106). Then, the remaining area is set as the final undefined area.

【0046】

If the final undefined area is not aligned to the requested size, create a free undefined area up to the aligned position (S105) and partition the aligned position to the requested size (S106). ).

【0047】

FIG. 6 is a diagram illustrating an example of processing at this time. This example is an example when the final undefined area starts from sector number 512 (Fig. 6 (a)) and a partition of size 1024 is requested. Since size 1024 is not aligned to 512, which is the start position of the final definition area, sector numbers 512 to 1023 are set as free undefined areas, and a partition of size 1024 is created in sector number 1024. Furthermore, the remaining area after sector number 2048 is set as the final undefined area (Fig. 6 (b)). Then, the partition management table 103 is updated, and the header part is created and updated.

【0048】

By creating the partition as described above, the partition can be arranged at the position aligned with the required size.

【0049】

Next, the process of deleting the partition will be described with reference to the flow chart of FIG.

【0050】

When the interface unit 101 of the partition management execution unit 102 receives a deletion request specifying a specific partition from the operator or a program being executed, the interface unit 101 requests the partition management execution unit 102 to execute the partition deletion.

【0051】

The partition to be deleted can be specified, for example, by specifying an identifier such as the start sector number or partition number of the partition. Of course, the present invention is not limited to these methods, and can be specified by information that can be referred to by the partition management execution unit 102 and that can identify the partition to be deleted.

【0052】

First, the partition management execution unit 102 deletes the specified partition and makes the area an undefined area (S201).

【0053】

Then, it is determined whether or not the deleted partition is the last defined partition, that is, the last undefined area is behind the deleted partition (S202).

【0054】

As a result, if it is the last partition, the undefined area generated by the deletion is included in the final undefined area (S203). Furthermore, it is determined whether the area immediately before the deleted partition is a free undefined area (S204), and if it is a free undefined area, that area is also included in the final undefined area (S205).

【0055】

On the other hand, if it is not the last partition, it is determined whether the area immediately before the undefined area is a free undefined area (S206). Then, if it is a free undefined area, when two undefined areas are merged, it is determined whether or not the area is aligned (S207), and if it is aligned, it is concatenated into one. It is an undefined area (S208).

【0056】

In addition, it is determined whether the free undefined area generated by the deletion or the area immediately after the free undefined area generated by the concatenation is the free undefined area (S209). Then, if it is a free undefined area, when two undefined areas are merged, it is determined whether or not the area is aligned (S210), and if it is aligned, it is concatenated into one. It is an undefined area (S211).

【0057】

Then, it reports to the requester via the interface unit 101 that the partition has been deleted. In addition, the header part of each partition and the partition management table 103 are updated to end the partition deletion process.

【0058】

FIG. 8 is a diagram illustrating an example of processing at this time. When partition D is deleted in FIG. 8 (a), the deleted area is the final undefined area after the deleted area. Therefore, as shown in FIG. 8 (b), the deleted area is added to the final undefined area ( S203).

【0059】

In FIG. 8 (c), when the partition D is deleted, if the deleted area is added to the final undefined area, the immediately preceding area is the undefined area F. Therefore, as shown in FIG. 8 (d), this area. Is also added to the final undefined area (S205).

【0060】

In Fig. 8 (e), when deleting partition D, if the total size of the deleted area and the undefined area F immediately before it is aligned, two partitions as shown in Fig. 8 (f). Are concatenated into one undefined region G (S208). On the other hand, if the total size is not aligned, two undefined areas, undefined area D and undefined area F, are generated as a result of deleting partition D, as shown in FIG. 8 (g).

【0061】

In addition, when the partition size is limited to 2 to the nth power, the utilization efficiency of the hard disk is about the case where it is placed only at the position aligned with the partition size (A) and the case where it is placed at an arbitrary position (B). The result of the simulation is shown.

【0062】

The simulation method is to randomly create 50 partitions of 8 sizes of 8M, 16M, 32M, 64M, 128M, 256M, 512M, and 1GB on the hard disk, and show the following (1) to (3). The state of the hard disk after repeating the above process 1000 times with different random number seeds was compared.

【0063】

(1) Delete one partition using random numbers.

【0064】

(2) Use a random number to select one of the above eight sizes and add a partition of that size.

【0065】

(3) The above processes (1) and (2) are repeated 100 times.

【0066】

As a result, the total number of sectors up to the last partition (total number of sectors) and how much free space is included in the total sectors up to the last partition (free / total) are shown in the table below. It became like 1.

【0067】

[table 1]

<img file="JP2002202902A_D0001.tif" />【0068】

From this simulation result, it can be seen that the utilization efficiency of the hard disk is improved by the present invention.

【0069】

[Effect of the invention]

As described above, according to the present invention, it is possible to improve the utilization efficiency of the storage device.

[Simple explanation of drawings]

[Figure 1]

Is a block diagram showing a configuration of an embodiment of the partition management system according to the present invention.

[Figure 2]

Is a diagram for explaining a partition which is a divided area of the hard disk in this embodiment.

[Fig. 3]

Is a diagram showing an example of the structure of the partition management table 103.

[Fig. 4]

Is a flow chart for explaining the process when creating a partition.

[Fig. 5]

Is a diagram for explaining an example of processing when creating a partition.

[Fig. 6]

Is a diagram for explaining the process when creating a partition in the final undefined area.

[Fig. 7]

Is a flow chart for explaining the process when deleting a partition.

[Fig. 8]

Is a diagram for explaining an example of processing when deleting a partition.

[Explanation of symbols]

100 ... partition management system 101 ... Interface section 102 ... Partition management execution unit 103 ... Partition management table