TY - GEN

T1 - Distributed cooperation during the absence of communication

AU - Malewicz, Grzegorz Greg

AU - Russell, Alexander

AU - Shvartsman, Alex A.

N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2000.

PY - 2000

Y1 - 2000

N2 - 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).

AB - 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).

UR - http://www.scopus.com/inward/record.url?scp=23044522331&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=23044522331&partnerID=8YFLogxK

U2 - 10.1007/3-540-40026-5_8

DO - 10.1007/3-540-40026-5_8

M3 - Conference contribution

AN - SCOPUS:23044522331

SN - 3540411437

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 119

EP - 133

BT - Distributed Computing-14th InternationalConference, DISC 2000, Proceedings

A2 - Herlihy, Maurice

PB - Springer Verlag

T2 - 14th International Conference on Distributed Computing, DISC 2000

Y2 - 4 October 2000 through 6 October 2000

ER -