WO2002052396A2 - Method and system for reducing fragmentation - Google Patents

Method and system for reducing fragmentation Download PDF

Info

Publication number
WO2002052396A2
WO2002052396A2 PCT/IB2001/002458 IB0102458W WO02052396A2 WO 2002052396 A2 WO2002052396 A2 WO 2002052396A2 IB 0102458 W IB0102458 W IB 0102458W WO 02052396 A2 WO02052396 A2 WO 02052396A2
Authority
WO
WIPO (PCT)
Prior art keywords
file
deletion
fragmentation
files
storage device
Prior art date
Application number
PCT/IB2001/002458
Other languages
French (fr)
Other versions
WO2002052396A3 (en
Inventor
Robert Jochemsen
Nicolaas Lambert
Original Assignee
Koninklijke Philips Electronics N.V.
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Koninklijke Philips Electronics N.V. filed Critical Koninklijke Philips Electronics N.V.
Priority to EP01272156A priority Critical patent/EP1423783A2/en
Priority to KR1020027010988A priority patent/KR20020081696A/en
Priority to JP2002553630A priority patent/JP2004517399A/en
Publication of WO2002052396A2 publication Critical patent/WO2002052396A2/en
Publication of WO2002052396A3 publication Critical patent/WO2002052396A3/en

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/10—File systems; File servers
    • G06F16/17—Details of further file system functions
    • G06F16/1727—Details of free space management performed by the file system
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0638—Organizing or formatting or addressing of data
    • G06F3/064—Management of blocks
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/10—File systems; File servers
    • G06F16/16—File or folder operations, e.g. details of user interfaces specifically adapted to file systems
    • G06F16/162—Delete operations
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/10—File systems; File servers
    • G06F16/17—Details of further file system functions
    • G06F16/1724—Details of de-fragmentation performed by the file system
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
    • G06F3/0608—Saving storage space on storage systems
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0646—Horizontal data movement in storage systems, i.e. moving data in between storage devices or systems
    • G06F3/0652—Erasing, e.g. deleting, data cleaning, moving of data to a wastebasket
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0668—Interfaces specially adapted for storage systems adopting a particular infrastructure
    • G06F3/0671—In-line storage system
    • G06F3/0673—Single storage device
    • G06F3/0674—Disk device
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0638—Organizing or formatting or addressing of data
    • G06F3/0643—Management of files

Definitions

  • the present invention relates to methods of and systems arranged for reducing fragmentation.
  • the invention also relates to corresponding computer program products.
  • a digital storage device is typically a disk on which data is stored.
  • the present invention is concerned with such storage devices in which the data storage is potentially temporary, i.e. data is deletable.
  • Files are saved to the disk in one or more fragments.
  • a fragment contains part or all of a file.
  • several fragments may be required.
  • the fragments may be scattered around the disk surface. If the disk is near its capacity for data storage, even a relatively small file may have to be split into spaced fragments.
  • file fragmentation This spacing of fragments of a file is referred to as file fragmentation.
  • free-space fragmentation A highly fragmented disk generally will take longer to read as the read device needs to hunt around the disk to find the relevant fragments. Similarly it can take longer for a file to be saved to a highly fragmented disk as the write device needs to find sufficient fragments for all of the file(s), which clusters may be widely spaced.
  • File fragmentation and free-space fragmentation are together referred to as fragmentation.
  • a file is to be deleted.
  • a user may pre-select files for deletion (similar to a "recycle bin" in a WINDOWS (trade mark) operating system environment) or files may be annotated only to be kept for a certain period of time.
  • Such annotation is recorded in the system file manager usually by a marker flag.
  • claims 1 and 4 addresses the problem by, when a plurality of files is available for deletion, selectively deleting a file to reduce fragmentation.
  • a method of reducing fragmentation of a digital storage device characterised by the method comprising the steps of: determining that a plurality of files is available for deletion; selecting one of the files; and deleting the selected file and not deleting another of the files.
  • a system arranged for reducing fragmentation of a digital storage device, characterised by the system comprising means for determining that a plurality of files is available for deletion; means for selecting one of the files; and means for deleting the selected file and not deleting another of the files.
  • claims 2 and 7 provide an advantageous way of maximising file defragmentation.
  • claims 3 and 8 provide an advantageous way of maximising both file and free-space defragmentation.
  • claims 4 and 9 provide an advantageous way of determining which file should be detected to maximise both file and free-space defragmentation.
  • claims 5 and 10 provide an advantageous way of taking account of file sizes when determining optimum defragmentation.
  • the invention may advantageously be implemented as a digital video recorder, as set out in claim 11.
  • the invention may advantageously be implemented as a computer program product, as set out in claim 12. It has been realised that with digital storage devices annotating a plurality of files for deletion, there is an efficient opportunity to reduce fragmentation by selective file deletion.
  • Figure 1 is a schematic illustration of a digital video recorder.
  • Figure 2 is a functional flow diagram illustrating a file writing operation.
  • Figure 3 is a functional flow diagram illustrating a file deleting operation according to an embodiment of the present invention.
  • Figure 4 is a functional flow diagram illustrating a file selecting operation according to an embodiment of the present invention.
  • FIG. 1 of the drawings that follow there is shown schematically a memory disk 10 of a digital video recorder 20, which digital video recorder has a file manager 30 for controlling files on the disk 10.
  • the memory disk 10 has an associated computer program product 40 for operating the digital video recorder according to preferred embodiments of the present invention.
  • FIG 2 of the drawings that follow the steps of a file writing operation are shown.
  • the flow diagram entries correspond as follows: 100 - SELECT FILE TO WRITE TO DISK
  • step 100 a file (not shown) is selected to be written to the disk 10.
  • a search of the file manager 30 is undertaken for available free space on the disk 10 (step 102).
  • the file to be written is segmented into the required number and size of fragments (step 104) and is then written to the disk 10 (step 106).
  • a file manager entry is generated (step 108) in the file manager 30.
  • the file may be annotated for deletion at this stage or it may be so annotated later (step 110).
  • Annotation is typically by a marker flag on the file manager entry for the file. If it is to be annotated then the corresponding file manager entry is annotated accordingly (step 112).
  • a file may be annotated for deletion after a certain period of time, or may be user selected for deletion, for instance by being placed in a recycle bin or the like (in a WINDOWS (trade mark) operating system environment). Given the set or a subset of the files on the disk, a mechanism can mark a number of these for deletion, according to a user profile.
  • FIG. 3 shows a deletion operation according to an embodiment of the present invention.
  • the flow diagram entries correspond as follows:
  • step 200 the file manager 30 is interrogated (step 202) to determine whether multiple files are available for deletion.
  • a file is available for deletion if it has been so annotated.
  • a file is only available for deletion if in doing so it provides sufficient free-space for the required write operation. This may mean that several of a plurality of files need to be deleted. If only a single file is available for deletion, it is deleted (step 204) and the file manager 30 updated accordingly (step 210). If multiple files are available a file is selected to be deleted to reduce fragmentation (step 206). Options for selecting the file to be deleted in this embodiment of the present invention are set out below.
  • the selected file is permanently deleted (step 208) and the file manager 30 is updated accordingly (step 210).
  • the specific file to be deleted can be chosen to optimise file defragmentation or free-space defragmentation. There can be several criteria to determine the text file to delete. One is to optimise the file fragmentation level of the files on the disk by deleting the most fragmented file among the available candidates for deletion. A better one is to optimise the fragmentation level and the free-space fragmentation level, since the next file to be written to the disk will benefit from a low free-space fragmentation.
  • the optimisation can be improved by taking into account not only the number of fragments, but also the sizes of them.
  • File A consists of 2 fragments, file B of 3 fragments, and file C of 3 fragments.
  • the free space F consists of 2 fragments. Thus in total there are 10 fragments.
  • files A and B are candidates for deletion having been annotated accordingly in the file manager 30, and file C should be left untouched, we need to choose between files A and B for deletion. If we delete the most file fragmented one, which is file B, we get the following result:
  • File A consists of 2 fragments, file C of 3 fragments, and the free space F of 4 fragments. This totals 9 fragments. Because of the high fragmentation of the free space, the next file to be stored will probably have a high fragmentation level as well. If instead we optimise on the file fragmentation level of both the files and the free-space, we would delete file A, from which we get the following result:
  • File B consists of 3 fragments
  • file C of 3 fragments
  • free space F consists of 2 fragments, totalling 8 fragments. What is more, since the free-space has a low free-space fragmentation level, the next file to be stored will also have a low fragmentation level.
  • the determination of which file to delete whichever selection option is chosen is carried out by interrogating the file manager 30. For every file in a set of deletable files the effect of deletion on file fragmentation and free-space fragmentation is calculated.
  • the effect on free-space fragmentation is calculated by calculating the changes the deletion (for each file) would have on the free-space fragments (step 402). New free- space fragments might appear (undesirable), but several free-space fragments can be connected by deletion creating new free-space fragments (desirable). In general, the number of free-space fragments will increase (ie a positive change).
  • the file that results in the lowest sum (always zero or negative) of both the fragmentation and free-space fragmentation changes is determined (step 404). Since this mechanism favours large files (being statistically more coalescing), an optional refinement is to normalise on the file size (step 406). This is done by dividing the sum above by the number of clusters in the file. The optimal file is then selected (step 408).
  • step 404 can be used to select the file for deletion.
  • the effect of deletion on file fragmentation is calculated (step 400).
  • File fragmentation over the completed disk would decrease by the number of fragments of the file to be deleted. This is always a negative change.

Abstract

The present invention provides a method and system for reducing fragmentation (both file fragmentation and free-space fragmentation) in digital storage devices (10). In such a device in which a plurality of files is available for deletion the invention proposes selectively deleting the file that maximises defragmentation. The selection may optimise file and free-space defragmentation.

Description

Method and system for reducing fragmentation
The present invention relates to methods of and systems arranged for reducing fragmentation. The invention also relates to corresponding computer program products.
A digital storage device is typically a disk on which data is stored. The present invention is concerned with such storage devices in which the data storage is potentially temporary, i.e. data is deletable.
When data, in the form of files, is stored to such a disk it is done so that each file is independently accessible. The files are stored on tracks arranged concentrically on the disk. The location on the disk at which a particular file is located is stored in a separate data structure in a disk management file.
Files are saved to the disk in one or more fragments. A fragment contains part or all of a file. When a large file is to be stored on the disk, several fragments may be required. Depending on the available space on the disk the fragments may be scattered around the disk surface. If the disk is near its capacity for data storage, even a relatively small file may have to be split into spaced fragments.
This spacing of fragments of a file is referred to as file fragmentation. When the free space between fragments becomes fragmented, this is referred to as free-space fragmentation. A highly fragmented disk generally will take longer to read as the read device needs to hunt around the disk to find the relevant fragments. Similarly it can take longer for a file to be saved to a highly fragmented disk as the write device needs to find sufficient fragments for all of the file(s), which clusters may be widely spaced. File fragmentation and free-space fragmentation are together referred to as fragmentation.
Various approaches have been tried to reduce fragmentation of such a memory device, for instance as disclosed in US-A-5, 930,828. In this prior art proposal files are moved around the disk to reduce fragmentation. This is time consuming and processor intensive.
In recent digital devices such as disk based digital video recorders using a file system, it is often the case that a file is to be deleted. For instance, a user may pre-select files for deletion (similar to a "recycle bin" in a WINDOWS (trade mark) operating system environment) or files may be annotated only to be kept for a certain period of time. Such annotation is recorded in the system file manager usually by a marker flag. In this case there may be a plurality of files available for deletion when a delete operation needs to be carried out, for instance, to create space for a new file to be saved.
When a delete operation is necessary, it is desireable permanently to delete the minimum number of files so that (a) at least the required amount of free space is created; and (b) defragmentation and free-space defragmentation are optimised.
It is an aim of preferred embodiments of the present invention to provide a method, system and corresponding computer program product for reducing fragmentation of a digital storage device.
The invention of claims 1 and 4 addresses the problem by, when a plurality of files is available for deletion, selectively deleting a file to reduce fragmentation.
According to the present invention in a first aspect, there is provided a method of reducing fragmentation of a digital storage device, characterised by the method comprising the steps of: determining that a plurality of files is available for deletion; selecting one of the files; and deleting the selected file and not deleting another of the files.
According to the present invention in a second aspect, there is provided a system arranged for reducing fragmentation of a digital storage device, characterised by the system comprising means for determining that a plurality of files is available for deletion; means for selecting one of the files; and means for deleting the selected file and not deleting another of the files.
The features of claims 2 and 7 provide an advantageous way of maximising file defragmentation.
The features of claims 3 and 8 provide an advantageous way of maximising both file and free-space defragmentation.
The features of claims 4 and 9 provide an advantageous way of determining which file should be detected to maximise both file and free-space defragmentation.
The features of claims 5 and 10 provide an advantageous way of taking account of file sizes when determining optimum defragmentation. The invention may advantageously be implemented as a digital video recorder, as set out in claim 11.
The invention may advantageously be implemented as a computer program product, as set out in claim 12. It has been realised that with digital storage devices annotating a plurality of files for deletion, there is an efficient opportunity to reduce fragmentation by selective file deletion.
The present invention will now be described, by way of example only, with reference to the drawings that follow; in which:
Figure 1 is a schematic illustration of a digital video recorder. Figure 2 is a functional flow diagram illustrating a file writing operation. Figure 3 is a functional flow diagram illustrating a file deleting operation according to an embodiment of the present invention.
Figure 4 is a functional flow diagram illustrating a file selecting operation according to an embodiment of the present invention.
Some of the features indicated in Figures 2-4 of the drawings are typically implemented in software, and as such represent software entities, such as software modules or objects.
Referring to Figure 1 of the drawings that follow, there is shown schematically a memory disk 10 of a digital video recorder 20, which digital video recorder has a file manager 30 for controlling files on the disk 10. The memory disk 10 has an associated computer program product 40 for operating the digital video recorder according to preferred embodiments of the present invention. Referring to Figure 2 of the drawings that follow, the steps of a file writing operation are shown. In Figure 2, the flow diagram entries correspond as follows: 100 - SELECT FILE TO WRITE TO DISK
102 - SEARCH FOR AVAILABLE FOR SPACE ON DISK
104 - SEGMENT FILE INTO REQUIRED CLUSTERS 106 - WRITE CLUSTERS TO DISK
108 - GENERATE FILE MANAGER ENTRY
110 - IS FILE TO BE ANNOTATED FOR DELETION?
112 - ANNOTATE FILE MANAGER ENTRY 114 - FINISH
In step 100 a file (not shown) is selected to be written to the disk 10. Once a file is selected to write to disk 10 (step 100), for instance by a user or automatic save instruction, a search of the file manager 30 is undertaken for available free space on the disk 10 (step 102). In this case we assume that there is sufficient space on the disk 10, but that it is fragmented to some degree. Accordingly, the file to be written is segmented into the required number and size of fragments (step 104) and is then written to the disk 10 (step 106). To maintain a record of the file, a file manager entry is generated (step 108) in the file manager 30. The file may be annotated for deletion at this stage or it may be so annotated later (step 110). Annotation is typically by a marker flag on the file manager entry for the file. If it is to be annotated then the corresponding file manager entry is annotated accordingly (step 112). A file may be annotated for deletion after a certain period of time, or may be user selected for deletion, for instance by being placed in a recycle bin or the like (in a WINDOWS (trade mark) operating system environment). Given the set or a subset of the files on the disk, a mechanism can mark a number of these for deletion, according to a user profile.
Thus, when a file is to be deleted there may be several such files available. A file may need to be deleted for instance to make room on the disk for a write operation that has been instructed. Alternatively, the user may instruct an amount of the free space to be cleared. Figure 3 of the drawings that follow shows a deletion operation according to an embodiment of the present invention. In Figure 3, the flow diagram entries correspond as follows:
200 - INITIATE DELETE OPERATION
202 - MULTIPLE FILES AVAILABLE FOR DELETION? 204 - DELETE SINGLE FILE
206 - SELECT FILE TO DELETE TO REDUCE
FRAGMENTATION
208 - DELETE SELECTED FILE
210 - UPDATE FILE MANAGER When a deletion operation is initiated (step 200) the file manager 30 is interrogated (step 202) to determine whether multiple files are available for deletion. A file is available for deletion if it has been so annotated. A file is only available for deletion if in doing so it provides sufficient free-space for the required write operation. This may mean that several of a plurality of files need to be deleted. If only a single file is available for deletion, it is deleted (step 204) and the file manager 30 updated accordingly (step 210). If multiple files are available a file is selected to be deleted to reduce fragmentation (step 206). Options for selecting the file to be deleted in this embodiment of the present invention are set out below. Next the selected file is permanently deleted (step 208) and the file manager 30 is updated accordingly (step 210).
Once it has been determined that multiple files are available for deletion, the specific file to be deleted can be chosen to optimise file defragmentation or free-space defragmentation. There can be several criteria to determine the text file to delete. One is to optimise the file fragmentation level of the files on the disk by deleting the most fragmented file among the available candidates for deletion. A better one is to optimise the fragmentation level and the free-space fragmentation level, since the next file to be written to the disk will benefit from a low free-space fragmentation.
The optimisation can be improved by taking into account not only the number of fragments, but also the sizes of them.
It is also possible to achieve an even lower fragmentation level by selecting an allocation strategy and deletion strategy that tries to optimise the fragmentation and free space fragmentation level together.
Consider the following (simplified) file system with three files on it, and some free space left.
Figure imgf000006_0001
File A consists of 2 fragments, file B of 3 fragments, and file C of 3 fragments. The free space F consists of 2 fragments. Thus in total there are 10 fragments.
Suppose files A and B are candidates for deletion having been annotated accordingly in the file manager 30, and file C should be left untouched, we need to choose between files A and B for deletion. If we delete the most file fragmented one, which is file B, we get the following result:
Figure imgf000007_0001
File A consists of 2 fragments, file C of 3 fragments, and the free space F of 4 fragments. This totals 9 fragments. Because of the high fragmentation of the free space, the next file to be stored will probably have a high fragmentation level as well. If instead we optimise on the file fragmentation level of both the files and the free-space, we would delete file A, from which we get the following result:
Figure imgf000007_0002
File B consists of 3 fragments, file C of 3 fragments and the free space F consists of 2 fragments, totalling 8 fragments. What is more, since the free-space has a low free-space fragmentation level, the next file to be stored will also have a low fragmentation level.
The determination of which file to delete whichever selection option is chosen is carried out by interrogating the file manager 30. For every file in a set of deletable files the effect of deletion on file fragmentation and free-space fragmentation is calculated.
The selection process is shown in Figure 4 of the drawings that follow. The entries in the flow diagram correspond as follows:
400 - FOR EACH FILE CALCULATE FILE FRAGMENTATION EFFECT OF DELETION
402 - FOR EACH FILE CALCULATE FREE-SPACE
FRAGMENTATION EFFECT OF DELETION
404 - FOR EACH FILE DETERMINE SUM OF FILE
FRAGMENTATION AND FREE-SPACE FRAGMENTATION 406 - NORMALISE SUM CALCULATION ACCORDING TO NUMBER
OF CLUSTERS
408 - SELECT OPTIMAL FILE
The effect on free-space fragmentation is calculated by calculating the changes the deletion (for each file) would have on the free-space fragments (step 402). New free- space fragments might appear (undesirable), but several free-space fragments can be connected by deletion creating new free-space fragments (desirable). In general, the number of free-space fragments will increase (ie a positive change).
The file that results in the lowest sum (always zero or negative) of both the fragmentation and free-space fragmentation changes is determined (step 404). Since this mechanism favours large files (being statistically more coalescing), an optional refinement is to normalise on the file size (step 406). This is done by dividing the sum above by the number of clusters in the file. The optimal file is then selected (step 408).
Alternatively, the result from step 404 can be used to select the file for deletion. For each file available for deletion, the effect of deletion on file fragmentation is calculated (step 400). File fragmentation over the completed disk would decrease by the number of fragments of the file to be deleted. This is always a negative change.

Claims

CLAIMS:
1. A method of reducing fragmentation of a digital storage device (10), characterised by the method comprising the steps of: determining that a plurality of files is available for deletion (202); selecting one of the files (206); and deleting the selected file (208) and not deleting another of the files.
2. A method of reducing fragmentation of a digital storage device according to claim 1, in which the selecting step comprises selecting the most file fragmented file for deletion.
3. A method of reducing fragmentation of a digital storage device according to claim 1, in which the selecting step comprises the steps of: determining which file deletion will optimise file defragmentation and free space defragmentation (400, 402, 404); and selecting the determined file for deletion (408).
4. A method of reducing fragmentation of a digital storage device according to claim 3, in which the selecting step a) comprises the sub-steps of: calculating for each file available for deletion the effect^on file fragmentation of its deletion (404); calculating for each file available for deletion the effect on free-space fragmentation of its deletion (402); and determining which file available for deletion results in the lowest sum from (i) and (ii) (404).
5. A method of reducing fragmentation of a digital storage device according to claim 4 in which the result of (iii) is normalised according to the file size (406).
6. A system arranged for reducing fragmentation of a digital storage device (10), characterised by the system comprising means for determining that a plurality of files is available for deletion; means for selecting one of the files; and means for deleting the selected file and not deleting another of the files.
7. A system arranged for reducing fragmentation of a digital storage device (10) according to claim 6, in which the system comprises means for selecting the most file fragmented file for deletion.
8. A system arranged for reducing fragmentation of a digital storage device (10) according to claim 6, in which the system comprises means for: determining which file deletion will optimise file defragmentation and free space defragmentation; and selecting the determined file for deletion.
9. A system arranged for reducing fragmentation of a digital storage device (10) according to claim 8, in which the means for determining which file deletion will optimise
' file defragmentation and free space defragmentation comprises the means for: calculating for each file available for deletion the effect on file fragmentation of its deletion; calculating for each file available for deletion the effect on free-space fragmentation of its deletion; and determining which file available for deletion results in the lowest sum from (i) and (ii).
10. A system arranged for reducing fragmentation of a digital storage device (10) according to claim 9, which further comprises means to normalise the result of (iii) according to the file size.
11. A system arranged for reducing fragmentation of a digital storage device according to claim 4, in which the system comprises a digital video recorder.
12. A computer program product arranged to cause a processor to execute a method according to claim 1.
PCT/IB2001/002458 2000-12-22 2001-12-07 Method and system for reducing fragmentation WO2002052396A2 (en)

