Advertisement

Time-message trade-offs for the weak unison problem

Extended abstract
  • Amos Israeli
  • Evangelos Kranakis
  • Danny Krizanc
  • Nicola Santoro
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 778)

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 tradeoffs 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.

1980 Mathematics Subject Classification

68Q99 

CR Categories

C.2.1 

Key words and phrases

Anonymous network Balanced Chordalrings t-step protocol Non-oblivious Oblivious Time-message complexity Unbalanced Unison Wakeup protocol Weak unison 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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.Google Scholar
  2. 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.)Google Scholar
  3. 3.
    J.-M. Couvreur, N. Francez and M. Gouda, “Asynchronous Unison”, preprint.Google Scholar
  4. 4.
    P. J. Davis, “Circulant Matrices”, John Wiley and Sons, 1979.Google Scholar
  5. 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.), SpringerVerlag, 1990, pp. 479–487.)Google Scholar
  6. 6.
    Unison, Canon and Sluggish Clocks in Networks Controlled by a Synchronizer. To appear in Mathematical Systems Theory.Google Scholar
  7. 7.
    S. Even and S. Rajsbaum, “The Use of Synchronizer Yields Maximum Computation Rate in Distributed Networks”, STOC 1990, pages 95–105.Google Scholar
  8. 8.
    M. J. Fischer, S. Moran, S. Rudich and G. Taubenfeld, “The Wakeup Problem”, STOC 1990, pages 106–116.Google Scholar
  9. 9.
    M. Gouda and T. Herman, “Stabilizing Unison”, Information Processing Letters, Vol. 35, No. 4, pages 171–175, 1990.Google Scholar
  10. 10.
    Ki Hang Kim, “Boolean Matrix Theory and Applications”, Marcel Dekker Inc., New York, 1982.Google Scholar
  11. 11.
    D. Knuth, “The Art Computer Programming: Fundamental Algorithms”, Addison Wesley, 1973.Google Scholar
  12. 12.
    N. Santoro, “Sense of Direction, Topological Awareness and Communication Complexity”, ACM SIGACT News, Number 16, pages 50–56, 1984.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Amos Israeli
    • 1
  • Evangelos Kranakis
    • 2
  • Danny Krizanc
    • 2
  • Nicola Santoro
    • 2
  1. 1.Department of Electrical EngineeringTechnionHaifaIsrael
  2. 2.School of Computer ScienceCarleton UniversityOttawaCanada

Personalised recommendations