WEKO3
アイテム
One-step consensus solvability
https://nitech.repo.nii.ac.jp/records/3573
https://nitech.repo.nii.ac.jp/records/357339857ffc-88c6-4aa8-9da9-c5a1b0156d8b
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
本文_fulltext (354.6 kB)
|
Copyright 2006 Springer-Verlag The final publication is available at www.springerlink.com.
|
| Item type | 学術雑誌論文 / Journal Article(1) | |||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 公開日 | 2013-06-25 | |||||||||||||||
| タイトル | ||||||||||||||||
| タイトル | One-step consensus solvability | |||||||||||||||
| 言語 | en | |||||||||||||||
| 言語 | ||||||||||||||||
| 言語 | eng | |||||||||||||||
| 資源タイプ | ||||||||||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||||||||||
| 資源タイプ | journal article | |||||||||||||||
| 著者 |
泉, 泰介
× 泉, 泰介
× Masuzawa, Toshimitsu
|
|||||||||||||||
| 著者別名 | ||||||||||||||||
| 姓名 | Izumi, Taisuke | |||||||||||||||
| 言語 | en | |||||||||||||||
| 姓名 | 泉, 泰介 | |||||||||||||||
| 言語 | ja | |||||||||||||||
| 姓名 | イズミ, タイスケ | |||||||||||||||
| 言語 | ja-Kana | |||||||||||||||
| bibliographic_information |
en : Proceedings of the 20th International Symposium on Distributed Computing, Lecture Notes in Computer Science 巻 4167/2006, p. 224-237, 発行日 2006 |
|||||||||||||||
| 出版者 | ||||||||||||||||
| 出版者 | Springer Verlag | |||||||||||||||
| 言語 | en | |||||||||||||||
| ISSN | ||||||||||||||||
| 収録物識別子タイプ | ISSN | |||||||||||||||
| 収録物識別子 | 0302-9743 | |||||||||||||||
| ISBN | ||||||||||||||||
| 識別子タイプ | ISBN | |||||||||||||||
| 関連識別子 | 9783540446248 | |||||||||||||||
| item_10001_relation_32 | ||||||||||||||||
| 識別子タイプ | NCID | |||||||||||||||
| 関連識別子 | BA7883566X | |||||||||||||||
| 出版タイプ | ||||||||||||||||
| 出版タイプ | AM | |||||||||||||||
| 出版タイプResource | http://purl.org/coar/version/c_ab4af688f83e57aa | |||||||||||||||
| item_10001_relation_34 | ||||||||||||||||
| 関連タイプ | isVersionOf | |||||||||||||||
| 識別子タイプ | DOI | |||||||||||||||
| 関連識別子 | http://dx.doi.org/10.1007/11864219_16 | |||||||||||||||
| 関連名称 | 10.1007/11864219_16 | |||||||||||||||
| 内容記述 | ||||||||||||||||
| 内容記述タイプ | Other | |||||||||||||||
| 内容記述 | While any fault-tolerant asynchronous consensus algorithmrequires two communication steps even in failure-free executions, it isknown that we can construct an algorithm terminating in one step forsome good inputs (e.g. all processes propose a same value). In this paper,we present the necessary and sufficient constraint for the set ofinputs for which we can construct an asynchronous consensus algorithmterminating in one step. Our investigation is based on the notion ofthe condition-based approach: it introduces conditions on input vectorsto specify subsets of all possible input vectors and condition-based algorithmscan circumvent some impossibility if the actual input vectorsatisfy a particular condition. More interestingly, conditions treated inthis paper are adaptive. That is, we consider hierarchical sequences ofconditions whose k-th condition is the set of input vectors for which theconsensus can be solved in one step if at most k processes crash. The necessaryand sufficient constraint we propose in this paper is one for suchcondition sequences. In addition, we present an instance of the sufficientcondition sequences. Compared with existing constraints for inputs thisinstance is more relaxed. | |||||||||||||||
| 言語 | en | |||||||||||||||
