Efficient distributed algorithms by using the archimedean time assumption

  • Paul Spirakis
  • Basil Tampakas
Contributed Papers Distributed Algorithms
Part of the Lecture Notes in Computer Science book series (LNCS, volume 294)


This work examines the effect of limited asynchrony on three fundamental problems of distributed computation: The problem of symmetry breaking in a logical ring, that of mutual exclusion and the problem of readers and writers. We assume our distributed system to be Archimedean in the sense that processors know upper and lower bounds on the message delays and processor speeds. We use the knowledge of those bounds to get algorithms for the above mentioned problems which well improve the efficiency of algorithms presented by previous research. For the symmetry breaking problem we get a protocolo which admits arbitrary initiation, and uses only linear number of message bits and linear time on the average. For the mutual exclusion problem we break the lower bound on the number of messages which holds in case of unrestricted asynchrony. We also find an important difference between Archimedean and Synchronous networks. Our algorithms are practical in the sense that any existing distributed system up to now follows the Archimedean time assumption.


Symmetry Breaking Critical Section Mutual Exclusion Message Complexity Interprocess Communication 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Angluin, 80]
    D. Angluin, "Local and global properties in networks of processes", Proc. 12th ACM Symp. on Theory of Computing, April 1980, 82–93.Google Scholar
  2. [Attiya et al, 85]
    C. Attiya, M. Snir, M. Warminth, "Computing on an anonymous ring", Proc. 4th ACM Symp. on Principles of Distributed Computing, Aug. 1985, 196–204.Google Scholar
  3. [Courtois et al, 71]
    Courtois P.J., Heymans F. and Parnas D.L., "Concurrent Control with Readers and Writers" CACM Vol. 14, No 10, 66–668.Google Scholar
  4. [Frederickson, Lynch, 84]
    G. Frederickson, N. Lynch, "The impact of synchronous communication on the problem of electing a leader in a ring", Proc. 16th ACM Symp. on Theory of Computing, April 1984, 493–503.Google Scholar
  5. [Frederickson, Santoro, 86]
    G. Frederickson, N. Santoro, "Breaking Symmetry in Synchronous Networks", VLSI Algorithms and Architectures, AWOC 1986, Lecture Notes in Computer Science, No 227, Springer-Verlag, pp. 26–33.Google Scholar
  6. [Gafni, 85]
    E. Gafni, "Improvements in the time complexity of two message-optimal election algorithms", Proc. 4th ACM Symp. on Principles of Distributed Computing, Aug. 1985, pp. 175–185.Google Scholar
  7. [Itai, Rodeh, 81]
    A. Itai, M. Rodeh, "Symmetry breaking in distributive networks", Proc. 22nd IEEE Symp. on Foundations of Computer Science, Oct. 1981, 150–158.Google Scholar
  8. [Lamport, 77]
    Lamport L., "Concurrent reading and writing", CACM Vol. 20, No. 11, 806–811.Google Scholar
  9. [Lamport, 78]
    Lamport L., "Time clocks and the ordering of events in a distributed system", CACM Vol. 21, No. 7, 558–565.Google Scholar
  10. [van Leeuwen, Santoro, Urrutia, Zaks, 87]
    J. van Leeuwen, N. Santoro, J. Urrutia and S. Zaks, "Guessing Games and Distributed Computations in Synchronous Networks", 14th ICALP, LNCS No. 267, pp. 347–356, Springer-Verlag, 1987.Google Scholar
  11. [Overmars, Santoro, 86]
    M. Overmars, N. Santoro, "An improved election algorithm for synchronous rings", preliminary draft, Carleton University, March 1986.Google Scholar
  12. [Raynal, 86]
    M. Raynal, "Algorithms for Mutual Exclusion", The MIT Press, 1986.Google Scholar
  13. [Reif, Spirakis, 84]
    J. Reif, P. Spirakis, "Real Time Synchronization of Interprocess Communication", ACM Transactions of Programming Languages and Systems, April 1984.Google Scholar
  14. [Reif, Spirakis, 85]
    J. Reif, P. Spirakis, "Unbounded Speed Variability in Distributed Systems", SIAM Journal of Computing, February 1985.Google Scholar
  15. [Ricart, Agrawala, 81]
    G. Ricart, A. Agrawala, "An Optimal Algorithm for Mutual Exclusion in Computer Networks", CACM, Vol. 24, No. 1, Jan. 1981.Google Scholar
  16. [Santoro, Rotem, 85]
    N. Santoro, D. Rotem, "On the Complexity of distributed elections is synchronous graphs", Proc. 11th Int. Workshop on Graphtheoretic Concepts in Computer Science, June 1985, 337–346.Google Scholar
  17. [Vitányi, 84]
    P. Vitányi, "Distributed elections in an Archimedean ring of processors", Proc. 16th ACM Symp. on Theory of Computing, April 1984, 542–547.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Paul Spirakis
    • 1
    • 2
  • Basil Tampakas
    • 1
  1. 1.Computer Tech. InstituteGreece
  2. 2.Courant Inst. Math. SciencesUSA

Personalised recommendations