タイトル(掲載誌)Research report (School of Information Science, Japan Advanced Institute of Science and Technology)
一般注記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, process e s 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, (5) multiple simultaneous crashes and (6) multiple sequenced crashes. The results show that the Paxos algorithm tolerates frequent wrong suspicions (3) and correlated crashes that occur within a short time (5) better, while the performance is comparable in all other scenarios.
リサーチレポート(北陸先端科学技術大学院大学情報科学研究科)
identifier:https://dspace.jaist.ac.jp/dspace/handle/10119/8403
一次資料へのリンクURLhttps://dspace.jaist.ac.jp/dspace/bitstream/10119/8403/1/IS-RR-2004-016.pdf
連携機関・データベース国立情報学研究所 : 学術機関リポジトリデータベース(IRDB)(機関リポジトリ)
提供元機関・データベース北陸先端科学技術大学院大学 : JAIST学術研究成果リポジトリ