METHOD AND APPARATUS FOR ALLOCATING DISC SPACE FOR RECORDING FILES

Abstract

A method and apparatus for allocating disc space for recording files, the method including: detecting one or more first sets, each comprising one or more empty sections of the disc that are larger than a predetermined reference value; detecting one or more second sets, each comprising one or more empty sections that are equal to or larger than a size of the data when combined; and allocating, to the data, an optimum set that results in a shortest seek time from a predetermined reference point. Accordingly, it is possible to effectively allocate empty disc space in consideration of both the distances of empty disc sections to a reference point and seek time, thus reducing the time taken to seek target data compared to methods of allocating disc space that only consider the distances of empty disc sections to a reference point.

Description

BRIEF DESCRIPTION OF THE DRAWINGS

These and/or other aspects and advantages of the invention will become apparent and more readily appreciated from the following description of the embodiments, taken in conjunction with the accompanying drawings of which:

FIG. 1 is a diagram explaining a conventional method of allocating empty disc space;

FIG. 2 is a flowchart illustrating a method of allocating disc space according to an embodiment of the present invention;

FIG. 3 is a flowchart illustrating an embodiment of the execution of a first algorithm;

FIG. 4 is a flowchart illustrating an embodiment of the execution of a second algorithm;

FIG. 5 is a block diagram of an apparatus for allocating disc space according to an embodiment of the present invention;

FIG. 6 is a diagram explaining a method of allocating disc space according to an embodiment of the present invention;

FIG. 7 is a diagram explaining a method of allocating disc space according to another embodiment of the present invention;

FIG. 8 is a diagram explaining a method of allocating disc space according to another embodiment of the present invention; and

FIG. 9 is a diagram explaining a method of allocating disc space according to another embodiment of the present invention.

DETAILED DESCRIPTION OF THE EMBODIMENTS

Reference will now be made in detail to the present embodiments of the present invention, examples of which are illustrated in the accompanying drawings, wherein like reference numerals refer to the like elements throughout. The embodiments are described below in order to explain the present invention by referring to the figures.

FIG. 2 is a flowchart illustrating a method of allocating disc space according to an embodiment of the present invention. Referring to FIG. 2, in operation 210, a first algorithm is executed. The first algorithm is a method of allocating empty sections larger than a predetermined size within a predetermined distance from a reference point. Here, a section indicates one block or a plurality of consecutive blocks. The first algorithm will be described in further detail with reference to FIG. 3.

In operation 220, it is determined whether all sufficient disc space to store target data has been allocated. In operation 230, if it is determined in operation 220 that not all of the sufficient disc space to store the target data has been allocated, then a second algorithm is executed. The second algorithm is a method of allocating empty sections in decreasing order of size, and will be described later in further detail with reference to FIG. 4. If it is determined in operation 220 that space allocation is complete, the method ends.

In operation 240, it is determined whether the sufficient disc space to store the target data has all been allocated. In operation 250, if it is determined in operation 240 that not all the sufficient disc space to store the target data has been allocated, it is determined whether there is empty disc space remaining unallocated. In operation 260, if it is determined in operation 250 that there is empty disc space left unallocated, a new reference point and a new target data size are set, thereby generating a new input value for the re-execution of the first algorithm. Then, the first and second algorithms are alternately executed until the entire target data is covered or until no empty disc space remains unallocated. If it is determined in operation 240 that the space allocation is complete or if it is determined in operation 250 that no empty space remains, the method ends.

FIG. 3 is a flowchart illustrating an embodiment of the execution of the first algorithm (i.e., operation 210 illustrated in FIG. 2). In general, most file systems manage metadata regarding empty disc space. For example, XFS manages empty disc space by aligning and managing empty sections of a disc according to the locations and sizes of the empty sections using a B+ tree. According to the shown embodiment, metadata L_i (where i is an integer within a predefined range) is used. Here, L_i indicates a set including one or more empty sections that are larger than the size of 21 blocks combined. According to an aspect of the present invention, L_i is generated, not for all integer values, but for only certain integer values that fall within the predefined range. According to the present embodiment, L_i is generated only for the integer values that satisfy the following equation: i₁≦i≦i₂.

