Abstract
This paper defines the basic notions of local and non-local tasks, and determines the minimum information about failures that is necessary to solve any non-local task in message-passing systems. It also introduces a natural weakening of the well-known set agreement task, and show that, in some precise sense, it is the weakest non-local task in message-passing systems. © 2009 Springer-Verlag.
Cite
CITATION STYLE
Delporte-Gallet, C., Fauconnier, H., & Toueg, S. (2009). The minimum information about failures for solving non-local tasks in message-passing systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5923 LNCS, pp. 115–128). https://doi.org/10.1007/978-3-642-10877-8_11
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
