Dynamic analysis of the arrow distributed protocol

Theory of Computing Systems

Volumn 39, Issue 6, 2006, Pages 875-901

  Herlihy, Maurice ^a   Kuhn, Fabian ^b   Tirthapura, Srikanta ^c   Wattenhofer, Roger ^d  

^a Brown University   (United States)

^b MICROSOFT RESEARCH   (United States)

^c Iowa State University   (United States)

^d ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPETITIVE ANALYSIS; COORDINATION PROBLEMS; DISTRIBUTED MUTUAL EXCLUSION; DISTRIBUTED PROTOCOLS; DISTRIBUTED QUEUING; FINITE NUMBER; NEAREST NEIGHBORS; SPANNING TREE;

OPTIMIZATION; QUEUEING THEORY;

PARALLEL ARCHITECTURES;

EID: 33845335204     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-006-1251-9     Document Type: Conference Paper

References (20)

1. Y. Bartal. Probabilistic approximation of metric spaces and its algorithmic applications. In Proc. 31th IEEE Symposium on Foundations of Computer Science (FOCS), pages 184-193, 1996.
2. Y. Bartal. On approximating arbitrary metrics by tree metrics. In Proc. 30th Annual ACM Symposium on Theory of Computing (STOC), pages 161-168, 1998.
3. M. Charikar, C. Chekuri, A. Goel, S. Guha, and S. Plotkin. Approximating a finite metric by a small number of tree metrics. In Proc. 39th IEEE Symposium on the Foundations of Computer Science (FOCS), pages 379-388, 1998.
4. M. Demmer and M. Herlihy. The Arrow Distributed Directory Protocol. In Proc. 12th International Symposium on Distributed Computing (DISC), pages 119-133, 1998.
5. E. Dijkstra. Self stabilizing systems in spite of distributed control. Communications of the. ACM, 17:643-644, 1974.
6. Y. Emek and D. Peleg. Approximating minimum max-stretch spanning trees on unweighted graphs. In Proc. 15th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 261-270, 2004.
7. D. Ginat, D. Sleator, and R. Tarjan. A tight amortized bound for path reversal. Information Processing Letters, 31(1):3-5, 1989.
8. W. Gropp, S. Huss-Lederman, A. Lumsdaine, E. Lusk, B. Nitzberg, W. Saphir, and M. Snir. MPI - The Complete Reference, Volumes 1 and 2. Scientific and Engineering Computation Series. The MIT Press, Cambridge, MA, 2000.
9. M. Herlihy and S. Tirthapura. Self-stabilizing distributed queuing. In Proc. \5th International Symposium on Distributed Computing (DISC), pages 209-223, 2001.
10. M. Herlihy, S. Tirthapura, and R. Wattenhofer. Competitive concurrent distributed queuing. In Proc. 20th ACM Symposium on Principles of Distributed Computing (PODC), pages 127-133, 2001.
11. M. Herlihy, S. Tirthapura, and R. Wattenhofer. Ordered multicast and distributed swap. Operating Systems Review, 35(1):85-96, 2001.
12. M. Herlihy and M. Wanes. A tale of two directories: implementing distributed shared objects in Java. Concurrency: Practice and Experience, 12(7):555-572, 2000.
13. T. Hu. Optimum communication spanning trees. SIAM Journal on Computing, 3(3): 188-195, 1974.
14. F. Kuhn and R. Wattenhofer. Dynamic analysis of the arrow distributed protocol. In Proc. 16th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 294-301, 2004.
15. K. Li and P. Hudak. Memory coherence in shared virtual memory systems. ACM Transactions on Computer Systems, 7(4):321-359, 1989.
16. MPI. The official MPI standard. http://www.mpi-forum.org.
17. M. Naimi, M. Trehel, and A. Arnold. A log(n) distributed mutual exclusion algorithm based on path reversal. Journal on Parallel and Distributed Computing, 34(1):1-13, 1996.
18. D. Peleg and E. Reshef. A variant of the Arrow Distributed Directory Protocol with low average complexity. In Proc. 26th International Colloquium on Automata Languages and Programming (ICALP), pages 615-624, 1999.
19. K. Raymond. A tree-based algorithm for distributed mutual exclusion. ACM Transactions on Computer Systems, 7(1):61-77, 1989.
20. R. Rosenkrantz, R. Stearns, and P. Lewis. An analysis of several heuristics for the Traveling Salesman Problem. SIAM Journal on Computing, 6(3):563-581, 1977.