The extended BG-simulation and the characterization of t-resiliency

A distributed task T on n processors is an input/output relation between a collection of processors' inputs and outputs. While all tasks are solvable if no processor may ever crash, the FLP result revealed that the possibility of a failure of just a single processor precludes a solution to the task of consensus. That is consensus is not solvable 1-resiliently. Yet, some nontrivial tasks are wait-free solvable, i.e. n - 1resiliently. What tasks are solvable if at most t < n processors may crash? I.e. what tasks are solvable t-resiliently? The Herlihy-Shavit condition characterizes wait-free solv

• Type: Conference
• Year: 2009
• Where: STOC
• Authors: Eli Gafni
• Keywords: Algorithms, Distributed Task, Nontrivial Tasks, STOC 2009