Concurrent counting is harder than queuing

Authors:
Costas Busch;Srikanta Tirthapura
Affiliations:
Department of Computer Science, Louisiana State University, 286 Coates Hall, Baton Rouge, LA 70803, USA;Department of Electrical and Computer Engineering, Iowa State University, 2215, Coover Hall, Ames, IA 50011, USA
Venue:
Theoretical Computer Science
Year:
2010

Citing 10
Cited 0

Upper and lower time bounds for parallel random access machines without simultaneous writes

SIAM Journal on Computing
A tree-based algorithm for distributed mutual exclusion

ACM Transactions on Computer Systems (TOCS)
Counting networks

Journal of the ACM (JACM)
An inherent bottleneck in distributed counting

Journal of Parallel and Distributed Computing - Parallel and distributed data structures
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
Adding Networks

DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Ordered Multicast and Distributed Swap

ACM SIGOPS Operating Systems Review
Dynamic analysis of the arrow distributed protocol

Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
The cost of concurrent, low-contention Read&Modify&Write

Theoretical Computer Science - Foundations of software science and computation structures

Quantified Score

Hi-index	5.23

Visualization

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.