Agreement Functions for Distributed Computing Models
Distributed, Parallel, and Cluster Computing
2017-03-13 v3
Abstract
The paper proposes a surprisingly simple characterization of a large class of models of distributed computing, via an agreement function: for each set of processes, the function determines the best level of set consensus these processes can reach. We show that the task computability of a large class of fair adversaries that includes, in particular superset-closed and symmetric one, is precisely captured by agreement functions.
Cite
@article{arxiv.1702.00361,
title = {Agreement Functions for Distributed Computing Models},
author = {Petr Kuznetsov and Thibault Rieutord},
journal= {arXiv preprint arXiv:1702.00361},
year = {2017}
}