Skip to main content
SpringerLink
Log in

The arrow distributed directory protocol

  • Contributed Papers
  • Conference paper
  • First Online:
Distributed Computing (DISC 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1499))

Included in the following conference series:

Abstract

Most practical techniques for locating remote objects in a distributed system suffer from problems of scalability and locality of reference. We have devised the Arrow distributed directory protocol, a scalable and local mechanism for ensuring mutually exclusive access to mobile objects. This directory has communication complexity optimal within a factor of (1+MST-stretch(G))/2, where MST-stretch(G) is the “minimum spanning tree stretch” of the underlying network.

Supported by AFOSR agreement F30602-96-0228 DARPA OD885.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S.V. Adve and K. Gharachorloo. Shared memory consistency models: A tutorial. Technical Report ECE TR 9512 and Western Research Laboratory Research Report 95/7, Rice University ECE, Houston, TX, September 1995. A version of this paper appears in IEEE Computer, December 1996, 66–7.

    Google Scholar 

  2. B. Awerbuch, B. Berger, L. Cowen, and D. Peleg. Fast distributed network decompositions and covers. Journal of Parallel and Distributed Computing, 39(2):105–114, 15 December 1996.

    Article  MATH  Google Scholar 

  3. B. Awerbuch and D. Peleg. Online tracking of mobile users. Journal of the ACM, 42(5):1021–1058, September 1995.

    Article  MATH  MathSciNet  Google Scholar 

  4. B. Bershad, M. Zekauskas, and W.A. Sawdon. The Midway distributed shared memory system. In Proceedings of 38th IEEE Computer Society International Conference, pages 528–537, February 1993.

    Google Scholar 

  5. J.B. Carter, J.K. Bennet, and W. Zwaenepoel. Implementation and performance of Munin. In Proceedings of the 13th Symposium on Operating Systems Principles, pages 152–164, October 1991.

    Google Scholar 

  6. D. Chaiken, J. Kubiatowicz, and A. Agarwal. LimitLESS directories: A scalable cache coherence scheme. In Proceedings Of The 4th International Conference on Architectural Support for Programming Langauges and Operating Systems, pages 224–234. ACM, April 1991.

    Google Scholar 

  7. P. Fraigniaud and C. Gavoille. Memory requirement for universal routing schemes. In Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, pages 223–243. acm, August 1995.

    Google Scholar 

  8. D. Ginat. Adaptive ordering of condending processes in distributed systems. Technical Report CS-TR-2335, University of Maryland, Computer Science, October 89.

    Google Scholar 

  9. G. Graunke and S. Thakkar. Synchronization algorithms for shared-memory multiprocessors. IEEE Computer, 23(6):60–70, June 1990.

    Google Scholar 

  10. M.P. Herlihy. The Aleph toolkit: Platform-independent distributed shared memory (preliminary report). www.cs.brown.edu/~mph/aleph.

    Google Scholar 

  11. M.P. Herlihy and J.M. Wing. Linearizability: A correctness condition for concurrent objects. ACM Transactions On Programming Languages and Systems, 12(3):463–492, July 1990.

    Article  Google Scholar 

  12. K. L. Johnson, M. F. Kaashoek, and D. A. Wallach. CRL: High-Performance All-Software Distributed Shared Memory. In Proc. of the 15th ACM Symp. on Operating Systems Principles, pages 213–228, December 1995.

    Google Scholar 

  13. P. Keleher, S. Dwarkadas, A. L. Cox, and W. Zwaenepoel. TreadMarks: Distributed Shared Memory on Standard Workstations and Operating Systems. In Proc. of the Winter 1994 USENIX Conference, pages 115–131, January 1994.

    Google Scholar 

  14. U. Legedza, D. Wetherhall, and J. Guttag. Improving the performance of distributed applications using active networks. Submitted to IEEE INFOCOMM, San Francisco, April 1998.

    Google Scholar 

  15. K. Li and P. Hudak. Memory coherence in shared virtual memory systems. ACM Transactions on Computer Systems, 7(4):321–359, November 1987.

    Article  Google Scholar 

  16. N.A. Lynch and M.R. Tuttle. Hierarchical correctness proofs for distributed algorithms. Technical Report MIT/LCS/TM-387, MIT Laboratory For Computer Science, April 1987.

    Google Scholar 

  17. N.A. Lynch and M.R. Tuttle. An introduction to input/output automata. Technical Report MIT/LCS/TM-373, MIT Laboratory For Computer Science, November 1988.

    Google Scholar 

  18. M. NaÏmi, M. Tréhel, and A. Arnold. A log(n) distributed mutual exclusion algorithm based on path reveral. Journal of Parallel and Distributed Computing, 34:1–13, 1996.

    Article  Google Scholar 

  19. R. S. Nikhil. Cid: A Parallel, “Shared Memory” C for Distributed-Memory Machines. In Proc. of the 7th Int'l Workshop on Languages and Compilers for Parallel Computing, August 1994.

    Google Scholar 

  20. D. Peleg. Distance-dependent distributed directories. Information and Computation, 103(2):270–298, April 1993.

    Article  MATH  MathSciNet  Google Scholar 

  21. D. Peleg and E. Upfal. A trade-off between space and efficiency for routing tables. Journal of the ACM, 36:43–52, July 1989.

    Article  MathSciNet  Google Scholar 

  22. C.G. Plaxton, R. Rajaman, and A.W. Richa. Accessing nearby copies of replicated objects in a distributed environment. In Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 311–321, June 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Tera Computer Company, 98102, Seattle, WA

    Michael J. Demmer

  2. Computer Science Department, Brown University, 02912, Providence, RI

    Maurice P. Herlihy

Authors
  1. Michael J. Demmer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Maurice P. Herlihy
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Shay Kutten

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Demmer, M.J., Herlihy, M.P. (1998). The arrow distributed directory protocol. In: Kutten, S. (eds) Distributed Computing. DISC 1998. Lecture Notes in Computer Science, vol 1499. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0056478

Download citation

  • DOI: https://doi.org/10.1007/BFb0056478

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65066-9

  • Online ISBN: 978-3-540-49693-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation