ACM Transactions on Computer Systems (TOCS)
A database cache for high performance and fast restart in database systems
ACM Transactions on Database Systems (TODS)
The design and implementation of a log-structured file system
ACM Transactions on Computer Systems (TOCS)
RAID: high-performance, reliable secondary storage
ACM Computing Surveys (CSUR)
Scheduling algorithms for modern disk drives
SIGMETRICS '94 Proceedings of the 1994 ACM SIGMETRICS conference on Measurement and modeling of computer systems
You Don't Know Jack about Disks
Queue - Storage
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Ext3cow: a time-shifting file system for regulatory compliance
ACM Transactions on Storage (TOS)
More Than an Interface---SCSI vs. ATA
FAST '03 Proceedings of the 2nd USENIX Conference on File and Storage Technologies
Atropos: A Disk Array Volume Manager for Orchestrated Use of Disks
FAST '04 Proceedings of the 3rd USENIX Conference on File and Storage Technologies
On multidimensional data and modern disks
FAST'05 Proceedings of the 4th conference on USENIX Conference on File and Storage Technologies - Volume 4
File system design for an NFS file server appliance
WTEC'94 Proceedings of the USENIX Winter 1994 Technical Conference on USENIX Winter 1994 Technical Conference
Scalability in the XFS file system
ATEC '96 Proceedings of the 1996 annual conference on USENIX Annual Technical Conference
The design and implementation of a DCD device driver for Unix
ATEC '99 Proceedings of the annual conference on USENIX Annual Technical Conference
Avoiding the disk bottleneck in the data domain deduplication file system
FAST'08 Proceedings of the 6th USENIX Conference on File and Storage Technologies
FlexVol: flexible, efficient file volume virtualization in WAFL
ATC'08 USENIX 2008 Annual Technical Conference on Annual Technical Conference
HYDRAstor: a Scalable Secondary Storage
FAST '09 Proccedings of the 7th conference on File and storage technologies
Finding a needle in Haystack: facebook's photo storage
OSDI'10 Proceedings of the 9th USENIX conference on Operating systems design and implementation
MaSM: efficient online updates in data warehouses
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
QMD: exploiting flash for energy efficient disk arrays
Proceedings of the Seventh International Workshop on Data Management on New Hardware
Survey and analysis of disk scheduling methods
ACM SIGARCH Computer Architecture News
FAST'12 Proceedings of the 10th USENIX conference on File and Storage Technologies
GPUstore: harnessing GPU computing for storage systems in the OS kernel
Proceedings of the 5th Annual International Systems and Storage Conference
Systems research and innovation in data ONTAP
ACM SIGOPS Operating Systems Review
| Hi-index | 0.00 |
This paper introduces proximal I/O, a new technique for improving random disk I/O performance in file systems. The key enabling technology for proximal I/O is the ability of disk drives to retire multiple I/Os, spread across dozens of tracks, in a single revolution. Compared to traditional update-in-place or write-anywhere file systems, this technique can provide a nearly seven-fold improvement in random I/O performance while maintaining (near) sequential on-disk layout. This paper quantifies proximal I/O performance and proposes a simple data layout engine that uses a flash memory-based write cache to aggregate random updates until they have sufficient density to exploit proximal I/O. The results show that with cache of just 1% of the overall disk-based storage capacity, it is possible to service 5.3 user I/O requests per revolution for random updates workload. On an aged file system, the layout can sustain serial read bandwidth within 3% of the best case. Despite using flash memory, the overall system cost is just one third of that of a system with the requisite number of spindles to achieve the equivalent number of random I/O operations.