Reductions in Distributed Computing Part II: k-Threshold Agreement Tasks
| dc.creator | Charron-Bost, Bernadette | |
| dc.date | 2004-12-29 | |
| dc.date.accessioned | 2026-07-07T03:22:19Z | |
| dc.date.available | 2026-07-07T03:22:19Z | |
| dc.description | We extend the results of Part I by considering a new class of agreement tasks, the so-called k-Threshold Agreement tasks (previously introduced by Charron-Bost and Le Fessant). These tasks naturally interpolate between Atomic Commitment and Consensus. Moreover, they constitute a valuable tool to derive irreducibility results between Consensus tasks only. In particular, they allow us to show that (A) for a fixed set of processes, the higher the resiliency degree is, the harder the Consensus task is, and (B) for a fixed resiliency degree, the smaller the set of processes is, the harder the Consensus task is. The proofs of these results lead us to consider new oracle-based reductions, involving a weaker variant of the C-reduction introduced in Part I. We also discuss the relationship between our results and previous ones relating f-resiliency and wait-freedom. | |
| dc.description | 27 pages, 4 figures | |
| dc.identifier | https://arxiv.org/abs/cs/0412116 | |
| dc.identifier | http://arxiv.org/abs/cs/0412116 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/32546 | |
| dc.subject | Distributed, Parallel, and Cluster Computing | |
| dc.subject | C.4; C.2.4; F.1.3 | |
| dc.title | Reductions in Distributed Computing Part II: k-Threshold Agreement Tasks | |
| dc.type | text |