Abstract
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.
This research was funded in part by the NSF contract DCR 8503497 and by the Ministry of Industry, Energy and Technology of Greece.
Preview
Unable to display preview. Download preview PDF.
References
D. Angluin, "Local and global properties in networks of processes", Proc. 12th ACM Symp. on Theory of Computing, April 1980, 82–93.
C. Attiya, M. Snir, M. Warminth, "Computing on an anonymous ring", Proc. 4th ACM Symp. on Principles of Distributed Computing, Aug. 1985, 196–204.
Courtois P.J., Heymans F. and Parnas D.L., "Concurrent Control with Readers and Writers" CACM Vol. 14, No 10, 66–668.
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.
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.
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.
A. Itai, M. Rodeh, "Symmetry breaking in distributive networks", Proc. 22nd IEEE Symp. on Foundations of Computer Science, Oct. 1981, 150–158.
Lamport L., "Concurrent reading and writing", CACM Vol. 20, No. 11, 806–811.
Lamport L., "Time clocks and the ordering of events in a distributed system", CACM Vol. 21, No. 7, 558–565.
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.
M. Overmars, N. Santoro, "An improved election algorithm for synchronous rings", preliminary draft, Carleton University, March 1986.
M. Raynal, "Algorithms for Mutual Exclusion", The MIT Press, 1986.
J. Reif, P. Spirakis, "Real Time Synchronization of Interprocess Communication", ACM Transactions of Programming Languages and Systems, April 1984.
J. Reif, P. Spirakis, "Unbounded Speed Variability in Distributed Systems", SIAM Journal of Computing, February 1985.
G. Ricart, A. Agrawala, "An Optimal Algorithm for Mutual Exclusion in Computer Networks", CACM, Vol. 24, No. 1, Jan. 1981.
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.
P. Vitányi, "Distributed elections in an Archimedean ring of processors", Proc. 16th ACM Symp. on Theory of Computing, April 1984, 542–547.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Spirakis, P., Tampakas, B. (1988). Efficient distributed algorithms by using the archimedean time assumption. In: Cori, R., Wirsing, M. (eds) STACS 88. STACS 1988. Lecture Notes in Computer Science, vol 294. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035849
Download citation
DOI: https://doi.org/10.1007/BFb0035849
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18834-6
Online ISBN: 978-3-540-48190-4
eBook Packages: Springer Book Archive