Log in to save to my catalogue

Communication-efficient randomized consensus

Communication-efficient randomized consensus

https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_2099793755

Communication-efficient randomized consensus

About this item

Full title

Communication-efficient randomized consensus

Publisher

Berlin/Heidelberg: Springer Berlin Heidelberg

Journal title

Distributed computing, 2018-11, Vol.31 (6), p.489-501

Language

English

Formats

Publication information

Publisher

Berlin/Heidelberg: Springer Berlin Heidelberg

More information

Scope and Contents

Contents

We consider the problem of consensus in the challenging
classic
model. In this model, the adversary is adaptive; it can choose which processors crash at any point during the course of the algorithm. Further, communication is via asynchronous message passing: there is no known upper bound on the time to send a message from one processor to ano...

Alternative Titles

Full title

Communication-efficient randomized consensus

Authors, Artists and Contributors

Identifiers

Primary Identifiers

Record Identifier

TN_cdi_proquest_journals_2099793755

Permalink

https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_2099793755

Other Identifiers

ISSN

0178-2770

E-ISSN

1432-0452

DOI

10.1007/s00446-017-0315-1

How to access this item