article · 1996

A comparison of FFS disk allocation policies

Cited by 48Abstract and details only

Abstract

A new disk allocation algorithm, added to a recent version of the UNIX Fast File System, attempts to improve file layout by exploiting the clusters of free space that are available in the file system. In this paper I study the effectiveness of this algorithm at reducing file system fragmentation. To do this, I have created a program that artificially ages a file system by replaying a workload similar to that experienced by a real file system. To evaluate the effectiveness of the new disk allocation algorithm, I use this program to replay four months of activity on two file systems that differ only in the disk allocation algorithms that they use. At the end of the four month simulation, the file system that used the new allocation algorithm had 3 % more file data blocks that were contiguously laid out. 1

Cite this paper

APA 7

Smith, K. A., & Seltzer, M. (1996). A comparison of FFS disk allocation policies.

MLA 9

Smith, Keith A., and Margo Seltzer. “A comparison of FFS disk allocation policies.” 1996, p. 2.

Chicago

Smith, Keith A., and Margo Seltzer. 1996. “A comparison of FFS disk allocation policies.”

Harvard

Smith, K.A. and Seltzer, M. (1996) ‘A comparison of FFS disk allocation policies’.

BibTeX

@article{smith1996comparison,
  title = {{A comparison of FFS disk allocation policies}},
  author = {Smith, Keith A. and Seltzer, Margo},
  pages = {2},
  year = {1996}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.