Distributed Cooperation During the Absence of Communication

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

• Type: Conference
• Year: 2000
• Where: WDAG
• Authors: Grzegorz Malewicz, Alexander Russell, Alexander A. Shvartsman
• Keywords: Algorithms, Cooperation Problem, Processors, Processors Establish Communication, WDAG 2000