Abstract
Purchase PDF (649 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (1)
Purchase PDF (70 K)
doi:10.1016/S0020-0190(97)00155-5 
Copyright © 1997 Published by Elsevier Science B.V.
Time bounds on synchronization in a periodic distributed system*1
Received 24 July 1995;
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
This paper studies the time required to solve the session problem in a new timing model, called the periodic model, for shared memory distributed systems. In the periodic model, each process runs at a constant unknown rate and different processes may run at different rates. Nearly matching upper and lower bounds are shown on the time complexity of the session problem in the model. These bounds indicate the inherent cost of synchronizing periodic processes in shared memory distributed systems, and the existence of time complexity gaps among the synchronous, periodic, and asynchronous timing models.
Author Keywords: Distributed computing; Time bounds; Session problem; Periodic model
