2011 | OriginalPaper | Buchkapitel
Randomized Consensus in Expected O(n 2) Total Work Using Single-Writer Registers
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
A new weak shared coin protocol yields a randomized wait-free shared-memory consensus protocol that uses an optimal
O
(
n
2
) expected total work with single-writer registers despite asynchrony and process crashes. Previously, no protocol was known that achieved this bound without using multi-writer registers.