On approximating arbitrary metrices by tree metrics
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of 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 a Finite Metric by a Small Number of Tree Metrics
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Probabilistic approximation of metric spaces and its algorithmic applications
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Ordered Multicast and Distributed Swap
ACM SIGOPS Operating Systems Review
Self Stabilizing Distributed Queuing
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
A tight bound on approximating arbitrary metrics by tree metrics
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Brief announcement: concurrent counting is harder than queuing
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Dynamic analysis of the arrow distributed protocol
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
A tight bound on approximating arbitrary metrics by tree metrics
Journal of Computer and System Sciences - Special issue: STOC 2003
The complexity of low-distortion embeddings between point sets
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Self-Stabilizing Distributed Queuing
IEEE Transactions on Parallel and Distributed Systems
Self-tuning reactive diffracting trees
Journal of Parallel and Distributed Computing
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
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
Spanners of bounded degree graphs
Information Processing Letters
A provably starvation-free distributed directory protocol
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Journal of Computer and System Sciences
Distributed transactional memory for metric-space networks
DISC'05 Proceedings of the 19th international conference on Distributed Computing
| Hi-index | 0.00 |
Distributed queuing is a fundamental problem in distributed computing, arising in a variety of applications. The challenge in designing a distributed queuing algorithm is to minimize message traffic and delay.This paper gives a novel competitive analysis of the Arrow distributed queuing protocol under concurrent access. We analyze the combined latency of r simultaneous requests, and derive a competitive ratio of s · log r, where s is the stretch of a preselected spanning tree in the network.Our analysis employs a novel greedy characterization of the way the Arrow protocol orders concurrent requests, and yields a new lower bound on the quality of the nearest-neighbor heuristic for the Traveling Salesperson Problem.