Optimal scheduling for disconnected cooperation

G. G. Malewicz, A. Russell, A. Shvartsman

Research output: Contribution to conferencePaperpeer-review


We consider a distributed environment consisting of n processors that need to perform t tasks. We assume that communication is initially unavailable and that processors begin work in isolation. At some unknown point of time an unknown collection of processors may establish communication. Before processors begin communication they execute tasks in the order given by their schedules. Our goal is to schedule work of isolated processors so that when communication is established for the first time, the number of redundantly executed tasks is controlled. We quantify worst case redundancy as a function of processor advancements through their schedules. In this work we refine and simplify an extant deterministic construction for schedules with n < t, and we develop a new analysis of its waste. The new analysis shows that for any pair of schedules, the number of redundant tasks can be controlled for the entire range of t tasks. Our new result is asymptotically optimal: the tails of these schedules are within a 1 + O(n-1/4) factor of the lower bound. We also present two new deterministic constructions one for t ≥ n, and the other for t ≥ n3/2, which substantially improve pairwise waste for all prefixes of length t/√n, and offer near optimal waste for the tails of the schedules. Finally, we present bounds for waste of any collection of k ≥ 2 processors for both deterministic and randomized constructions.

Original languageEnglish (US)
Number of pages3
StatePublished - 2001
Externally publishedYes
Event20th Annual ACM Symposium on Principles of Distributed Computing - Newport, Rhode Island, United States
Duration: Aug 26 2001Aug 29 2001


Conference20th Annual ACM Symposium on Principles of Distributed Computing
Country/TerritoryUnited States
CityNewport, Rhode Island

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications


Dive into the research topics of 'Optimal scheduling for disconnected cooperation'. Together they form a unique fingerprint.

Cite this