### Abstract

We compare the complexities of two fundamental distributed coordination problems, distributed counting and distributed queuing, in a concurrent setting. In both distributed counting and queuing, processors in a distributed system issue operations which are organized into a total order. In counting, each participating processor receives the rank of its operation in the total order, where as in queuing, a processor receives the identity of its predecessor in the total order. Many coordination applications can be solved using either distributed counting or queuing, and it is useful to know which of counting or queuing is the easier problem. Our results show that concurrent counting is harder than concurrent queuing on a variety of processor interconnection topologies, including high and low diameter graphs. For all these topologies, we show that the concurrent delay complexity of a particular solution to queuing, the arrow protocol, is asymptotically smaller than a lower bound on the complexity of any solution to counting.

Original language | English (US) |
---|---|

Pages (from-to) | 3823-3833 |

Number of pages | 11 |

Journal | Theoretical Computer Science |

Volume | 411 |

Issue number | 43 |

DOIs | |

State | Published - Oct 9 2010 |

### Keywords

- Distributed algorithms
- Distributed counting
- Distributed data structures
- Distributed queuing

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

## Fingerprint Dive into the research topics of 'Concurrent counting is harder than queuing'. Together they form a unique fingerprint.

## Cite this

*Theoretical Computer Science*,

*411*(43), 3823-3833. https://doi.org/10.1016/j.tcs.2010.07.002