Efficient asynchronous consensus with the weak adversary scheduler

Yonatan Aumann

doi:10.1145/259380.259441

Efficient asynchronous consensus with the weak adversary scheduler

Yonatan Aumann

Department of Mathematics

Research output: Contribution to conference › Paper › peer-review

31 Scopus citations

Abstract

We consider the problem of asynchronous consensus with a weak dynamic adversary scheduler. We provide the first algorithm to obtain Ō(n) total work in the weak adversary model using only single-writer registers. For the multi-writer setting we give an O(log n) work-per-processor algorithm, improving upon the previous O(log²n) bound. The adversary model considered is the content oblivious adversary model, which assumes that the adversary does not know the content of a register until it is read by some processor [13].

Original language	English
Pages	209-218
Number of pages	10
DOIs	https://doi.org/10.1145/259380.259441
State	Published - 1997
Event	Proceedings of the 1997 16th Annual ACM Symposium on Principles of Distributed Computing - Santa Barbara, CA, USA Duration: 21 Aug 1997 → 24 Aug 1997

Conference

Conference	Proceedings of the 1997 16th Annual ACM Symposium on Principles of Distributed Computing
City	Santa Barbara, CA, USA
Period	21/08/97 → 24/08/97

Access to Document

10.1145/259380.259441

Cite this

@conference{16239211f4f142ff84493481253223d3,

title = "Efficient asynchronous consensus with the weak adversary scheduler",

abstract = "We consider the problem of asynchronous consensus with a weak dynamic adversary scheduler. We provide the first algorithm to obtain Ō(n) total work in the weak adversary model using only single-writer registers. For the multi-writer setting we give an O(log n) work-per-processor algorithm, improving upon the previous O(log2n) bound. The adversary model considered is the content oblivious adversary model, which assumes that the adversary does not know the content of a register until it is read by some processor [13].",

author = "Yonatan Aumann",

year = "1997",

doi = "10.1145/259380.259441",

language = "אנגלית",

pages = "209--218",

note = "Proceedings of the 1997 16th Annual ACM Symposium on Principles of Distributed Computing ; Conference date: 21-08-1997 Through 24-08-1997",

}

TY - CONF

T1 - Efficient asynchronous consensus with the weak adversary scheduler

AU - Aumann, Yonatan

PY - 1997

Y1 - 1997

N2 - We consider the problem of asynchronous consensus with a weak dynamic adversary scheduler. We provide the first algorithm to obtain Ō(n) total work in the weak adversary model using only single-writer registers. For the multi-writer setting we give an O(log n) work-per-processor algorithm, improving upon the previous O(log2n) bound. The adversary model considered is the content oblivious adversary model, which assumes that the adversary does not know the content of a register until it is read by some processor [13].

AB - We consider the problem of asynchronous consensus with a weak dynamic adversary scheduler. We provide the first algorithm to obtain Ō(n) total work in the weak adversary model using only single-writer registers. For the multi-writer setting we give an O(log n) work-per-processor algorithm, improving upon the previous O(log2n) bound. The adversary model considered is the content oblivious adversary model, which assumes that the adversary does not know the content of a register until it is read by some processor [13].

UR - http://www.scopus.com/inward/record.url?scp=0030684625&partnerID=8YFLogxK

U2 - 10.1145/259380.259441

DO - 10.1145/259380.259441

M3 - ???researchoutput.researchoutputtypes.contributiontoconference.paper???

AN - SCOPUS:0030684625

SP - 209

EP - 218

T2 - Proceedings of the 1997 16th Annual ACM Symposium on Principles of Distributed Computing

Y2 - 21 August 1997 through 24 August 1997

ER -

Efficient asynchronous consensus with the weak adversary scheduler

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Cite this