Time-message trade-offs for the weak unison problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 778 LNCS, Issue , 1994, Pages 167-178

  Israeli, Amos ^a   Kranakis, Evangelos ^b   Krizanc, Danny ^b   Santoro, Nicola ^b  

^a Department of Electrical Engineering ^*  (Israel)

^b CARLETON UNIVERSITY   (Canada)

Author keywords

Anonymous network; Balanced; Chordal rings; Non oblivious; Oblivious; T step protocol; Tiine message complexity; Unbalanced; Unison; Wakeup protocol; Weak unison

Indexed keywords

COMMERCE; COMPLEX NETWORKS; ECONOMIC AND SOCIAL EFFECTS;

ANONYMOUS NETWORKS; BALANCED; CHORDAL RINGS; MESSAGE COMPLEXITY; NON-OBLIVIOUS; OBLIVIOUS; UNBALANCED; UNISON; WEAK UNISON;

COMPUTATIONAL COMPLEXITY;

EID: 85013904542     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-57811-0_14     Document Type: Conference Paper

References (12)

1. A. Arora, S. Dolev and M. Gouda, “Maintaining Digital Clocks in Step”, Proc. of the 5th International Workshop on Distributed Algorithms, 1991, Parallel Processing Letters, Vol. 1, No. 1, pp. 11-18, 1991.
2. H. Attiya and M. Snir and M. Warmuth, “Computing on an Anonymous Ring”, Journal of the ACM, 35 (4), 1988. (Short version has appeared in proceedings of the 4th Annual ACM Symposium on Principles of Distributed Computation, 1985, 845-875.)
3. J.-M. Couvreur, N. Francez and M. Gouda, “Asynchronous Unison”, preprint.
4. P. J. Davis, “Circulal/t Matrices”, John Wiley and Sons, 1979.
5. S. Even and S. Rajsbaum, “Unison in Distributed Networks”, in “Sequences, Combinatorics, Compression, Security and Transmission”, in Sequences, Combinatorics, Compression, Security and Transmission, R.M. Capocelli (ed.), Springer-Verlag, 1990, pp. 479-487.
6. Unison, Canon and Sluggish Clocks in Networks Controlled by a Synchronizer. To appear in Mathematical Systems Theory.
7. S. Even and S. Rajsbaum, “The Use of Synchronizer Yields Maximum Computation Rate in Distributed Networks”, STOC 1990, pages 95-105.
8. M. J. Fischer, S. Moran, S. Rudich and G. Taubenfeld, “The Wakeup Problem”, STOC 1990, pages 106-116.
9. M. Gouda and T. Herman, “Stabilizing Unison”, Information Processing Letters, Vol. 35, No. 4, pages 171-175, 1990.
10. Ki Hang Kim, “Boolean Matrix Theory and Apphcations”, Marcel Dekker Inc., New York, 1982.
11. D. Knuth, “The Art Computer Programming: Fundamental Algorithms”, Addison Wesley, 1973.
12. N. Santoro, “Sense of Direction, Topological Awareness and Communication Complexity”, ACM SIGACT News, Number 16, pages 50-56, 1984.