|
ハヤシバラ ナオヒロ
HAYASHIBARA NAOHIRO
林原 尚浩 所属 京都産業大学 情報理工学部 情報理工学科 職種 教授 |
|
| 言語種別 | 英語 |
| 発行・発表の年月 | 2004 |
| 形態種別 | 研究論文（国際会議プロシーディングス） |
| 査読 | 査読あり |
| 標題 | Performance comparison of a rotating coordinator and a leader based consensus algorithm |
| 執筆形態 | その他 |
| 掲載誌名 | 23RD IEEE INTERNATIONAL SYMPOSIUM ON RELIABLE DISTRIBUTED SYSTEMS, PROCEEDINGS |
| 出版社・発行元 | IEEE COMPUTER SOC |
| 巻・号・頁 | pp.4-17 |
| 著者・共著者 | P Urban,N Hayashibara,A Schiper,T Katayama |
| 概要 | Protocols that solve agreement problems are essential building blocks for fault tolerant distributed systems. While many protocols have been published, little has been done to analyze their performance, especially the performance of their fault tolerance mechanisms. In this paper we compare two well-known asynchronous consensus algorithms. In both algorithms, a leader process tries to impose a decision, and another leader retries if the leader fails doing so. The algorithms elect leaders differently: the Chandra-Toueg algorithm has a rotating leader whereas processes in the Paxos algorithm elect leaders directly. We investigate the performance implications of this difference.
In the system under study, processes send atomic broadcasts to each other Consensus is used to decide the delivery order of messages. We evaluate the steady state latency in (1) runs with neither crashes nor suspicions, (2) runs with crashes and (3) runs with no crashes in which correct processes are wrongly suspected to have crashed, as well as the transient latency after (4) one crash and (5) multiple correlated crashes. The results show that the Paxos algorithm tolerates frequent wrong suspicions (3) and correlated crashes (5) better while the performance is comparable in all other scenarios. |
| DOI | 10.1109/RELDIS.2004.1352999 |
| ISSN | 1060-9857 |
| DBLP ID | conf/srds/UrbanHSK04 |
| PermalinkURL | http://dblp.uni-trier.de/db/conf/srds/srds2004.html#conf/srds/UrbanHSK04 |