Locality in distributed computations

  • Authors:
  • David K. Garnick;A. Toni Cohen

  • Affiliations:
  • Department of Computer and Information Sciences, University of Delaware, Newark, Delaware;Department of Computer and Information Sciences, University of Delaware, Newark, Delaware

  • Venue:
  • CSC '88 Proceedings of the 1988 ACM sixteenth annual conference on Computer science
  • Year:
  • 1988

Quantified Score

Hi-index 0.00

Visualization

Abstract

The defining characteristic of a distributed system is the (temporal) distance between components; communication time is non-trivial compared to processing time. Because of this, the design of efficient distributed computations involves trade-offs between maximizing the amount of parallelism and minimizing communication costs. We argue that any sort of centralized control, whether in user-level algorithms or at the systems level, impairs efficiency. We then introduce a scheme for automatic process synchronization that meets our locality criterion.