Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Wait-Freedom with Advice   We motivate and propose a new way of thinking about failure detectors which
allows us to define, quite surprisingly, what it means to solve a distributed
task \emph{wait-free} \emph{using a failure detector}. In our model, the system
is composed of \emph{computation} processes that obtain inputs and are supposed
to output in a finite number of steps and \emph{synchronization} processes that
are subject to failures and can query a failure detector. We assume that, under
the condition that \emph{correct} synchronization processes take sufficiently
many steps, they provide the computation processes with enough \emph{advice} to
solve the given task wait-free: every computation process outputs in a finite
number of its own steps, regardless of the behavior of other computation
processes. Every task can thus be characterized by the \emph{weakest} failure
detector that allows for solving it, and we show that every such failure
detector captures a form of set agreement. We then obtain a complete
classification of tasks, including ones that evaded comprehensible
characterization so far, such as renaming or weak symmetry breaking.

24
The categories of this paper are: dg-ga
31
The categories of this paper are: ao-sci
14
The categories of this paper are: math-ph
32
The categories of this paper are: atom-ph
3
The categories of this paper are: physics
16
The categories of this paper are: stat
10
The categories of this paper are: q-bio
21
The categories of this paper are: adap-org
35
The categories of this paper are: mtrl-th
25
The categories of this paper are: patt-sol
28
The categories of this paper are: alg-geom
23
The categories of this paper are: solv-int
8
The categories of this paper are: hep-ex
19
The categories of this paper are: eess
12
The categories of this paper are: nucl-th
37
The categories of this paper are: supr-con