Faster randomized consensus with an oblivious adversary.
Saved in:
| Title: | Faster randomized consensus with an oblivious adversary. |
|---|---|
| Authors: | Aspnes, James1 aspnes@cs.yale.edu |
| Source: | Distributed Computing. Feb2015, Vol. 28 Issue 1, p21-29. 9p. |
| Subjects: | Randomization (Statistics), EPSILON (Computer program language), Computational complexity, Permutation groups, Iterative methods (Mathematics) |
| Abstract: | Two new algorithms are given for randomized consensus in a shared-memory model with an oblivious adversary. Each is based on a new construction of a conciliator, an object that guarantees termination and validity, but that only guarantees agreement with constant probability. The first conciliator assumes unit-cost snapshots and achieves agreement among n processes with probability $$1-\epsilon $$ in $$O(\log ^* n + \log (1/\epsilon ))$$ steps for each process. The second uses ordinary multi-writer registers, and achieves agreement with probability $$1-\epsilon $$ in $$O(\log \log n + \log (1/\epsilon ))$$ steps. Combining these constructions with known results gives randomized consensus for arbitrarily many possible input values using unit-cost snapshots in $$O(\log ^* n)$$ expected steps and randomized consensus for up to $$(\log n)^{O(\log \log \log n)}$$ possible input values using ordinary registers in $$O(\log \log n)$$ expected steps. [ABSTRACT FROM AUTHOR] |
| Copyright of Distributed Computing is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
| FullText | Links: – Type: pdflink Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 100782136 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Faster randomized consensus with an oblivious adversary. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Aspnes%2C+James%22">Aspnes, James</searchLink><relatesTo>1</relatesTo><i> aspnes@cs.yale.edu</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Distributed+Computing%22">Distributed Computing</searchLink>. Feb2015, Vol. 28 Issue 1, p21-29. 9p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Randomization+%28Statistics%29%22">Randomization (Statistics)</searchLink><br /><searchLink fieldCode="DE" term="%22EPSILON+%28Computer+program+language%29%22">EPSILON (Computer program language)</searchLink><br /><searchLink fieldCode="DE" term="%22Computational+complexity%22">Computational complexity</searchLink><br /><searchLink fieldCode="DE" term="%22Permutation+groups%22">Permutation groups</searchLink><br /><searchLink fieldCode="DE" term="%22Iterative+methods+%28Mathematics%29%22">Iterative methods (Mathematics)</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: Two new algorithms are given for randomized consensus in a shared-memory model with an oblivious adversary. Each is based on a new construction of a conciliator, an object that guarantees termination and validity, but that only guarantees agreement with constant probability. The first conciliator assumes unit-cost snapshots and achieves agreement among n processes with probability $$1-\epsilon $$ in $$O(\log ^* n + \log (1/\epsilon ))$$ steps for each process. The second uses ordinary multi-writer registers, and achieves agreement with probability $$1-\epsilon $$ in $$O(\log \log n + \log (1/\epsilon ))$$ steps. Combining these constructions with known results gives randomized consensus for arbitrarily many possible input values using unit-cost snapshots in $$O(\log ^* n)$$ expected steps and randomized consensus for up to $$(\log n)^{O(\log \log \log n)}$$ possible input values using ordinary registers in $$O(\log \log n)$$ expected steps. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of Distributed Computing is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=100782136 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1007/s00446-013-0195-y Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 9 StartPage: 21 Subjects: – SubjectFull: Randomization (Statistics) Type: general – SubjectFull: EPSILON (Computer program language) Type: general – SubjectFull: Computational complexity Type: general – SubjectFull: Permutation groups Type: general – SubjectFull: Iterative methods (Mathematics) Type: general Titles: – TitleFull: Faster randomized consensus with an oblivious adversary. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Aspnes, James IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 02 Text: Feb2015 Type: published Y: 2015 Identifiers: – Type: issn-print Value: 01782770 Numbering: – Type: volume Value: 28 – Type: issue Value: 1 Titles: – TitleFull: Distributed Computing Type: main |
| ResultId | 1 |