Referring to FIG. 3, in operation 310, L_i is generated. The generation of L_i involves determining i₁ and i₂ which set the range of i, i.e., determining a minimum size of empty sections to which target data is allocated during the execution of the first algorithm. For example, i₁ and i₂ may be determined so that i₂=min(N,]log₂(req_len)[) and that i₁=max([log₂(req_len)]−C, 0), wherein req_len indicates the size of the target data; C is a constant; N=[log₂(V/B)]; V indicates the storage capacity of an entire disc; B indicates the size of blocks of a file system;][is a mathematical operator that raises a value to the closest integer greater than the original value; and [ ] is a mathematical operator that lowers a value to the closest integer smaller than the original value. A maximum i value is determined by the target data size req_len, and a minimum i value is determined by the constant C. The constant C can be chosen by experimentation in order to obtain an optimum disc space allocation.

In operation 320, W_i, Z_i, and M_i are determined. W_i is a set including a predefined number of empty sections that are chosen from among a plurality of empty sections included in L_i. In detail, W_i comprises u empty sections I₁, I₂, I₃, . . . , and I_u that are on the left side of a reference point of L_i, and v empty sections r₁, r₂, r₃, . . . , and r_v on the right side of the reference point That is, according to an aspect of the present invention, the seek range is limited by imposing conditions for u and v, as it is uneconomical to seek through all the empty sections belonging to L_i for all the integer values within the predetermined range. The conditions for u are as follows: (1) u≦]req_len/2^I[; and (2) I(I₁)+I(I₂)+ . . . I(I_u)≧req_len and I(I₁)+I(I₂)+ . . . I(I_u−1)<req_len, or I(I₁)+I(I₂)+ . . . I(I_u)≧req_len. The conditions for v are as follows: (1) v≦]req_len/2ⁱ[; and (2) I(r₁)+I(r₂)+ . . . I(r_v)≧req_len and I(r₁)+I(r₂)+ . . . I(r_v−1)≧req_len, or I(r₁)+I(r₂)+ . . . I(r_v)<req_len. Here, I(x) is a function indicating the size of an empty section x.

In short, W_i comprises a minimum number of empty sections that are larger than the size of the target data and are on the left side of the reference point of L_i (the u empty sections I₁, I₂, I₃, . . . , I_u), and a minimum number of empty sections that are larger than the size of the target data and are on the right side of the reference point of L_i (the v empty sections r₁, r₂, r₃, . . . , r_v). Here, I_k+1 is more distant than I_k from the reference point of L_i. According to an aspect of the present invention, u and v may be determined so that the collective size of the u empty sections I₁, I₂, I₃, . . . , I_u and the collective size of the v empty sections r₁, r₂, r₃, . . . , r_v may each be smaller than the size of the target data. In other words, since the first algorithm aims at securing empty space larger than the size of the target data and then allocating the secured empty space to the target data, it is acceptable that the collective size of the u empty sections I₁, I₂, I₃, . . . , I_u and the collective size of the v empty sections r₁, r₂, r₃, . . . , r_v are each smaller than the size of the target data, as long as the collective size of all of the empty sections included in W_i (the u empty sections I₁, I₂, I₃, . . . , I_u and the v empty sections r₁, r₂, r₃, . . . , r_v combined) is larger than the size of the target data.

Z_i is a set including a number of sets of w consecutive empty sections z_i1, z_i2, . . . , z_iw that are detected from among the empty sections included in W_i. As described above, W_i includes u+v empty sections. Z_i is a set of sets that can be made up of w consecutive empty sections detected from among the u+v empty sections. Here, w is a minimum value for securing empty space larger than the size of the target data. In other words, I(z_i1)+I(z_i2)+ . . . +I(z_iw)≧req_len and, I(z_i1)+I(z_i2)+ . . . +I(z_i(w−1))≧req_len.

M_i is one of the sets of Z_i that can result in a shortest seek time. In detail, Z_i includes one or more sets as described above. M_i is determined as the set included in Z_i that results in the shortest seek time. In other words, M_i is an optimum set that is made up of the empty sections included in W_i for allocating the target data.

In operation 330, an optimum empty section set min(M_i) that can result in the shortest seek time is detected from among a plurality of optimum empty sections M_i obtained in operation 320. In operation 340, it is determined whether the optimum empty section set min(M_i) exists. In operation 350, if it is determined in operation 340 that the optimum empty section set min(M_i) exists, empty sections belonging to the optimum empty section set min(M_i) are allocated to the target data. However, if it is determined in operation 340 that the optimum empty section set min(M_i) does not exist, then the execution of the first algorithm is terminated, and the execution of the second algorithm begins in operation 230.

FIG. 4 is a flowchart illustrating an embodiment of the execution of the second algorithm (i.e., operation 230 illustrated in FIG. 2). Referring to FIG. 4, in operation 410, a search for an empty section that is larger than the size of the target data is performed within a predetermined disc area. Here, the predetermined disc area may be restricted to a predetermined distance of a reference point. In operation 420, it is determined whether the search performed in operation 410 has succeeded. In operation 470, if it is determined in operation 420 that the search performed in operation 410 has succeeded, an empty section that is detected by the search is allocated to the target data. If more than one empty section is detected by the search, then whichever of the detected empty section is closer to the reference point may be allocated to the target data, thereby reducing a seek time.

In operation 430, if there is no empty section within the predetermined area that is larger than the size of the target data (operations 410 and 420), it is determined whether an empty section larger than the size of the target data remains outside of the predetermined disc area. In operation 470, if an empty section larger than the size of the target data remains outside the predetermined disc area (operation 430), then the corresponding empty section may be allocated to the target data in operation 470. If more than one empty section larger than the size of the target data is detected outside the predetermined disc area (operation 430), then whichever of the detected empty sections is closer to the reference point may be allocated to the target data in order to reduce seek time. It is understood that, if no predetermined area is selected, operations 420 and 430 can be combined.

In operation 440, if no empty section that is larger than the size of the target data remains on the disc (operation 430), it is determined whether an empty section of any size remains on the disc. In operation 460, if no empty section remains on the disc (operation 440), then an error message is output. In operation 450, if empty sections still remain on the disc (operation 440), then whichever of the remaining empty sections is largest is selected. In operation 470, the empty section selected in operation 450 is allocated to part of the target data.

In operation 410, manual inspection of each block of a file system may be needed to search the predetermined disc area for an empty section that is larger than the size of the target data. On the other hand, operations 430 and 440 may be performed simply by referencing a list managed by the file system, instead of manually inspecting each block of the file system. For example, XFS manages information regarding empty disc space according to the locations and sizes of empty sections using a B+tree. In this case, operations 430 and 440 may be performed with reference to the B+tree.

FIG. 5 is a block diagram of an apparatus for allocating disc space according to an embodiment of the present invention. Referring to FIG. 5, the apparatus includes a first algorithm execution unit 510, a second algorithm execution unit 520, and a control unit 530. The first algorithm execution unit 510 allocates empty space to target data by executing the first algorithm. The first algorithm execution unit 510 includes an L_i generator 511, a W_i generator 512, a Z_i generator 513, a first selector 514, a second selector 515, and an allocator 516. While not required, the apparatus can be implemented in a recording and/or reproducing apparatus which records data in the allocated empty spaces.

The L_i generator 511 determines i₁ and i₂ that are respectively the minimum and the maximum in the predetermined range, and creates L_i as described above in relation to FIG. 3 according to the results of the determination. The W_i generator 512 creates W_i, as described above in relation to FIG. 3, based on L_i. The Z_i generator 513 creates Z_i, as described above in relation to FIG. 3, based on W_i. The first selector 514 chooses a set (i.e., M_i of FIG. 3) that results in the shortest seek time from among a plurality of sets belonging to Z for each of the integer values within the predefined range. The second selector 515 chooses a set Min (M_i) that can result in the shortest seek time from the sets M_i chosen by the first selector 514. The allocator 516 allocates a plurality of empty sections included in the set chosen by the second selector 515 to the target data. Each parameter has already been described in detail, and thus, detailed descriptions thereof will be skipped.

If the allocation of empty sections to the target data by the first algorithm execution unit 510 fails, the second algorithm execution unit 520 attempts to allocate one or more empty sections to the target data by executing the second algorithm. If no empty space remains on the disc, the second algorithm execution unit 520 outputs an error message indicating that insufficient space remains to record the target data.

If the second algorithm execution unit 520 fails to cover the entire target data by allocating disc space to only part of the target data, then the control unit 530 sets the size of a portion of target data remaining uncovered by the allocation as a new target data size, sets a point where the allocation of disc space by the second algorithm execution unit 250 has ended as a new reference point, and transmits the new reference point and the new target data size to the first algorithm execution unit 510 so that the first algorithm execution unit 510 can execute the first algorithm based on the new reference point and the new target data size. Also, the control unit 530 repeatedly performs the aforementioned process until the second algorithm execution unit 520 outputs an error message or until the entire target data is covered, thereby enabling the first and second algorithms to be alternately executed. While not shown, it is understood that the apparatus can further include an optical and/or magnetic head to transfer the target data with respect to a disc, and a controller to process the target data to be written in the allocated empty spaces. Examples of the apparatus can be media players, computers, disk drives, or like devices.

FIG. 6 is a diagram explaining a method of allocating disc space according to an embodiment of the present invention. Referring to FIG. 6, dark portions represent portions of a disc that have already been allocated, and bright portions represent empty portions of the disc yet to be allocated. Assume that portions of the disc other than those illustrated in FIG. 6 have all been allocated.

Referring to FIG. 6, empty sections a and b are located to the left of a reference point. The empty sections a and b have a size of 1 and are thus as large as one block. Empty sections c, d, and e are located to the right of the reference point. The empty sections c, d, and e respectively have sizes of 2, 4, and 3. In other words, the empty section c is twice as large as one block, the empty section d is four times as large as one block, and the empty section e is three times as large as one block. Assume that the size of the target data is 4 (blocks), that C=2, and that N=20 for the equations described above, i₂=min(N,]log₂(req_len)[) and i₁=max([log₂(req_len)]-C, 0).

In this case, i₂=min(20,]log₂4[)=2, and i₁=max([log₂4]−2, 0)=0. Accordingly, L₂, L₁, and L₀ are generated as follows:

• • L₂: {d};
  • L₁: {c, d, e}; and
  • L₀: {a, b, c, d, e}.

Thereafter, W_i is determined as follows:

• • W₂: {d}
  • W₁: {c, d}; and
  • W₀: {a, b, c, d}.

Then, Z_i is determined as follows:

• • Z₂: {d};
  • Z₁: {c, d}, {d}; and
  • Z₀: {a, b, c}, {b, c, d}, {c, d}, {d}.

Thereafter, a set that can result in a minimum seek time is chosen from among the sets belonging to each of Z₀ through Z₂, and the chosen sets are determined as MO through M₂. Then, whichever of MO through M₂ can result in the shortest seek time is allocated to the target data.

FIG. 7 is a diagram explaining a method of allocating disc space according to another embodiment of the present invention. Referring to FIG. 7, dark portions represent portions of a disc that have already been allocated, and bright portions represent empty portions of the disc yet to be allocated. Assume that portions of the disc other than those illustrated in FIG. 7 have all been allocated. Also, assume that the size of the target data is 8 blocks, that C=2, and that N=20.

In this case, i₂=min(20,]log₂8[)=3 and i₁=max([log₂8]−2, 0)=1, L₁, L₂, and L₃ are generated as follows:

• • L₃: empty;
  • L₂: {d}; and
  • L₁: {d}.

Thereafter, W_i is determined as follows:

• • W₃: empty;
  • W₂: {d}; and
  • W₁: {d}.

Thereafter, Z_i is determined based on W_i. The only section that can be chosen in common from W₂ and W₁ is an empty section d. However, since the size of the empty section d is smaller than the size of the target data, it is determined that the allocation of disc space to the target data using the first algorithm has failed. Thus, the second algorithm is executed.

Referring to FIGS. 4 and 7, none of the empty sections a, b, c, and d are larger than the size of the target data (operation 410). Thus, the empty section d, which is the largest empty section, is allocated first to part of the target data (operation 450). As a result, a portion of the target data having the size of one block remains uncovered by the allocation of the empty section d. Therefore, the end of the empty section d is set as a new reference point, and the size of the remaining portion of the target data is set as a new target data size. Thereafter, the first algorithm is executed again. In this case, i₂=min(20, ]log₂1[)=0 and i₁=max([log₂1]−2, 0)=0. Accordingly, L₀ is generated as follows: L₀: {a, b, c}and W₀ is determined as follows: W₀: {c}. Then, Z₀ is determined as follows: Z₀: {c}. Accordingly, the empty section c is additionally allocated to the target data. In short, according to the present embodiment, the empty sections c and d are allocated to the target data.

FIG. 8 is a diagram explaining a method of allocating disc space according to another embodiment of the present invention. The state of the disc illustrated in FIG. 8 is the same as the state of the disc illustrated in FIG. 7 except that C=3. That is, the size of the target data is 8, C=3, and N=20

The first algorithm is executed. Since i₂=min(20, ]log₂8[)=3 and i₁=max([log₂8]−3, 0)=0, L₀, L₁, L₂, and L₃ are generated as follows:

• • L₃: empty;
  • L₂: {d};
  • L₁: {d}; and
  • L₀: {a, b, c, d}.

Thereafter, W_i is determined as follows:

• • W₃: empty;
  • W₂: {d};
  • W₁: {d}; and
  • W₀: {a, b, c, d}.

Then, Z_i is determined as follows:

• • Z₃: empty;
  • Z₂: empty;
  • Z₁: empty; and
  • Z₀: {a, b, c, d}.

In short, according to the example embodiment, empty sections a, b, c, and d are allocated to target data.

The embodiment illustrated in FIG. 8 is different from the embodiment illustrated in FIG. 7 in that the range of i values is expanded by setting the constant C to 3 rather than to 2. Thus, the embodiment illustrated in FIG. 8 provides different disc space allocation results from the embodiment illustrated in FIG. 7. In other words, the value of the constant C affects disc space allocation results. Accordingly, it is possible to obtain optimum disc space allocation results by appropriately adjusting the value of the constant C.

FIG. 9 is a diagram explaining a method of allocating disc space according to another embodiment of the present invention. Referring to FIG. 9, assume that the size of target data is 12 blocks, that C=2, and that N=20. Referring to FIG. 9, dark portions represent portions of a disc that have already been allocated, and bright portions represent empty portions of the disc yet to be allocated. Assume that portions of the disc other than those illustrated in FIG. 9 have all been allocated.

Since i₂=min(20,]log₂12[)=4 and i₁=max([log₂12]−2, 0)=2, L₂, L₃, and L₄ are generated as follows:

• • L₄: empty;
  • L₃: {c}; and
  • L₂: {C}.

Then, W_i (where i is an integer between 2 and 4) is determined as follows:

• • W₄: empty;
  • W₃: {c}; and
  • W₂: {c}.

Thereafter, Z_i is determined based on W_i and is as follows:

• • Z₄: empty;
  • Z₃: empty; and
  • Z₂: empty.

Since the allocation of disc space to the target data through the first algorithm has failed, the second algorithm is executed. Referring to FIG. 4 and the empty sections a, b, and c illustrated in FIG. 9, the empty section c is the largest empty section. Thus, the empty section c is allocated to part of the target data first (operation 450). As a result, a portion of the target data having the size of 4 blocks remains uncovered by the allocation of the empty section c. Then, the end of the empty section c is set as a new reference point, and the size of the remaining portion of the target data (i.e., 4) is set as a new target data size. Thereafter, the first algorithm is executed again. Then, i₂=min(20,]log₂4])=2, and i₁=max([log₂4]−2, 0)=0. Accordingly, L₀, L₁, and L₂ are generated as follows:

