Affiliation:
1. The University of Michigan, Ann Arbor, MI
Abstract
Disk performance is increasingly limited by its head positioning latencies, i.e., seek time and rotational delay. To reduce the head positioning latencies, we propose a novel technique that
dynamically
places copies of data in file system's
free blocks
according to the disk access patterns observed at runtime. As one or more replicas can now be accessed in addition to their original data block, choosing the "nearest" replica that provides fastest access can significantly improve performance for disk I/O operations.We implemented and evaluated a prototype based on the popular Ext2 file system. In our prototype, since the file system layout is modified only by using the free/unused disk space (hence the name
Free Space File System
, or FS
2
), users are completely oblivious to how the file system layout is modified in the background; they will only notice performance improvements over time. For a wide range of workloads running under Linux, FS
2
is shown to reduce disk access time by 41--68% (as a result of a 37--78% shorter seek time and a 31--68% shorter rotational delay) making a 16--34% overall user-perceived performance improvement. The reduced disk access time also leads to a 40--71% energy savings per access.
Publisher
Association for Computing Machinery (ACM)
Reference37 articles.
1. Adaptive block rearrangement
2. Generating representative Web workloads for network and server performance evaluation
3. Transactional Processing Performance Council http://www.tpc.org/tpcw. Transactional Processing Performance Council http://www.tpc.org/tpcw.
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献