arXiv Open Access 2015

A Necessary Condition for Byzantine $k$-Set Agreement

Zohir Bouzid Damien Imbs Michel Raynal

Lihat Sumber

Abstrak

This short paper presents a necessary condition for Byzantine $k$-set agreement in (synchronous or asynchronous) message-passing systems and asynchronous shared memory systems where the processes communicate through atomic single-writer multi-reader registers. It gives a proof, which is particularly simple, that $k$-set agreement cannot be solved $t$-resiliently in an $n$-process system when $n \leq 2t + \frac{t}{k}$. This bound is tight for the case $k=1$ (Byzantine consensus) in synchronous message-passing systems.

Topik & Kata Kunci

cs.DC

Penulis (3)

Zohir Bouzid

Damien Imbs

Michel Raynal

Format Sitasi

APA MLA BibTeX

Bouzid, Z., Imbs, D., Raynal, M. (2015). A Necessary Condition for Byzantine $k$-Set Agreement. https://arxiv.org/abs/1512.06227

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2015
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