ACM Transactions on Computer Systems (TOCS)
The design of the UNIX operating system
The design of the UNIX operating system
Measurements of a distributed file system
SOSP '91 Proceedings of the thirteenth ACM symposium on Operating systems principles
The design and implementation of a log-structured file system
ACM Transactions on Computer Systems (TOCS)
A trace-driven analysis of the UNIX 4.2 BSD file system
Proceedings of the tenth ACM symposium on Operating systems principles
A study of file sizes and functional lifetimes
SOSP '81 Proceedings of the eighth ACM symposium on Operating systems principles
File system logging versus clustering: a performance comparison
TCON'95 Proceedings of the USENIX 1995 Technical Conference Proceedings
Heuristic cleaning algorithms in log-structured file systems
TCON'95 Proceedings of the USENIX 1995 Technical Conference Proceedings
File system aging—increasing the relevance of file system benchmarks
SIGMETRICS '97 Proceedings of the 1997 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Improving the performance of log-structured file systems with adaptive methods
Proceedings of the sixteenth ACM symposium on Operating systems principles
Deciding when to forget in the Elephant file system
Proceedings of the seventeenth ACM symposium on Operating systems principles
Soft updates: a solution to the metadata update problem in file systems
ACM Transactions on Computer Systems (TOCS)
Information and control in gray-box systems
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Extending Heterogeneity to RAID Level 5
Proceedings of the General Track: 2002 USENIX Annual Technical Conference
Taking advantage of heterogeneity in disk arrays
Journal of Parallel and Distributed Computing
yFS: A Journaling File System Design for Handling Large Data Sets with Reduced Seeking
FAST '03 Proceedings of the 2nd USENIX Conference on File and Storage Technologies
A performance-oriented energy efficient file system
SNAPI '04 Proceedings of the international workshop on Storage network architecture and parallel I/Os
An approach to virtual allocation in storage systems
ACM Transactions on Storage (TOS)
Enhancements to the fast filesystem to support multi-terabyte storage systems
BSDC'03 Proceedings of the BSD Conference 2003 on BSD Conference
Embedded inodes and explicit grouping: exploiting disk bandwidth for small files
ATEC '97 Proceedings of the annual conference on USENIX Annual Technical Conference
hFS: a hybrid file system prototype for improving small file and metadata performance
Proceedings of the 2nd ACM SIGOPS/EuroSys European Conference on Computer Systems 2007
ACM Transactions on Storage (TOS)
A multiple-file write scheme for improving write performance of small files in Fast File System
Information Processing Letters
Ffsck: The Fast File-System Checker
ACM Transactions on Storage (TOS)
Efficient journaling writeback schemes for reliable and high-performance storage systems
Personal and Ubiquitous Computing
Hi-index | 0.00 |
The 4.4BSD file system includes a new algorithm for allocating disk blocks to files. The goal of this algorithm is to improve file clustering, increasing the amount of sequential I/O when reading or writing files, thereby improving file system performance. In this paper we study the effectiveness of this algorithm at reducing file system fragmentation. We have created a program that artificially ages a file system by replaying a workload similar to that experienced by a real file system. We used this program to evaluate the effectiveness of the new disk allocation algorithm by replaying ten months of activity on two file systems that differed only in the disk allocation algorithms that they used. At the end of the ten month simulation, the file system using the new allocation algorithm had approximately half the fragmentation of a similarly aged file system that used the traditional disk allocation algorithm. Measuring the performance difference between the two file systems by reading and writing the same set of files on the two systems showed that this decrease in fragmentation improved file write throughput by 20% and read throughput by 32%. In certain test cases, the new allocation algorithm provided a performance improvement of greater than 50%.