In this chapter our goal is to obtain complexity bounds for work-efficient message-passing algorithms for the Do-All problem. We require that the al- gorithms tolerate any pattern of processor crashes with at least one surviving processor. More significantly, we are interested in algorithms whose work de- grades gracefully as a function of the worst case message delay d. Here the requirement is that work must be subquadratic in n and p as long as d = o(n). Thus for our algorithms we aim to developdelay-sensitive analysis of work and message complexity. Noting again that work must be Ω(p · n) for d ≥ n, we give a comprehensive analysis for d < n, achieving substantially better
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Rights and permissions
Copyright information
© 2008 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
(2008). Asynchrony and Delay-Sensitive Bounds. In: Do-All Computing in Distributed Systems. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-69045-2_7
Download citation
DOI: https://doi.org/10.1007/978-0-387-69045-2_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-30918-7
Online ISBN: 978-0-387-69045-2
eBook Packages: Computer ScienceComputer Science (R0)