| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 429228 | Information Processing Letters | 2007 | 9 Pages |
Abstract
This paper presents a family of agreement problems called Managed Agreement, which is parameterized by the number of aristocrat nodes in the system; NBAC is a special case of this family when all nodes are aristocrats while Consensus is a special case of this family when there are no aristocrats. The paper also presents a parameterized family of failure detectors F(A) such that F(A) is the weakest failure detector class that enables solving Managed Agreement with a set A of aristocrats in an asynchronous environment.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
