Distributed cooperation during the absence of communication

Grzegorz Greg Malewicz, Alexander Russell, Alex A. Shvartsman

Research output: Chapter in Book/Report/Conference proceedingConference contribution

19 Scopus citations


This paper presents a study of a distributed cooperation problem under the assumption that processors may not be able to communicate for a prolonged time. The problem for n processors is defined in terms of t tasks that need to be performed efficiently and that are known to all processors. The results of this study characterize the ability of the processors to schedule their work so that when some processors establish communication, the wasted (redundant) work these processors have collectively performed prior to that time is controlled. The lower bound for wasted work presented here shows that for any set of schedules there are two processors such that when they complete t1 and t2 tasks respectively the number of redundant tasks is Ω(t1t2/t). For n = t and for schedules longer than √n, the number of redundant tasks for two or more processors must be at least 2. The upper bound on pairwise waste for schedules of length √n is shown to be 1. Our efficient deterministic schedule construction is motivated by design theory. To obtain linear length schedules, a novel deterministic and efficient construction is given. This construction has the property that pairwise wasted work increases gracefully as processors progress through their schedules. Finally our analysis of a random scheduling solution shows that with high probability pairwise waste is well behaved at all times: specifically, two processors having completed t1 and t2 tasks, respectively, are guaranteed to have no more than t1t2/t + A redundant tasks, where (formula presented).

Original languageEnglish (US)
Title of host publicationDistributed Computing-14th InternationalConference, DISC 2000, Proceedings
EditorsMaurice Herlihy
PublisherSpringer Verlag
Number of pages15
ISBN (Print)3540411437
StatePublished - 2000
Externally publishedYes
Event14th International Conference on Distributed Computing, DISC 2000 - Toledo, Spain
Duration: Oct 4 2000Oct 6 2000

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference14th International Conference on Distributed Computing, DISC 2000

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Distributed cooperation during the absence of communication'. Together they form a unique fingerprint.

Cite this