DFS: A De-Fragmented File System

  • Authors:
  • W. H. Ahn;K. Kim;Y. Choi;D. Park

  • Affiliations:
  • -;-;-;-

  • Venue:
  • MASCOTS '02 Proceedings of the 10th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
  • Year:
  • 2002

Quantified Score

Hi-index 0.01

Visualization

Abstract

Small file accesses are still limited by disk head move-menton modern disk drives with the high disk bandwidth.Small file performance can be improved by grouping andclustering, each of which places multiple files in a direc-toryand places blocks of the same file on disks contigu-ously.These schemes make it possible for file systems touse large data transfers in accessing small files, reducingdisk accesses. However, as file systems become aged, disksbecome too fragmented to support the grouping and clus-teringof small files. This fragmentation makes it difficultfor file systems to take advantage of large data transfers,increasing disk I/Os. To offer a solution to this problem,we describe a De-fragmented File System (DFS). By usingdata cached in memory, DFS relocates and clusters datablocks of small fragmented files in a dynamic manner. Be-sides,DFS clusters related small files in the same directoryat contiguous disk locations. Measurements of DFS imple-mentationshow that the techniques alleviate file fragmenta-tionsignificantly and, in particular, performance for smallfile reads exceeds that of a traditional file system by 78%.