Priority Applications (3)

Application Number Priority Date Filing Date Title
EP01272156A EP1423783A2 (en) 2000-12-22 2001-12-07 Method and system for reducing fragmentation
KR1020027010988A KR20020081696A (en) 2000-12-22 2001-12-07 Method and system for reducing fragmentation
JP2002553630A JP2004517399A (en) 2000-12-22 2001-12-07 Method and system for reducing fragmentation

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
EP00204793.4 2000-12-22
EP00204793 2000-12-22

Publications (2)

Publication Number Publication Date
WO2002052396A2 true WO2002052396A2 (en) 2002-07-04
WO2002052396A3 WO2002052396A3 (en) 2004-03-25

Family

ID=8172552

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/IB2001/002458 WO2002052396A2 (en) 2000-12-22 2001-12-07 Method and system for reducing fragmentation

Country Status (6)

Country Link
US (1) US6757804B2 (en)
EP (1) EP1423783A2 (en)
JP (1) JP2004517399A (en)
KR (1) KR20020081696A (en)
CN (1) CN1254735C (en)
WO (1) WO2002052396A2 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1295592C (en) * 2002-08-29 2007-01-17 国际商业机器公司 Maintaining information in one or more virtual volume aggregates comprising a plurality of virtual volumes

Families Citing this family (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6978283B1 (en) * 2001-12-21 2005-12-20 Network Appliance, Inc. File system defragmentation technique via write allocation
KR100513331B1 (en) * 2002-06-19 2005-09-07 엘지전자 주식회사 Method for temporal deleting and restoring files recorded on rewritable optical disc
US20050165856A1 (en) * 2004-01-27 2005-07-28 International Business Machines Corporation System and method for autonomic performance enhancement of storage media
US8051115B2 (en) * 2004-09-08 2011-11-01 Koby Biller Measuring fragmentation on direct access storage devices and defragmentation thereof
EP1846828A2 (en) * 2005-01-31 2007-10-24 Nxp B.V. Data processing system and method for memory defragmentation
US20080228693A1 (en) * 2005-09-26 2008-09-18 Koninklijke Philips Electronics, N.V. Recycle Bin Function
US7747578B2 (en) * 2007-03-09 2010-06-29 Microsoft Corporation Reducing database fragmentation
CN103425761B (en) * 2013-08-05 2017-02-08 珠海金山网络游戏科技有限公司 Method, system and device used for defragmentation of packed file
CN104065906B (en) * 2014-07-09 2017-02-15 珠海全志科技股份有限公司 Video recording method and device of digital video recording equipment
CN116049021B (en) * 2022-08-29 2023-10-20 荣耀终端有限公司 Storage space management method, electronic device, and computer-readable storage medium

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0694831A2 (en) * 1994-07-29 1996-01-31 Hitachi, Ltd. Computer system having storage unit provided with data compression function andmethod of management of storage area thereof

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5574907A (en) 1994-11-30 1996-11-12 Microsoft Corporation Two-pass defragmentation of compressed hard disk data with a single data rewrite
US5778392A (en) 1996-04-01 1998-07-07 Symantec Corporation Opportunistic tile-pulling, vacancy-filling method and apparatus for file-structure reorganization
US6092105A (en) * 1996-07-12 2000-07-18 Intraware, Inc. System and method for vending retail software and other sets of information to end users
US5944839A (en) * 1997-03-19 1999-08-31 Symantec Corporation System and method for automatically maintaining a computer system
US5930828A (en) 1997-03-26 1999-07-27 Executive Software International Real-time apparatus and method for minimizing disk fragmentation in a computer system
US6202121B1 (en) * 1998-04-15 2001-03-13 Microsoft Corporation System and method for improved program launch time

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0694831A2 (en) * 1994-07-29 1996-01-31 Hitachi, Ltd. Computer system having storage unit provided with data compression function andmethod of management of storage area thereof

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
"ALLOCATION PROCEDURES" IBM TECHNICAL DISCLOSURE BULLETIN, IBM CORP. NEW YORK, US, vol. 28, no. 9, 1 February 1986 (1986-02-01), pages 3866-3867, XP000715317 ISSN: 0018-8689 *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1295592C (en) * 2002-08-29 2007-01-17 国际商业机器公司 Maintaining information in one or more virtual volume aggregates comprising a plurality of virtual volumes

Also Published As

Publication number Publication date
US20020133683A1 (en) 2002-09-19
JP2004517399A (en) 2004-06-10
KR20020081696A (en) 2002-10-30
EP1423783A2 (en) 2004-06-02
WO2002052396A3 (en) 2004-03-25
CN1254735C (en) 2006-05-03
US6757804B2 (en) 2004-06-29
CN1529843A (en) 2004-09-15

Similar Documents

Publication Publication Date Title
US8180956B2 (en) Method for controlling memory card and method for controlling nonvolatile semiconductor memory
US5398142A (en) Method for eliminating file fragmentation and reducing average seek times in a magnetic disk media environment
US5734861A (en) Log-structured disk array with garbage collection regrouping of tracks to preserve seek affinity
EP1311940B1 (en) Improved space allocation in a write anywhere file system
CN102576293B (en) Data management in solid storage device and Bedding storage system
CN102511044B (en) Method for deleting the data and device thereof
CN1295591C (en) Moving data among storage units
CN108804019B (en) Data storage method and device
CN102436353B (en) Semiconductor memory controlling device
US8161240B2 (en) Cache management
KR100317691B1 (en) Efficient volume copy using pre-configuration of log structured target storage
CN103186350A (en) Hybrid storage system and hot spot data block migration method
US20020103784A1 (en) Fast data retrieval based upon contiguous consolidation of records according to frequency of access
CN108733306A (en) A kind of Piece file mergence method and device
US6757804B2 (en) Method and system for reducing fragmentation
KR100907477B1 (en) Apparatus and method for managing index of data stored in flash memory
JP6531574B2 (en) Storage device, storage device control program and storage device control method
US7797290B2 (en) Database reorganization program and method
KR100859989B1 (en) Apparatus for managing space information of flash memory and method of the same
KR20030061948A (en) : Apparatus storing information and method for controlling the File using its
US20020141296A1 (en) Method for reorganizing additional writing format storage media volume
US7672982B2 (en) Systems, methods, and computer-usable medium for defragmenting a windows NT file system volume
KR100816820B1 (en) Apparatus and method for managing buffer linked with flash memory
CN103902226A (en) Data writing method and data writing system

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A2

Designated state(s): CN JP KR

AL Designated countries for regional patents

Kind code of ref document: A2

Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR

WWE Wipo information: entry into national phase

Ref document number: 2001272156

Country of ref document: EP

ENP Entry into the national phase

Ref country code: JP

Ref document number: 2002 553630

Kind code of ref document: A

Format of ref document f/p: F

WWE Wipo information: entry into national phase

Ref document number: 018054803

Country of ref document: CN

Ref document number: 1020027010988

Country of ref document: KR

WWP Wipo information: published in national office

Ref document number: 1020027010988

Country of ref document: KR

121 Ep: the epo has been informed by wipo that ep was designated in this application
WWP Wipo information: published in national office

Ref document number: 2001272156

Country of ref document: EP

WWW Wipo information: withdrawn in national office

Ref document number: 2001272156

Country of ref document: EP