D-SPTF: decentralized request distribution in brick-based storage systems
Pages 37 - 47
Abstract
Distributed Shortest-Positioning Time First (D-SPTF) is a request distribution protocol for decentralized systems of storage servers. D-SPTF exploits high-speed interconnects to dynamically select which server, among those with a replica, should service each read request. In doing so, it simultaneously balances load, exploits the aggregate cache capacity, and reduces positioning times for cache misses. For network latencies expected in storage clusters (e.g., 10--200μs), D-SPTF performs as well as would a hypothetical centralized system with the same collection of CPU, cache, and disk resources. Compared to popular decentralized approaches, D-SPTF achieves up to 65% higher throughput and adapts more cleanly to heterogenous server capabilities.
References
[1]
Khalil Amiri, Garth A. Gibson, and Richard Golding. Highly concurrent shared storage. International Conference on Distributed Computing Systems (Taipei, Taiwan, 10--13 April 2000), pages 298--307. IEEE Computer Society, 2000.]]
[2]
Remzi H. Arpaci-Dusseau, Eric Anderson, Noah Treuhaft, David E. Culler, Jospeh M. Hellerstein, David Patterson, and Kathy Yelick. Cluster I/O with River: making the fast case common. Workshop on Input/Output in Parallel and Distributed Systems (Atlanta, GA, May, 1999), pages 10--22. ACM Press, 1999.]]
[3]
John S. Bucy and Gregory R. Ganger. The DiskSim simulation environment version 3.0 reference manual. Technical Report CMU--CS--03--102. Department of Computer Science Carnegie-Mellon University, Pittsburgh, PA, January 2003.]]
[4]
M. D. Dahlin, R. Y. Wang, T. E. Anderson, and D. A. Patterson. Cooperative caching: using remote client memory to improve file system performance. Symposium on Operating Systems Design and Implementation (Monterey, CA, 14--17 November 1994), pages 267--280. IEEE, 1994.]]
[5]
Zoran Dimitrijevic, Raju Rangaswami, and Edward Chang. Design and implementation of semi-preemptible IO. Conference on File and Storage Technologies (San Francisco, CA, 31 March--02 April 2003), pages 145--158. USENIX Association, 2003.]]
[6]
The DiskSim Simulation Environment (Version 3.0). http://www.pdl.cmu.edu/DiskSim/index.html.]]
[7]
EqualLogic Inc. PeerStorage Overview, 2003. http://www.equallogic.com/pages/products_technology.htm.]]
[8]
Svend Frolund, Arif Merchant, Yasushi Saito, Susan Spence, and Alistair Veitch. FAB: enterprise storage systems on a shoestring. Hot Topics in Operating Systems (Lihue, HI, 18--21 May 2003), pages 133--138. USENIX Association, 2003.]]
[9]
Gregory R. Ganger, John D. Strunk, and Andrew J. Klosterman. Self-* Storage: brick-based storage with automated administration. Technical Report CMU-CS-03-178. Carnegie Mellon University, August 2003.]]
[10]
Jim N. Gray. Notes on data base operating systems. In, volume 60, pages 393--481. Springer-Verlag, Berlin, 1978.]]
[11]
HP Labs SSP traces. http://www.hpl.hp.com/research/ssp.]]
[12]
Hui I. Hsiao and David J. DeWitt. A performance study of three high availability data replication strategies. Parallel and Distributed Information Systems International Conference (Miami Beach, FL, 04--06 December 1991), pages 18--28. IEEE, 1991.]]
[13]
Hui-IHsiao and David J. DeWitt. Chained declustering: a new availability strategy for multiprocessor database machines. International Conference on Data Engineering (Los Angeles, CA), 1990.]]
[14]
IBM Almaden Research Center. Collective Intelligent Bricks, August, 2003. http://www.almaden.ibm.com/StorageSystems/autonomic_storage/CIB/index.shtml.]]
[15]
David M. Jacobson and John Wilkes. Disk scheduling algorithms based on rotational position. Technical report HPL--CSP--91--7. Hewlett-Packard Laboratories, Palo Alto, CA, 24 February 1991, revised 1 March 1991.]]
[16]
Edward K. Lee and Chandramohan A. Thekkath. Petal: distributed virtual disks. Architectural Support for Programming Languages and Operating Systems (Cambridge, MA, 1--5 October 1996). Published as SIGPLAN Notices, 31(9):84--92, 1996.]]
[17]
Sai-Lai Lo. Ivy: a study on replicating data for performance improvment. TR HPL-CSP-90-48. Hewlett Packard, December 1990.]]
[18]
Christopher R. Lumb, Jiri Schindler, and Gregory R. Ganger. Freeblock scheduling outside of disk firmware. Conference on File and Storage Technologies (Monterey, CA, 28--30 January 2002), pages 275--288. USENIX Association, 2002.]]
[19]
Vivek S. Pai, Mohit Aron, Gaurav Banga, Michael Svendsen, Peter Druschel, Willy Zwaenepoel, and Erich Nahum. Locality-aware request distribution in cluster-based network servers. Architectural Support for Programming Languages and Operating Systems (San Jose, CA, 3--7 October 1998). Published as SIGPLAN Notices, 33(11):205--216, November 1998.]]
[20]
David A. Patterson, Garth Gibson, and Randy H. Katz. A case for redundant arrays of inexpensive disks (RAID). ACM SIGMOD International Conference on Management of Data (Chicago, IL), pages 109--116, 1--3 June 1988.]]
[21]
Steven Schuchart. High on Fibre. Network Computing, 1 December 2002.]]
[22]
Margo Seltzer, Peter Chen, and John Ousterhout. Disk scheduling revisited. Winter USENIX Technical Conference (Washington, DC, 22--26 January 1990), pages 313--323, 1990.]]
[23]
Storage Performance Council traces. http://traces.cs.umass.edu/storage/.]]
[24]
Geoffrey M. Voelker, Eric J. Anderson, Tracy Kimbrel, Michael J. Feeley, Jeffrey S. Chase, Anna R. Karlin, and Henry M. Levy. Implementing cooperative prefetching and caching in a globally-managed memory system. ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems (Madison, WI). Published as Performance Evaluation Review, 26(1):33--43, June 1998.]]
[25]
John Wilkes, Richard Golding, Carl Staelin, and Tim Sullivan. The HP AutoRAID hierarchical storage system. ACM Transactions on Computer Systems, 14(1):108--136, February 1996.]]
[26]
Xiang Yu, Benjamin Gum, Yuqun Chen, Randolph Y. Wang, Kai Li, Arvind Krishnamurthy, and Thomas E. Anderson. Trading capacity for performance in a disk array. Symposium on Operating Systems Design and Implementation (San Diego, CA, 23--25 October 2000), pages 243--258. USENIX Association, 2000.]]
Index Terms
- D-SPTF: decentralized request distribution in brick-based storage systems
Recommendations
D-SPTF: decentralized request distribution in brick-based storage systems
ASPLOS '04Distributed Shortest-Positioning Time First (D-SPTF) is a request distribution protocol for decentralized systems of storage servers. D-SPTF exploits high-speed interconnects to dynamically select which server, among those with a replica, should service ...
D-SPTF: decentralized request distribution in brick-based storage systems
ASPLOS XI: Proceedings of the 11th international conference on Architectural support for programming languages and operating systemsDistributed Shortest-Positioning Time First (D-SPTF) is a request distribution protocol for decentralized systems of storage servers. D-SPTF exploits high-speed interconnects to dynamically select which server, among those with a replica, should service ...
D-SPTF: decentralized request distribution in brick-based storage systems
ASPLOS '04Distributed Shortest-Positioning Time First (D-SPTF) is a request distribution protocol for decentralized systems of storage servers. D-SPTF exploits high-speed interconnects to dynamically select which server, among those with a replica, should service ...
Comments
Information & Contributors
Information
Published In
October 2004296 pages
Copyright © 2004 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 07 October 2004
Published in SIGARCH Volume 32, Issue 5
Check for updates
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations26Total Citations
- 818Total Downloads
- Downloads (Last 12 months)4
- Downloads (Last 6 weeks)0
Reflects downloads up to 25 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in