On using network attached disks as shared memory

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn 22, Issue , 2003, Pages 315-324

  Aguilera, Marcos K ^a   Englert, Burkhard ^b   Gafni, Eli ^b  

^a HEWLETT PACKARD LABORATORIES   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMMUNICATION; COMPUTER PROGRAMMING; COMPUTER PROGRAMMING LANGUAGES; EVALUATION; HARD DISK STORAGE; OPTIMIZATION;

SHARED MEMORY REGISTERS; STORAGE AREA NETWORKS;

COMPUTER SCIENCE;

EID: 1142305199     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/872035.872082     Document Type: Conference Paper

References (36)

1. A. Acharya, M. Uysal and J. Saltz. Active Disks: Programming model, algorithms and evaluation. Proc. of the 8th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-VIII), pp. 81-91, 1998.
2. Y. Afek, H. Attiya, A. Fouren, G. Stupp and D. Touitou. Long-Lived Renaming made adaptive. Proc. of 18th Annual ACM Symp. on Principles of Distributed Computing: 91-103, May 1999.
3. Y. Afek, H. Attiya, G. Stupp and D. Touitou. Adaptive long-lived renaming using bounded memory. Proc. of the 40th IEEE Ann. Symp. on Foundations of Computer Science, pages 262-272, October 1999.
4. Y. Afek, D. S. Greenberg, M. Merritt and G. Taubenfeld. Computing with faulty shared memory, in Proceedings of the 11th Annual ACM Symposium on Principles of Distributed Computing. (Vancouver, B.C., Canada). ACM New York, pp. 47-58, 1992.
5. Y. Afek, D. S. Greenberg, M. Merritt and G. Taubenfeld. Computing with faulty shared objects. J. ACM, 42, 6, 1231-1274, 1995.
6. Y. Afek, D. Dauber and D. Touitou. Wait-free made fast. Proc. of the 27th Ann. ACM Symp. on Theory of Computing:538-541, May 1995.
7. Y. Afek and M. Merritt. Fast, wait-free (2k - 1)-renaming. In Proc. of the 18th Ann. ACM Symp. on Principles of Distributed Computing, pages 105-112, May 1999.
8. Y. Afek, M. Merritt, G. Taubenfeld and D. Touitou. Disentangling multi-object operations. In Proc. of 16th Annual ACM Symp. on Principles of Distributed Computing, pages 111-120, August 1997.
9. Y. Afek, G. Stupp and D. Touitou. Long lived adaptive collect with applications. Proc. of the 40th IEEE Ann. Symp. on Foundations of Computer Science, pages 262-272, October 1999.
10. Y. Afek, G. Stupp and D. Touitou. Long lived adaptive splitter and applications. Unpublished manuscript, December 1999.
11. Y. Afek, G. Stupp and D. Touitou. Long lived and adaptive atomic snapshot and immediate snapshot. Proc. of the 19th Ann. ACM Symp. on Principles of Distributed Computing, pages 71-80, 2000.
12. J. Anderson and Y.-J. Kim. Adaptive mutual exclusion with local spinning. Proceedings of the 14th International Conference, DISC 2000, pages 29-43, October 2000.
13. D. Angluin. Local and global properties in networks of processors. In Proceedings of the 12th ACM Symposium on Theory of Computing (STOC 1980), pages 82-93.
14. J. Aspnes, G. Shah and J. Shah. Wait free consensus with infinite arrivals. Proc. of the 34th Annual ACM Symposium on the Theory of Computing, pages 524-533, May 2002.
15. H. Attiya and V. Bortnikov. Adaptive and efficient mutual exclusion. In Proceedings of the 19th Annual ACM Symposium on Principles of Distributed Computing (PODC 2000), pages 91-100, 2000.
16. H. Attiya and E. Dagan. Universal operations: Unary versus binary. In Proc. 15th Annual ACM Symp. on Principles of Distributed Computing, pages 223-232, May 1996.
17. H. Attiya and A. Fouren. Adaptive wait-free algorithms for lattice agreement and renaming. In Proc. 17th Annual ACM Symp. on Principles of Distributed Computing, pages 277-286, June 1998.
18. H. Attiya and A. Fouren. Adaptive long-lived renaming with read and write operations. Technical Report 0956, Faculty of Computer Science, Technion, Haifa, 1999.
19. H. Attiya and A. Fouren. Algorithms adaptive to point contention. JACM, 2001, submitted for publication.
20. H. Attiya, A. Fouren and E. Gafni. An adaptive collect algorithm with applications. Distributed Computing, to appear.
21. J. Burns and N. Lynch. Bounds on shared memory for mutual exclusion. Information and Computation 107(2):171-184, December 1993.
22. G. Chockler and D. Malkhi. Active Disk Paxos with infinitely many processes. Proceedings of the 21st Annual ACM Symposium on Principles of Distributed Computing (PODC 2002), pages 78-87, 2002.
23. M. Choy and A.K. Singh. Adaptive solutions to the mutual exclusion problem. Distributed Computing, 8(1), pages 1-17, 1994.
24. E. W. Dijkstra. Solution of a problem in concurrent programming control. Communications of the ACM, 8(9):569, September 1965.
25. A. Fekete, M. Frans Kaashoek and N. Lynch. Implementing sequentially consistent shared objects using broadcast and point-to-point communication. Journal of the ACM, 45(1), pp. 35-69, 1998.
26. E. Gafni. A simple algorithmic characterization of uniform solvability. Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2002), pp. 228-237, 2002.
27. E. Gafni and L. Lamport. Disk Paxos.In M. Herlihy, editor, Proceedings of the 14th International Conference on Distributed Computing (DISC 2000), volume 1914 of Lecture Notes in Computer Science, pages 330-344, 2000.
28. E. Gafni, M. Merritt and G. Taubenfeld. The concurrency hierarchy and algorithms for unbounded concurrency.In Proceedings of the 20th Annual ACM Symposium on Principles of Distributed Computing (PODC 2001), pages 161-169, 2001.
29. 2) steps. Proceedings of the 15th International Conference on Distributed Computing (DISC 2001), pages 123-135, 2001.
30. A. Itai and M. Roden. Symmetry breaking in distributed networks. Information and Computation, 88(1): 60-87, 1990.
31. P. Jayanti, T. D. Chandra and S. Toeug. Fault-Tolerant wait-free shared objects. Journal of the ACM, Vol. 45, No. 3, pp. 451-500, 1998.
32. L. Lamport. A fast mutual exclusion algorithm. ACM Transactions on Computer Systems, 5(1):1-11, 1987.
33. M. Merritt and G. Taubenfeld. Speeding Lamport's fast mutual exclusion algorithm. Information Processing Letters, 45:137-142, 1993.
34. M. Moir and J. H. Anderson. Wait-free algorithms for fast, long-lived renaming. Sci. Comput. Programming, 25(1):1-39, October 1995.
35. G.L. Peterson. Time efficient adaptive mutual exclusion algorithms. Unpublished manuscript, 2001.
36. E. Riedel, C. Faloutsos, G. A. Gibson and D. Nagle. Active Disks for large scale data processing. IEEE Computer, June 2001.