|
JAIST Repository >
b. 情報科学研究科・情報科学系 >
b10. 学術雑誌論文等 >
b10-1. 雑誌掲載論文 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/4883
|
| タイトル: | Total order broadcast and multicast algorithms: Taxonomy and survey |
| 著者: | Defago, Xavier
Schiper, Andre
Urban, Peter |
| キーワード: | Algorithms
Reliability
Design |
| 発行日: | 2004-12 |
| 出版者: | Association for Computing Machinery |
| 誌名: | ACM Computing Surveys |
| 巻: | 36 |
| 号: | 4 |
| 開始ページ: | 372 |
| 終了ページ: | 421 |
| DOI: | 10.1145/1041680.1041682 |
| 抄録: | Total order broadcast and multicast (also called atomic broadcast/multicast) present an important problem in distributed systems, especially with respect to fault-tolerance. In short, the primitive ensures that messages sent to a set of processes are in turn delivered by all those processes in the same total order. The problem has inspired an abundant literature, with a plethora of proposed algorithms. This paper proposes a classification of total order broadcast and multicast algorithms based on their ordering mechanisms, and addresses a number of other important issues. The paper surveys about sixty algorithms, thus providing by far the most extensive study of the problem so far. The paper discusses algorithms for both the synchronous and the asynchronous system models, and studies the respective properties and behavior of the different algorithms. |
| Rights: | (c) ACM, 2004. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in ACM Computing Surveys, 36(4), 2004, 372-421. http://doi.acm.org/10.1145/1041680.1041682 |
| URI: | http://hdl.handle.net/10119/4883 |
| 資料タイプ: | author |
| 出現コレクション: | b10-1. 雑誌掲載論文 (Journal Articles)
|
このアイテムのファイル:
| ファイル |
記述 |
サイズ | 形式 |
|---|
| defago_et_al.pdf | | 542Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|
