Affordable Access

Publisher Website

Time bounds on synchronization in a periodic distributed system

Authors
Journal
Information Processing Letters
0020-0190
Publisher
Elsevier
Publication Date
Volume
64
Issue
2
Identifiers
DOI: 10.1016/s0020-0190(97)00155-5
Keywords
  • Distributed Computing
  • Time Bounds
  • Session Problem
  • Periodic Model

Abstract

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.

There are no comments yet on this publication. Be the first to share your thoughts.