A decentralized algorithm for erasure-coded virtual disks

Proceedings of the International Conference on Dependable Systems and Networks

Volumn , Issue , 2004, Pages 125-134

  Frølund, Svend ^a   Merchant, Arif ^a   Saito, Yasushi ^a   Spence, Susan ^a   Veitch, Alistair ^a  

^a HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER HARDWARE; COMPUTER SYSTEM RECOVERY; DATA ACQUISITION; DATA STORAGE EQUIPMENT; DISKS (STRUCTURAL COMPONENTS); MATHEMATICAL MODELS;

ATOMIC-REGISTER CONSTRUCTIONS; DISTRIBUTED DISK SYSTEMS; VIRTUAL DISKS;

CODES (SYMBOLS);

EID: 4544294537     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/dsn.2004.1311883     Document Type: Conference Paper

References (15)

1. M. K. Aguilera and S. Frolund. Strict linearizability and the power of aborting. Technical Report HPL-2003-241, HP Labs, November 2003.
2. K. Amiri, G. A. Gibson, and R. Golding. Highly concurrent shared storage. In International Conference on Distributed Computing Systems (ICDCS), 2000.
3. S. Asami. Reducing the cost of system administration of a disk storage system built from commodity components. PhD thesis, University of California, Berkeley, May 2000. Tech. Report, no. UCB-CSD-00-1100.
4. H. Attiya, A. Bar-Noy, and D. Dolev. Sharing memory robustly in message-passing systems. Journal of the ACM, 42(1):124-142, 1995.
5. J. Bison, L. Girod, and D. Estrin. Pine-grained network time synchronization using reference broadcasts. In Proceedings of the 5th symposium on operatings systems design and implementation (OSDI), pages 147-163. USENIX, 2002.
6. S. Frolund, A. Merchant, Y. Saito, S. Spence, and A. Veitch. FAB: enterprise storage systems on a shoestring. In Proceedings of the Ninth Workshop on Hot Topics in Operating Systems (HOTOSIX). USENIX, 2003. to appear.
7. S. Frolund, A. Merchant, Y. Saito, S. Spence, and A. Veitch. A decentralized algorithm for erasure-coded virtual disks. Technical Report HPL-2004-46, HP Labs, April 2004.
8. M. Herlihy and J. Wing. Linearizability: a correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems, 12(3):463-492, July 1990.
9. iSCSI draft 20 specification, http://www.diskdrive.com-/reading-room/ standards.html, 2003.
10. N. A. Lynch and A. A. Shvartsman. Robust emulation of shared memory using dynamic quorum-acknowledged broadcasts. In Proceedings of the IEEE Symposium on Fault-Tolerant Computing Systems (FTCS), pages 272-281, 1997.
11. N. A. Lynch and A. A. Shvartsman. Rambo: A reconfigurable atomic memory service for dynamic networks. In 16th Int. Conf. on Dist. Computing (DISC), October 2002.
12. D. A. Patterson, G. Gibson, and R. H. Katz. A case for redundant arrays of inexpensive disks (raid). In H. Boral and P.-A. Larson, editors, Proceedings of 1988 SIGMOD International Conference on Management of Data, pages 109-16, Chicago, IL, 1-3 June 1988.
13. J. S. Plank. A tutorial on Reed-Solomon coding for faulttolerance in RAID-like systems. Software - Practice and Experience, 27(9), 1997.
14. S. Reah, P. Eaton, D. Geels, H. Weatherspoon, B. Zhao, and J. Kubiatowics. Pond: the OceanStore prototype. In Conference and File and Storage Technologies (FAST). USENIX, mar 2003.
15. J. J. Wylie, G. R. Goodson, G. R. Ganger, and M. K. Reiter. Efficient byzantine-tolerant erasure-coded storage. In Proceedings of the International Conference on Dependable Systems and Networks (DSN), 2004.