Active Disk Paxos with infinitely many processes

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2002, Pages 78-87

  Chockler, Gregory ^a   Malkhi, Dahlia ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

CLIENT SERVER COMPUTER SYSTEMS; CONCURRENT ENGINEERING; DATA HANDLING; FAULT TOLERANT COMPUTER SYSTEMS; NETWORK PROTOCOLS; OBJECT ORIENTED PROGRAMMING; REQUIREMENTS ENGINEERING; STORAGE ALLOCATION (COMPUTER);

ACTIVE DISK PAXOS PROTOCOL; CONCURRENT DATA ACCESS; FINITE SHARED MEMORY; OBJECT STORAGE DEVICE CONTROLLERS; READ MODIFY WRITE OBJECTS; SHARED MEMORY ABSTRACTION; STORAGE AREA NETWORKS;

MULTIPROCESSING SYSTEMS;

EID: 0036957374     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/571825.571837     Document Type: Conference Paper

References (46)

1. Y. Afek, D.S. Greenberg, M. Merritt, and G. Taubenfeld. Computing with faulty shared objects. Journal of the ACM 42(6):1231-1274, November 1995.
2. A. Archarya, M. Uysal, and J. Saltz, Active Disks: Programming model, algorithms and evaluation. In Proceedings of the 8th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-VIII), October 1998.
3. K. Amiri, G. A. Gibson, R. Golding. Highly concurrent shared storage. In Proceedings of the International Conference on Distributed Computing Systems (ICDCS2000), April 2000.
4. T. Anderson, M. Dahlin, J. Neefe, D. Patterson, D. Roselli, R. Wang, Serverless network file systems. ACM Transactions on Computer Systems 14(1):41-79, Febraury 1996.
5. K. Birman and T. Joseph. Exploiting virtual synchrony in distributed systems. In Proceedings of the 11th Annual Symposium on Operating Systems Principles, pages 123-138, November 1987.
6. R. Boichat, P. Dutta, S. Frolund and R. Guerraoui, Deconstructing Paxos. Technical Report DSC ID:200106, Communication Systems Department (DSC), Ecole Polytechnic Federale de Lausanne (EPFL), January 2001. Available at http://dscwww.epfl.ch/EN/publications/documents/tr01_006.pdf.
7. R. Burns, Data management in a distributed file system for Storage Area Networks. PhD Thesis. Department of Computer Science, University of California, Santa Cruz, March 2000.
8. J. Burns and N. Lynch. Bounds on shared memory for mutual exclusion, Information and Computation 107(2):171-184, December 1993.
9. T. D. Chandra, V. Hadzilacos and S. Toueg. The weakest failure detector for solving consensus. Journal of the ACM 43(4): 685-722, July 1996.
10. T. D. Chandra, and S. Toueg. Unreliable failure detectors for reliable distributed systems. Journal of the ACM 43(2): 225-267, March 1996.
11. G. V. Chockler, I. Keidar and R. Vitenberg. Group communication specifications: A comprehensive study. ACM Computing Surveys 33(4): 1-43, December 2001.
12. G. Chockler, D. Malkhi, and M. K. Reiter, Backoff protocols for distributed mutual exclusion and ordering. In Proceedings of the 21st International Conference on Distributed Computing Systems, pages 11-20, April 2001.
13. B. Chor and C. Dwork, Randomization in Byzantine agreement. Advances in Computing Research, Randomness in Computation, volume 5, JAI Press, edited by S. Micali pp. 443-497, 1989.
14. F. Cristian and C. Fetzer. The Timed Asynchronous distributed system model. In Proceedings of the 28th Annual International Symposium on Fault-Tolerant Computing, June 1998.
15. R. DePrisco, B. Lampson and N. Lynch, Fundamental study: Revisiting the Paxos algorithm. Theoretical Computer Science 243:35-91, 2000.
16. D. Dolev, C. Dwork and L. Stockmeyer. On the minimal synchronism needed for distributed consensus. Journal of the ACM 34(1):77-97, January 1987.
17. C. Dwork, N. Lynch and L. Stockmeyer. Consensus in the presence of partial synchrony. Journal of the ACM 35(2):288-323, 1988.
18. M. J. Fischer, N. A. Lynch, and M. S. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM 32 (2):374-382, April 1985.
19. A. Fekete, N. Lynch and A. Shvartsman. Specifying and using a partitionable group communication service. ACM Transactions on Computer Systems 19(2): 171-216, May 2001.
20. E. Gafni and L. Lamport, Disk Paxos. In Proceedings of 14th International Symposium on Distributed Computing (DISC'2000), pages 330-344, October 2000.
21. E. Gafni, M. Merritt and G. Taubenfeld. The concurrency hierarchy, and algorithms for unbounded concurrency. In Proceedings of the 20th ACM Symposium on Principles of Distributed Computing (PODC 2001), August 2001.
22. G. A. Gibson, D. F. Nagle, K. Amiri, J. Butler, F. W. Chang, H. Gobioff, C. Hardin, E. Riedel, D. Rochberg and J. Zelenka. A cost-effective high-bandwidth storage architecture. In Proceedings of the International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS), October 1998.
23. G. A. Gibson, D. F. Nagle, K. Amiri, F. W. Chang, H. Gobioff, E. Riedel, D. Rochberg and J. Zelenka. Filesystems for Network-Attached Secure Disks. Technical Report CMU-CS-97-118, July 1997.
24. H. Gobioff, G. A. Gibson, D. Tygar. Security for Network Attached Storage Devices. Technical Report CMU-CS-97-185, October 1997.
25. S. Hotz, R. Van Meter and G. Finn. Internet protocols for network-attached peripherals. In Proceedings of the Sixth NASA Goddard Conference on Mass Storage Systems and Technologies in conjunction with 15th IEEE Symposium on Mass Storage Systems, 1998.
26. J. H. Hartman, I. Murdock and T. Spalink, The Swarm scalable storage system. In Proceedings of the 19th IEEE International Conference on Distributed Computing Systems (ICDCS '99), June 1999.
27. M. Herlihy. Wait-free synchronization. ACM Transactions on Programming Languages and Systems 11 (1):124-149, January 1991.
28. P. Jayanti, T. Chandra, and S. Toueg. Fault-tolerant wait-free shared objects. Journal of the ACM 45(3):451-500, May 1998.
29. I. Keidar and D. Dolev. Totally ordered broadcast in the face of network partitions: exploiting group communication for replication in partitionable networks. In Dependable Network Computing, Chapter D. Avresky Editor, Kluwer Academic Publications. January 2000.
30. L. Lamport. Time, clocks, and the ordering of events in distributed systems. Communications of the ACM 21(7):558-565, July 1978.
31. L. Lamport The Part-time parliament. ACM Transactions on Computer Systems 16(2):133-169, May 1998.
32. L. Lamport. Paxos made simple. Distributed Computing Column of SIGACT News 32(4):34-58, December 2001.
33. L. Lamport, R. Shostak and M. Phase. The Byzantine generals problem. ACM Transactions on Programming Languages and Systems 4(3):382-401, July 1982.
34. B. W. Lampson. How to build a highly available system using Consensus. In Proceedings of the 10th International Workshop on Distributed Algorithms (WDAG), Springer-Verlag LNCS 1151 1-17, Berlin 1996
35. E. K. Lee and C. Thekkath. Petal: Distributed virtual disks. In Proceedings of the 7th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-VII), pages 84-92, October 1996.
36. M. C. Loui and H. H. Abu-Amara. Memory requirements for agreement among unreliable asynchronous processes, In Franco P. Preparata, editor, Parallel and Distributed Computing, volume 4 of Advances in Computing Research, pages 163-183, JAI Press, Greenwhich, Conn., 1987.
37. D. Malkhi and M. K. Reiter. An architecture for survivable coordination in large-scale systems. IEEE Transactions on Knowledge and Data Engineering 12(2):187-202, March/April 2000.
38. M. Merritt and G. Taubenfeld. Computing with infinitely many processes. In Proceedings of 14th International Symposium on Distributed Computing (DISC'2000), pages 164-178, October 2000.
39. A. Mostfaoui and M. Raynal. Leader-based consensus. Parallel Processing Letters 11 (1):95-107 2001.
40. National Storage Industry Consortium. http://www.nsic.org/nasd.
41. D. Powell, editor; Group communication. Communications of the ACM 39(4), April 1996.
42. E. Riedel, C. Faloutsos, G. A. Gibson and D. Nagle. Active Disks for large-scale data processing. IEEE Computer, June 2001.
43. M. D. Skeen. Nonblocking commit protocols. In SIGMOD International Conference Management of Data, 1981.
44. M. D. Skeen. Crash Recovery in a Distributed Database System. PhD thesis, UC Berkeley, May 1982.
45. F. B. Schneider. Implementing fault-tolerant services using the state machine approach: A tutorial. ACM Computing Surveys 22(4):299-319, December 1990.
46. C. Thekkath, T. Mann and E. K. Lee. Frangipani: A scalable distributed file system. In Proceedings of the 16th ACM Symposium on Operating Systems Principles, pages 224-237, October 1997.