Request Bridging and Interleaving: Improving the Performance of Small Synchronous Updates under Seek-Optimizing Disk Subsystems

Write-through caching in modern disk drives enables the protection of data in the event of power failures as well as from certain disk errors when the write-back cache does not. Host system can achieve these benefits at the price of significant performance degradation, especially for small disk writes. We present new block-level techniques to address the performance problem of write-through caching disks. Our techniques are strongly motivated by some interesting results when the disk-level caching is turned off. By extending the conventional request merging, request bridging increases the request size and amortizes the inherent delays in the disk drive across more bytes of data. Like sector interleaving, request interleaving rearranges requests to prevent the disk head from missing the target sector position in close proximity, and thus reduces disk latency. We have evaluated our block-level approach using a variety of I/O workloads and shown that it increases disk I/O throughput by up to about 50%. For some real-world workloads, the disk performance is comparable or even superior to that of using the write-back disk cache. In practice, our simple yet effective solutions achieve better tradeoffs between data reliability and disk performance when applied to write-through caching disks.

[1]  Peter Druschel,et al.  Anticipatory scheduling: a disk scheduling framework to overcome deceptive idleness in synchronous I/O , 2001, SOSP.

[2]  R. S. Fabry,et al.  A fast file system for UNIX , 1984, TOCS.

[3]  Yongdai Kim,et al.  Intelligent storage: Cross-layer optimization for soft real-time workload , 2006, TOS.

[4]  Andrea C. Arpaci-Dusseau,et al.  Analysis and Evolution of Journaling File Systems , 2005, USENIX Annual Technical Conference, General Track.

[5]  Gregory R. Ganger,et al.  Blurring the Line Between Oses and Storage Devices (CMU-CS-01-166) , 2001 .

[6]  Margo I. Seltzer,et al.  Disk Scheduling Revisited , 1990 .

[7]  Jeffrey Katcher,et al.  PostMark: A New File System Benchmark , 1997 .

[8]  Xiaoning Ding,et al.  DULO: an effective buffer cache management scheme to exploit both temporal and spatial locality , 2005, FAST'05.

[9]  John Wilkes,et al.  An introduction to disk drive modeling , 1994, Computer.

[10]  Dharmendra S. Modha,et al.  WOW: wise ordering for writes - combining spatial and temporal locality in non-volatile caches , 2005, FAST'05.

[11]  Yale N. Patt,et al.  On-line extraction of SCSI disk drive parameters , 1995, SIGMETRICS '95/PERFORMANCE '95.

[12]  Gregory R. Ganger,et al.  Automated Disk Drive Characterization , 1999 .

[13]  Gregory R. Ganger,et al.  Automated disk drive characterization (poster session) , 2000, SIGMETRICS '00.

[14]  Mendel Rosenblum,et al.  The design and implementation of a log-structured file system , 1991, SOSP '91.

[15]  John Wilkes,et al.  Disk scheduling algorithms based on rotational position , 1991 .

[16]  Gregory R. Ganger,et al.  Soft Updates: A Technique for Eliminating Most Synchronous Writes in the Fast Filesystem , 1999, USENIX Annual Technical Conference, FREENIX Track.

[17]  Young-Jin Kim,et al.  I/O Performance Optimization Techniques for Hybrid Hard Disk-Based Mobile Consumer Devices , 2007, IEEE Transactions on Consumer Electronics.

[18]  Robert S. Fabry,et al.  A fast file system for UNIX , 1984, TOCS.

[19]  Martin Pohlack,et al.  Rotational-position-aware real-time disk scheduling using a dynamic active subset (DAS) , 2003, RTSS 2003. 24th IEEE Real-Time Systems Symposium, 2003.

[20]  Gregory R. Ganger,et al.  Track-Aligned Extents: Matching Access Patterns to Disk Drive Characteristics , 2002, FAST.

[21]  Yale N. Patt,et al.  Scheduling algorithms for modern disk drives , 1994, SIGMETRICS 1994.

[22]  Andrea C. Arpaci-Dusseau,et al.  Semantically-Smart Disk Systems , 2003, FAST.

[23]  B. Dees Native command queuing - advanced performance in desktop storage , 2005, IEEE Potentials.

[24]  Shankar Pasupathy,et al.  An analysis of latent sector errors in disk drives , 2007, SIGMETRICS '07.

[25]  Alma Riska,et al.  Evaluating Block-level Optimization Through the IO Path , 2007, USENIX Annual Technical Conference.

[26]  Zoran Dimitrijevic,et al.  Diskbench : User-level Disk Feature Extraction Tool , 2004 .

[27]  Tom Shanley,et al.  PCI System Architecture , 1993 .

[28]  Kai Shen,et al.  Competitive prefetching for concurrent sequential I/O , 2007, EuroSys '07.

[29]  John Wilkes,et al.  UNIX Disk Access Patterns , 1993, USENIX Winter.

[30]  Margo I. Seltzer,et al.  Journaling Versus Soft Updates: Asynchronous Meta-data Protection in File Systems , 2000, USENIX Annual Technical Conference, General Track.

[31]  Gregory R. Ganger,et al.  Freeblock Scheduling Outside of Disk Firmware , 2002, FAST.

[32]  Xiaoning Ding,et al.  DiskSeen: Exploiting Disk Layout and Access History to Enhance I/O Prefetch , 2007, USENIX Annual Technical Conference.

[33]  Heon Young Yeom,et al.  Shedding Light in the Black-Box : Structural Modeling of Modern Disk Drives , 2007, 2007 15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems.