Time-message trade-offs for the weak unison problem

Authors:
Amos Israeli;Evangelos Kranakis;Danny Krizanc;Nicola Santoro
Affiliations:
Technion, Department of Electrical Engineering, Haifa, 32000, Israel;Carleton University, School of Computer Science, Ottawa, ON, K1S 5B6, Canada;Carleton University, School of Computer Science, Ottawa, ON, K1S 5B6, Canada;Carleton University, School of Computer Science, Ottawa, ON, K1S 5B6, Canada
Venue:
Nordic Journal of Computing
Year:
1997

Citing 7
Cited 4

Computing on an anonymous ring

Journal of the ACM (JACM)
Unison in distributed networks

Sequences
Stabilizing unison

Information Processing Letters
The use of a synchronizer yields maximum computation rate in distributed networks

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
The wakeup problem

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Sense of direction, topological awareness and communication complexity

ACM SIGACT News

Time and Message Optimal Leader Election in Asynchronous Oriented Complete Networks

MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Sense of direction in distributed computing

Theoretical Computer Science - Special issue: Distributed computing
On the message complexity of global computations

OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Learning a ring cheaply and fast

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

A set of anonymous processors is interconnected forming a complete synchronous network with sense of direction. Weak unison is the problem where all processors want to enter the same state (in our case "wakeup" state) in the absence of a global start-up signal. As measure of complexity of the protocols considered we use the "bits" times "lag" measure, i.e. the total number of (wakeup) messages transmitted throughout the execution of the protocol times the number of steps which are sufficient in order for all the processors to wakeup. We study trade-offs in the complexity of such algorithms under several conditions on the behavior of the processors (oblivious, non-oblivious, balanced, etc) and provide tight upper and lower bounds on the time × #messages measure.