Formulating suitable models of cooperative computation goes hand in hand with the study of algorithms and their efficiency. In this chapter we formalize the modeling framework used in the sequel to study problems of cooperative task execution in distributed environments under several ad- versarial settings. The framework includes abstract models of computation, definitions of adversity, the problem of distributed cooperation, viz. the Do-All problem, and the complexity measures used to evaluate the efficiency of algorithms solving the Do-All problems in various settings and to establish the corresponding lower bounds.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2008 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
(2008). Distributed Cooperation Problems: Models and Definitions. In: Do-All Computing in Distributed Systems. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-69045-2_2
Download citation
DOI: https://doi.org/10.1007/978-0-387-69045-2_2
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)