In traditional file systems, data clustering and grouping have improved small file performance. These schemes make it possible for file systems to use large data transfers in accessing small files, reducing disk I/Os. However, as file systems age, disks become too fragmented to support the grouping and clustering. To offer a solution to this problem, we describe a De-Fragmented File System (DFFS), which gradually alleviates fragmentation of small files. By using data cached in memory, DFFS dynamically relocates blocks of small fragmented files, clustering them on the disks contiguously. In addition, DFFS relocates small related files in the same directory, grouping them at contiguous disk locations.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Woo Hyun AHN, Daeyeon PARK, "Mitigating Data Fragmentation for Small File Accesses" in IEICE TRANSACTIONS on Information,
vol. E86-D, no. 6, pp. 1126-1133, June 2003, doi: .
Abstract: In traditional file systems, data clustering and grouping have improved small file performance. These schemes make it possible for file systems to use large data transfers in accessing small files, reducing disk I/Os. However, as file systems age, disks become too fragmented to support the grouping and clustering. To offer a solution to this problem, we describe a De-Fragmented File System (DFFS), which gradually alleviates fragmentation of small files. By using data cached in memory, DFFS dynamically relocates blocks of small fragmented files, clustering them on the disks contiguously. In addition, DFFS relocates small related files in the same directory, grouping them at contiguous disk locations.
URL: https://global.ieice.org/en_transactions/information/10.1587/e86-d_6_1126/_p
Copy
@ARTICLE{e86-d_6_1126,
author={Woo Hyun AHN, Daeyeon PARK, },
journal={IEICE TRANSACTIONS on Information},
title={Mitigating Data Fragmentation for Small File Accesses},
year={2003},
volume={E86-D},
number={6},
pages={1126-1133},
abstract={In traditional file systems, data clustering and grouping have improved small file performance. These schemes make it possible for file systems to use large data transfers in accessing small files, reducing disk I/Os. However, as file systems age, disks become too fragmented to support the grouping and clustering. To offer a solution to this problem, we describe a De-Fragmented File System (DFFS), which gradually alleviates fragmentation of small files. By using data cached in memory, DFFS dynamically relocates blocks of small fragmented files, clustering them on the disks contiguously. In addition, DFFS relocates small related files in the same directory, grouping them at contiguous disk locations.},
keywords={},
doi={},
ISSN={},
month={June},}
Copy
TY - JOUR
TI - Mitigating Data Fragmentation for Small File Accesses
T2 - IEICE TRANSACTIONS on Information
SP - 1126
EP - 1133
AU - Woo Hyun AHN
AU - Daeyeon PARK
PY - 2003
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E86-D
IS - 6
JA - IEICE TRANSACTIONS on Information
Y1 - June 2003
AB - In traditional file systems, data clustering and grouping have improved small file performance. These schemes make it possible for file systems to use large data transfers in accessing small files, reducing disk I/Os. However, as file systems age, disks become too fragmented to support the grouping and clustering. To offer a solution to this problem, we describe a De-Fragmented File System (DFFS), which gradually alleviates fragmentation of small files. By using data cached in memory, DFFS dynamically relocates blocks of small fragmented files, clustering them on the disks contiguously. In addition, DFFS relocates small related files in the same directory, grouping them at contiguous disk locations.
ER -