• • L₂: empty;
  • L₁: {b}; and
  • L₀: {a, b}.

Then, W_i is determined as follows:

• • W₂: empty;
  • W₁: {b}; and
  • W₀: {a, b}.

Since the size of the empty sections a and b combined is smaller than the new target data size, i.e., 4, it is determined that the first algorithm has failed. Accordingly, the second algorithm is executed again. Since the empty section c has already been allocated to the target data, the empty section b, which is the largest empty section, is allocated to the remaining portion of the target data. As a result, a portion of the target data having the size of two blocks remains uncovered by the allocation of the empty section b, and the empty section a is the only empty section left. In this case, the first algorithm is executed again. Since the size of the empty section a is smaller than the size of the remaining portion of the target data, i.e., 2, the second algorithm is executed again. As a result of the second algorithm, the empty section a is allocated to the target data. Thereafter, the first algorithm is executed again. Since no empty section remains after the allocation of the empty section a, the second algorithm is executed, and as a result, an error message is output (operation 460).

Aspects of the present invention can be realized as computer-readable code written on a computer-readable recording medium. The computer-readable recording medium may be any type of recording device in which data is stored in a computer-readable manner. Examples of the computer-readable recording medium include a ROM, a RAM, a CD-ROM, a magnetic tape, a floppy disc, an optical data storage, and a and a computer data signal embodied in a carrier wave including a compression source code segment and an encryption source code segment (e.g., data transmission through the Internet). The computer-readable recording medium can be distributed over a plurality of computer systems connected to a network so that computer-readable code is written thereto and executed therefrom in a decentralized manner. Functional programs, code, and code segments needed for realizing aspects of the present invention can be easily construed by one of ordinary skill in the art.

