Thumbnail
Access Restriction
Subscribed

Author Chaudhuri, Soma ♦ Erlihy, Maurice ♦ Lynch, Nancy A. ♦ Tuttle, Mark R.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©2000
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword k-set agreement ♦ Spwener's Lemma ♦ Crash failure model ♦ Message-passing systems ♦ Synchronous systems ♦ Topology
Abstract We prove tight bounds on the time needed to solve <?Pub Fmt italic>k-set agreement<?Pub Fmt /italic>. In this problem, each processor starts with an arbitrary input value taken from a fixed set, and halts after choosing an output value. In every execution, at most <?Pub Fmt italic>k<?Pub Fmt /italic> distinct output values may be chosen, and every processor's output value must be some processor's input value. We analyze this problem in a synchronous, message-passing model where processors fail by crashing. We prove a lower bound of <fen lp="fl">f/k<rp post="fl">+1 degree of coordination required, and the number of faults tolerated, even in idealized models like the synchronous model. The proof of this result is interesting because it is the first to apply topological techniques to the synchronous model.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2000-09-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 47
Issue Number 5
Page Count 32
Starting Page 912
Ending Page 943


Open content in new tab

   Open content in new tab
Source: ACM Digital Library