A tree-based algorithm for distributed mutual exclusion
ACM Transactions on Computer Systems (TOCS)
A tight amortized bound for path reversal
Information Processing Letters
Memory coherence in shared virtual memory systems
ACM Transactions on Computer Systems (TOCS)
Competitive concurrent distributed queuing
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
The Arrow Distributed Directory Protocol
DISC '98 Proceedings of the 12th International Symposium on Distributed Computing
Self Stabilizing Distributed Queuing
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
The Aleph Toolkit: Support for Scalable Distributed Shared Objects
CANPC '99 Proceedings of the Third International Workshop on Network-Based Parallel Computing: Communication, Architecture, and Applications
Approximating Minimum Max-Stretch spanning Trees on unweighted graphs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Ordered Multicast and Distributed Swap
ACM SIGOPS Operating Systems Review
Self-Stabilizing Distributed Queuing
IEEE Transactions on Parallel and Distributed Systems
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Concurrent counting is harder than queuing
Theoretical Computer Science
Concurrent counting is harder than queuing
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
A provably starvation-free distributed directory protocol
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
| Hi-index | 0.00 |
Arrow is a prominent distributed protocol which globally orders requests initiated by the nodes in a distributed system. In this paper we present a dynamic analysis of the Arrow protocol. We prove that Arrow is O(log D)-competitive, where D is the diameter of the spanning tree on which Arrow operates. In addition, we show that our analysis is almost tight by proving that for all trees the competitive ratio of Arrow is Ω(log D/log log D).