Unbounded speed variability in distributed communication systems

Published

Conference Paper

© 1982 ACM. This paper concerns the fundamental problem of synchronizing communication between distributed processes whose speeds (steps per real time unit) vary dynamically. Communication must be established in matching pairs, which are mutually willing to communicate. We show how to implement a distributed local scheduler to find these pairs. The only means of synchronization "are boolean "flag" variables, each of which can be written by only one process and read by at most one other process. No global bounds in the speeds of processes are assumed. Processes with speed zero are considered dead. However, when their speed is nonzero then they execute their programs correctly. Dead processes do not harm our algorithms' performance with respect to pairs of other running processes. When the rate of change of the ratio of speeds of neighbour processes (i.e., relative acceleration) is bounded, then any two of these processes will establish communication within a constant number of steps of the slowest process with high likelihood. Thus our implementation has the property of achieving relative real time response. We can use our techniques to solve other problems such as resource allocation and implementation of parallel languages such as CSP and ADA. Note that we do not have any probability assumptions about the system behavior, although our algorithms use the technique of probabilistic choice.

Full Text

Duke Authors

Cited Authors

  • Reif, J; Spirakis, P

Published Date

  • January 25, 1982

Published In

Start / End Page

  • 46 - 56

International Standard Serial Number (ISSN)

  • 0730-8566

International Standard Book Number 10 (ISBN-10)

  • 0897910656

Digital Object Identifier (DOI)

  • 10.1145/582153.582159

Citation Source

  • Scopus