It is noted that in some alternative implementations, the functions noted in the blocks of the flowcharts described above may occur out of order. For example, two blocks shown in succession may in fact be executed substantially concurrently or the blocks may sometimes be executed in reverse order depending upon the functionality involved. More specifically, for example, according to an aspect of the present invention, the second algorithm may be executed prior to the first algorithm. Furthermore, in some alternative implementations, blocks may be omitted. For example, the first algorithm may be omitted and the second algorithm may be repeated until all of the data has an allocated disc space.

According to aspects of the present invention, it is possible to effectively allocate empty disc space in consideration of both the distances of empty disc sections to a reference point and seek time thus reducing the time taken to seek target data compared to methods of allocating disc space that only consider the distances of empty disc sections to a reference point. Aspects of the invention can be implemented using magnetic, magneto optical, and/or optical recording media for use with computers, portable computing devices, portable media players, etc.

Although a few embodiments of the present invention have been shown and described, it would be appreciated by those skilled in the art that changes may be made in this embodiment without departing from the principles and spirit of the invention, the scope of which is defined in the claims and their equivalents.

Claims

1. A method of allocating disc space for recording data on a disc, the method comprising: detecting one or more first sets, each comprising one or more empty sections of the disc that are larger than a corresponding predetermined reference value;detecting one or more second sets, each comprising one or more empty sections from the one or more first sets that are equal to or larger than a size of the data when combined; andallocating, to the data, an optimum set of the one or more second sets that results in a shortest seek time from a predetermined reference point.

