An approach to achieve message efficient early-stopping uniform consensus protocols

Xianbing Wang; Jiannong Cao; Yong Meng Teo

An approach to achieve message efficient early-stopping uniform consensus protocols

Xianbing Wang, Jiannong Cao, Yong Meng Teo

Research output: Chapter in book / Conference proceeding › Conference article published in proceeding or book › Academic research › peer-review

1 Citation (Scopus)

Abstract

Existing consensus protocols for synchronous distributed systems concentrate on the lower bound on the number of rounds required for achieving consensus. This paper proposes an approach to reduce the message complexity of some uniform consensus protocols significantly while achieving the same lower bound in which for any t-resilient consensus protocol only t + 1 processes engaging in sending messages in each round.

Original language	English
Title of host publication	Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN
Pages	300-305
Number of pages	6
Publication status	Published - 16 Aug 2004
Event	Proceedings on the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN - Hong Kong, Hong Kong Duration: 10 May 2004 → 12 May 2004

Conference

Conference	Proceedings on the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN
Country/Territory	Hong Kong
City	Hong Kong
Period	10/05/04 → 12/05/04

ASJC Scopus subject areas

General Computer Science

More information

http://hdl.handle.net/10397/856

Cite this

@inproceedings{43afc9c8cc48488aa32598af47df07f3,

title = "An approach to achieve message efficient early-stopping uniform consensus protocols",

abstract = "Existing consensus protocols for synchronous distributed systems concentrate on the lower bound on the number of rounds required for achieving consensus. This paper proposes an approach to reduce the message complexity of some uniform consensus protocols significantly while achieving the same lower bound in which for any t-resilient consensus protocol only t + 1 processes engaging in sending messages in each round.",

author = "Xianbing Wang and Jiannong Cao and Teo, {Yong Meng}",

year = "2004",

month = aug,

day = "16",

language = "English",

pages = "300--305",

booktitle = "Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN",

note = "Proceedings on the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN ; Conference date: 10-05-2004 Through 12-05-2004",

}

Wang, X, Cao, J & Teo, YM 2004, An approach to achieve message efficient early-stopping uniform consensus protocols. in Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN. pp. 300-305, Proceedings on the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN, Hong Kong, Hong Kong, 10/05/04. <http://hdl.handle.net/10397/856>

An approach to achieve message efficient early-stopping uniform consensus protocols. / Wang, Xianbing; Cao, Jiannong; Teo, Yong Meng.
Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN. 2004. p. 300-305.

Research output: Chapter in book / Conference proceeding › Conference article published in proceeding or book › Academic research › peer-review

TY - GEN

T1 - An approach to achieve message efficient early-stopping uniform consensus protocols

AU - Wang, Xianbing

AU - Cao, Jiannong

AU - Teo, Yong Meng

PY - 2004/8/16

Y1 - 2004/8/16

N2 - Existing consensus protocols for synchronous distributed systems concentrate on the lower bound on the number of rounds required for achieving consensus. This paper proposes an approach to reduce the message complexity of some uniform consensus protocols significantly while achieving the same lower bound in which for any t-resilient consensus protocol only t + 1 processes engaging in sending messages in each round.

AB - Existing consensus protocols for synchronous distributed systems concentrate on the lower bound on the number of rounds required for achieving consensus. This paper proposes an approach to reduce the message complexity of some uniform consensus protocols significantly while achieving the same lower bound in which for any t-resilient consensus protocol only t + 1 processes engaging in sending messages in each round.

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

M3 - Conference article published in proceeding or book

SP - 300

EP - 305

BT - Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN

T2 - Proceedings on the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN

Y2 - 10 May 2004 through 12 May 2004

ER -

An approach to achieve message efficient early-stopping uniform consensus protocols

Abstract

Conference

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this