Suchergebnisse - "Round-based algorithm"
-
1
Optimal algorithms for synchronous Byzantine k-set agreement
ISSN: 0304-3975, 1879-2294Veröffentlicht: Elsevier 21.09.2023Veröffentlicht in Theoretical computer science (21.09.2023)Volltext
Journal Article -
2
Narrowing power vs efficiency in synchronous set agreement: Relationship, algorithms and lower bound
ISSN: 0304-3975, 1879-2294Veröffentlicht: Oxford Elsevier B.V 2010Veröffentlicht in Theoretical computer science (2010)“… The k -set agreement problem is a generalization of the uniform consensus problem: each process proposes a value, and each non-faulty process has to decide a …”
Volltext
Journal Article -
3
On the performance of a retransmission-based synchronizer
ISSN: 0304-3975, 1879-2294Veröffentlicht: Netherlands Elsevier B.V 21.10.2013Veröffentlicht in Theoretical computer science (21.10.2013)“… Designing algorithms for distributed systems that provide a round abstraction is often simpler than designing for those that do not provide such an …”
Volltext
Journal Article