Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

PODC

2010

ACM

2010

ACM

We deﬁne two new classes of shared-memory objects: ratiﬁers, which detect agreement, and conciliators, which ensure agreement with some probability. We show that consensus can be solved by an alternating sequence of these objects, and observe that most known randomized consensus algorithms have this structure. We give a deterministic m-valued ratiﬁer for an unbounded number of processes that uses lg m+Θ(log log m) space and individual work. We also give a randomized conciliator for any number of values in the probabilistic-write model with n processes that guarantees agreement with constant probability while using one multiwriter register, O(log n) expected individual work, and Θ(n) expected total work. Combining these objects gives a consensus protocol for the probabilistic-write model that uses O(log n) individual work and O(n log m) total work. No previous protocol in this model uses sublinear individual work or linear total work for constant m. Categories and Subject Descr...

Added |
16 Aug 2010 |

Updated |
16 Aug 2010 |

Type |
Conference |

Year |
2010 |

Where |
PODC |

Authors |
James Aspnes |

Comments (0)