Data I/O Optimization in Storage Systems

  • Di Wang
  • Ji-wu Shu
  • Meiming Shen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3252)


One of the most effective ways to improve the I/O performance of a storage system is to enhance the hard disk’s read/write ability. We used an I/O processing node in the storage network to optimize data organization and I/O performance. By analyzing existing algorithms and different requirements for read and write operations, we designed an improved optimizing algorithm to schedule disk I/O requests. It selects the closest request in queue to process first, and uses an EW mechanism to modify write locations. Typically, the algorithm can reduce a disk’s average response time by about 15%-17%. This paper also presents an EW stripe and copy algorithm that can improve I/O performance using parallel disk accesses, and enhance reliability by data duplication. With one copy preserved, it can reduce the response time by about 30%.


Schedule Algorithm Storage System Average Response Time Disk Array Read Request 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Tang, D.: Storage area networking-the network behind the server. Technical Report, Gadzoox Microsystems (1997)Google Scholar
  2. 2.
    Popovici, F.I., Arpaci-Dusseau, A.C., Arpaci-Dusseau, R.H.: Robust. Portable I/O Scheduling with the Disk Mimic. In: The 2003 USENIX Annual Technical Conference (2003)Google Scholar
  3. 3.
    Uysal, M., Merchant, A., Alvarez, G.A.: Using MEMS-based storage in disk arrays. In: The Proceedings of the 2nd USENIX Conference on File and Storage Technologies (March 2003)Google Scholar
  4. 4.
    C.: Volume Management in SAN Environment. In: ICPADS 2001, pp. 500–508 (1997)Google Scholar
  5. 5.
    Huang, L.: Stonehenge: A High Performance Virtualized Storage Cluster With QoS Guarantees. State University of New York at Stony Brook (2002)Google Scholar
  6. 6.
    Zhang, C., Yu, X., Krishnamurthy, A., Wang, R.Y.: Configuring and Scheduling an Eager-Writing Disk Array for a Transaction Processing Workload. In: FAST 2002, pp. 289–304 (2002)Google Scholar
  7. 7.
    Brickmann, A., Salzwedel, K., Scheideler, C.: Efficient,distributed data placement strategies for storage area networks. In: The proceedings of the 12th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 119–128. ACM press, New York (2000) (extended abstract)Google Scholar
  8. 8.
    Honicky, R.J., Miller, E.L.: A fast algorithm for online placement and reorganization of replicated data. In: 17th International Parallel and Distributed Processing Symposium, IPDPS (2003)Google Scholar
  9. 9.
    Shu, J.W., Yao, J., Fu, C.D., Zheng, W.M.: Highly efficient FC-SAN based on load stream. In: Zhou, X., Xu, M., Jähnichen, S., Cao, J. (eds.) APPT 2003. LNCS, vol. 2834, pp. 31–40. Springer, Heidelberg (2003) (printed)CrossRefGoogle Scholar
  10. 10.
    English, R.M., Stepanov, A.A.: Loge: a selforganizing storage device. In: The Proceedings of USENIX Winter 1992 Technical Conference, USENIX, January 1992, pp. 237–251 (1992)Google Scholar
  11. 11.
    Palekar, A.A., Russell, R.D.: Design and Implementation of a Linux SCSI Target for Storage Area Networks. In: The Proceedings of the 5th Annual Linux Showcase & Conference (November 2001)Google Scholar
  12. 12.
    Bucy, J.S., Ganger, G.R.: The Disksim Simulation Environment Version 3.0 Reference Manual. CMC-CS-03-102 (January 2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Di Wang
    • 1
  • Ji-wu Shu
    • 1
  • Meiming Shen
    • 1
  1. 1.Department of Computer Science and TechnologyTsinghua UniversityBeijingChina

Personalised recommendations