Brief Announcement: The Minimum Failure Detector for Non-Local Tasks in Message-Passing Systems

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. We investigate the following question: What is the minimum information about failures that is necessary to solve any non-local task in message-passing systems? To understand this question, we must first explain what we mean here by “non-local task”. Roughly speaking, an (input/output) task is a relation between the input and the output values of processes [1]. In this paper, we consider one-shot tasks where each process has a single input value drawn from a finite number of possible input values, and each process outputs a single value. To classify a task as being local or non-local, we consider its input/output re...

• Type: Conference
• Year: 2009
• Where: WDAG
• Authors: Carole Delporte-Gallet, Hugues Fauconnier, Sam Toueg
• Keywords: Message-passing Systems, Non-local Task, WDAG 2009, Weakest Non-local Task