Competitive concurrent distributed queuing (2001) [6 citations — 4 self]
Abstract:
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 trac 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 nearestneighbor heuristic for the Traveling Salesperson Problem. 1.
Citations
| 229 | Probabilistic approximation of metric spaces and its algorithmic applications – Bartal |
| 163 | On Approximating Arbitrary Metrices by Tree Metrics – Bartal |
| 83 | An Analysis of Several Heuristics for the Traveling Salesman Problem – Rosenkrantz, Stearns, et al. - 1977 |
| 54 | Approximating a Finite Metric by a Small Number of Tree Metrics – Charikar, Chekuri, et al. |
| 19 | The Aleph Toolkit: Support for Scalable Distributed Shared Objects – Herlihy - 1999 |
| 15 | A tale of two directories: Implementing distributed shared objects in Java – Herlihy, Warres - 1999 |
| 11 | Approximating a metric by a small number of tree metrics – Charikar, Chekuri, et al. - 1998 |
| 9 | Ordered multicast and distributed swap – Herlihy, Tirthapura, et al. - 2001 |
| 8 | A variant of the arrow distributed directory protocol with low average complexity – Peleg, Reshef - 1999 |
| 7 | The arrow directory protocol – Demmer, Herlihy - 1998 |
| 3 | Ordered multicast and distributed swap. Operating Systems Review – Herlihy, Tirthapura, et al. - 2001 |

