ACM Transactions on Computer Systems (TOCS)
Disk file allocation based on the buddy system
ACM Transactions on Computer Systems (TOCS)
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Mining block correlations to improve storage performance
ACM Transactions on Storage (TOS)
Upper bound for defragmenting buddy heaps
LCTES '05 Proceedings of the 2005 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems
Scalability in the XFS file system
ATEC '96 Proceedings of the 1996 annual conference on USENIX Annual Technical Conference
| Hi-index | 0.00 |
In most general purpose file systems, data blocks are scattered throughout the disk so as not to require arbitrary chunks of contiguous disk space. To be able to find the nth data block in a file, both an index and indexing function must exist. The classical Unix File System (UFS) paradigm calls for a tree of block pointers, where the leaf nodes are data blocks in the file, and all other nodes are file system meta-data. In more highly-optimized file systems, b trees are used to index extents (groups of contiguous blocks). In these systems, the number of disk accesses required depends upon the depth of the associated indexing tree. Fragmentation is also an ongoing issue with file system design, decreasing overall file system performance. For read efficiency, direct pointers to all blocks in every file would be ideal, but also far too costly in terms of space.In this paper, a framework is proposed that optimizes file system performance by: decreasing the number of disk seeks to one for each file seek, forcing extent sizes to grow as file sizes grow, and providing a sound environment for efficiently decreasing file system fragmentation.