2. The method as claimed in claim 1, further comprising: if no one or more second sets are detected, allocating an empty section, to the data, that is located within a predetermined range of the reference point and is larger than the size of the data.

3. The method as claimed in claim 2, further comprising: if no empty section that is larger than the data and within the predetermined range of the reference point exists, allocating an empty section, to the data, that is outside of the predetermined range of the reference point and is larger than the size of the data.

4. The method as claimed in claim 3, further comprising: if no empty section that is larger than the data exists on the disc, allocating a largest empty section on the disk to a part of the data.

5. The method as claimed in claim 4, wherein the allocating of the largest empty section comprises: setting an end of the allocated empty section as a new reference point;setting a size of a remainder of the data as a new data size; andperforming the detecting of the one or more first sets, the detecting of the one or more second sets, the allocating of the optimum set, the allocating of the empty section that is located within the predetermined range, the allocating of the empty section that is outside of the predetermined range, and the allocating of the largest empty section again.

6. The method as claimed in claim 5, wherein the detecting of the one or more first sets, the detecting of the one or more second sets, the allocating of the optimum set, the allocating of the empty section that is located within the predetermined range, the allocating of the empty section that is outside of the predetermined range, and the allocating of the largest empty section again are repeated until all of the data has the disc space allocated thereto or until no empty sections remain on the disc.

7. The method as claimed in claim 4, further comprising: outputting an error message if no empty sections remain on the disc.

8. The method as claimed in claim 6, further comprising: outputting an error message if no empty sections remain on the disc.

9. The method as claimed in claim 1, wherein: the detecting of the one or more first sets comprises generating a set Li for each of one or more values of i (where i is the corresponding predetermined reference value and is an integer within a predetermined range), each comprising one or more empty sections that are each larger than a size of 2i blocks; andthe detecting of the one or more second sets comprises: generating a set Wi for each of the one or more values of i, each comprising one or more empty sections within a predetermined distance from the predetermined reference point from among the empty sections of the corresponding set Li; andgenerating a second set, of the one or more second sets, Zi for each of the one or more values of i, each comprising one or more sets of consecutive empty sections zi1, zi2, . . . , and ziw included in the corresponding set Wi such that a size of the consecutive empty sections of each of the one or more sets is equal to or larger than the size of the data.

10. The method as claimed in claim 9, wherein the allocating of the optimum set comprises: selecting a third set from the set zi that results in the shortest seek time for each of the one or more values of i;selecting the optimum set from the one or more third sets that results in the shortest seek time; andallocating the one or more empty sections of the optimum set to the data,wherein I(zi1)+I(zi2)+ . . . +I(ziw)≧req_len, and I(zi1)+I(zi2)+ . . . +I(zi(w−1))≧req_len, where x indicates an empty section, I(x) indicates a size of the section x, and req_len indicates the size of the data.

11. The method as claimed in claim 10, wherein i1≦i≦i2, i2 min(N,]log2(req_len)[), and i1=max([log2(req_len)]−C, 0), where req_len indicates the size of the data, C is a constant, N=[log2(V/B)], V indicates a storage capacity of the disc, B indicates a size of blocks of a file system,][is a mathematical operator that raises a value to a closest integer greater than an original value, and [ ] is a mathematical operator that lowers the value to a closest integer less than the original value.

12. The method as claimed in claim 9, wherein: the set Wi comprises u empty sections I1, I2, I3, . . . , and Iu that are included in the set Li and are located on a left side of the reference point and/or v empty sections r1, r2, r3, . . . , and rv that are included in the set Li and are located on a right side of the reference point; andu≧]req_len/2i[, I(I1)+I(I2)+ . . . I(Iu)≧req_len and (I1)+I(I2)+ . . . I(Iu−1)<req_len, or I(I1)+I(I2)+ . . . I(Iu)≧req_len, v≧]req_len/2[, I(r1)+I(r2)+ . . . I(rv)≧req_len and I(r1)+I(r2)+ . . . I(rv−1)<req_len, or I(r1)+I(r2)+ . . . I(rv)≧req_len, where x indicates an empty section, I(x) indicates a size of the empty section x, req_len indicates the size of the data, ][ is a mathematical operator that raises a value to a closest integer greater than an original value, and [ ] is a mathematical operator that lowers the value to a closest integer less than the original value.

13. The method as claimed in claim 1, wherein the allocating of the optimum set comprises: selecting a third set from each of the one or more second sets that results in the shortest seek time;selecting the optimum set from the one or more third sets that results in the shortest seek time; andallocating the one or more empty sections of the optimum set to the data.

14. The method as claimed in claim 2, wherein the allocating of the empty section that is located within the predetermined range comprises: allocating an empty section, from a plurality of empty sections that are within the predetermined range and larger than the size of the data, that is closest to the reference point.

15. The method as claimed in claim 3, wherein the allocating of the empty section that is outside of the predetermined range comprises: allocating an empty section, from a plurality of empty sections that are outside of the predetermined range and larger than the size of the data, that is closest to the reference point.

16. A computer-readable recording medium encoded with the method of claim 1 and implemented by a computer.

17. An apparatus for allocating disc space for recording data on a disc, the apparatus comprising: a first algorithm execution unit to: detect one or more first sets, each comprising one or more empty sections of the disc that are larger than a corresponding predetermined reference value;detect one or more second sets, each comprising one or more empty sections from the one or more first sets that are equal to or larger than a size of the data when combined; andexecutes a first algorithm to allocate, to the data, an optimum set of the one or more second sets that results in a shortest seek time from a predetermined reference point.

18. The apparatus as claimed in claim 17, further comprising: a second algorithm execution unit to allocate an empty section, to the data, that is located within a predetermined range of the reference point and is larger than the size of the data if the first algorithm execution unit does not detect the one or more second sets.

19. The apparatus as claimed in claim 18, wherein the second algorithm execution unit allocates an empty section, to the data, that is outside of the predetermined range of the reference point and is larger than the size of the data if no empty section that is larger than the data and within the predetermined range of the reference point exists.

20. The apparatus as claimed in claim 19, wherein the second algorithm execution unit allocates a largest empty section on the disk to a part of the data if no empty section that is larger than the data exists on the disk.

21. The apparatus as claimed in claim 20, further comprising a control unit to, if the second algorithm execution unit allocates the largest empty section, set an end of the allocated empty section as a new reference point, set a size of a remainder of the data as a new data size, and control the first algorithm execution unit to detect the one or more first sets, detect the one or more second sets, and execute the first algorithm again and the second algorithm execution unit to allocate the empty section located within the predetermined range, allocate the empty section outside of the predetermined range, and allocate the largest empty section again.

22. The apparatus as claimed in claim 21, wherein the control unit repeatedly controls the first algorithm execution unit to detect the one or more first sets, detect the one or more second sets, and execute the first algorithm again and the second algorithm execution unit to allocate the empty section located within the predetermined range, allocate the empty section outside of the predetermined range, and allocate the largest empty section again until all of the data has the disc space allocated thereto or until no empty sections remain on the disc.

23. The apparatus as claimed in claim 20, wherein the second algorithm execution unit outputs an error message if no empty sections remain on the disc.

24. The apparatus as claimed in claim 22, wherein the second algorithm execution unit outputs an error message if no empty sections remain on the disc.

25. The apparatus as claimed in claim 17, wherein the first algorithm execution unit comprises: an Li generator to generate a first set Li for each of one or more values of i (where i is an integer within a predetermined range), each comprising one or more empty sections that are each larger than a size of 2′ blocks;a Wi generator to generate a set Wi for each of one or more values of i, each comprising one or more empty sections within a predetermined distance from the predetermined reference point from among the empty sections of the corresponding set Li;a Zi generator to generate a second set, of the one or more second sets, Zi for each of the one or more values of i, each comprising one or more sets of consecutive empty sections zi1, zi2, . . . , and ziw included in the corresponding set Wi such that a size of the consecutive empty sections of each of the one or more sets is equal to or larger than the size of the data.

26. The apparatus as claimed in claim 25, wherein the first algorithm execution unit further comprises: a first selector to select a first selector set from the set Zi that results in the shortest seek time for each of the one or more values of i;a second selector to select the optimum set from the one or more first selector sets that results in the shortest seek time; andan allocator to allocate of the one or more empty sections of the optimum set selected to the data,wherein I(zi1)+I(zi2)+ . . . +I(ziw)≧req_len, and I(zi1)+I(zi2)+ . . . +I(zi(w−1))<req_len, where x indicates an empty section, I(x) indicates a size of the section x, and req_len indicates the size of the data.

27. The apparatus as claimed in claim 26, wherein i1≦i≦i2, i2=min(N, ]log2(req_len)[), and i1=max([log2(req_len)]−C, 0), where req_len indicates the size of the data, C is a constant, N=[log2(V/B)], V indicates a storage capacity of the disc, B indicates a size of blocks of a file system,][is a mathematical operator that raises a value to a closest integer greater than an original value, and [ ] is a mathematical operator that lowers the value to a closest integer less than the original value.

28. The apparatus as claimed in claim 25, wherein: the set Wi comprises u empty sections I1, I2, I3, . . . , and Iu that are included in the set Li and are located on a left side of the reference point and/or v empty sections r1, r2, r3, . . . , and rv that are included in the set Li and are located on a right side of the reference point; andu≦]req_len/2i[, I(I1)+I(I2)+ . . . I(Iu)≧req_len and (I1)+I(I2)+ . . . I(Iu−1)<req_len, or I(I1)+I(I2)+ . . . I(Iu)≧req_len, v≦]req_len/2[, I(r1)+I(r2)+ . . . I(rv)≧req_len and I(r1)+I(r2)+ . . . I(rv−1)<req_len, or I(r1)+I(r2)+ . . . I(rv)≧req_len, where x indicates an empty section, I(x) indicates a size of the empty section x, req_len indicates the size of the data,][is a mathematical operator that raises a value to a closest integer greater than an original value, and [ ] is a mathematical operator that lowers the value to a closest integer less than the original value.

29. The apparatus as claimed in claim 17, wherein the first algorithm execution unit comprises an allocator to select a third set from each of the one or more second sets that results in the shortest seek time, to select the optimum set from the one or more third sets that results in the shortest seek time, and to allocate the one or more empty sections of the optimum set to the data.

30. The apparatus as claimed in claim 18, wherein, the second algorithm execution unit allocates an empty section, from a plurality of empty sections that are within the predetermined range and larger than the size of that data, that is closest to the reference point.

31. The apparatus as claimed in claim 19, wherein, the second algorithm execution unit allocates an empty section, from a plurality of empty sections that are outside of the predetermined range and larger than the size of the data, that is closest to the reference point.