| Presentation | 2016-10-27 Faster Wait-free Randomized Consensus with an Oblivious Adversary for MRSW Register Model Sen Moriya, Michiko Inoue, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | We consider wait-free randomized consensus algorithms with an oblivious adversary in asynchronous shared-memory system using MRSW registers. It is known that the randomized consensus algorithm can be constructed from a conciliator algorithm with agreement probability $1-epsilon$ and an adopt-commit algorithm. In the case of MRSW register models, step complexity of a wait-free randomized consensus algorithm depends on that of a conciliator algorithm, since there exists a sufficiently fast adopt-commit algorithm. In this paper, we propose a wait-free randomized consensus algorithm, in which the expected process step complexity is improved to $O(n)$ from that of the previous best algorithm, $O(nloglog{n})$, by a conciliator algorithm with worse agreement probability and reduced complexity. Furthermore, we show the practical effectiveness of the proposed algorithm by simulated experiments. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | shared-memory system / wait-free algorithm / randomized consensus / oblivious adversary |
| Paper # | SS2016-20,DC2016-22 |
| Date of Issue | 2016-10-20 (SS, DC) |
| Conference Information | |
| Committee | DC / SS |
|---|---|
| Conference Date | 2016/10/27(2days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | Hikone Kinro-Fukushi Kaikan Bldg. |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | Software System and Dependability on Network, etc |
| Chair | Michiko Inoue(NAIST) / Kazuhiro Ogata(JAIST) |
| Vice Chair | Satoshi Fukumoto(Tokyo Metropolitan Univ.) / Akio Nakata(Hiroshima City Univ.) |
| Secretary | Satoshi Fukumoto(Kyoto Sangyo Univ.) / Akio Nakata(Tokyo Inst. of Tech.) |
| Assistant | / Kazuyuki Shima(Hiroshima City Univ.) |
| Paper Information | |
| Registration To | Technical Committee on Dependable Computing / Technical Committee on Software Science |
|---|---|
| Language | ENG-JTITLE |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Faster Wait-free Randomized Consensus with an Oblivious Adversary for MRSW Register Model |
| Sub Title (in English) | |
| Keyword(1) | shared-memory system |
| Keyword(2) | wait-free algorithm |
| Keyword(3) | randomized consensus |
| Keyword(4) | oblivious adversary |
| 1st Author's Name | Sen Moriya |
| 1st Author's Affiliation | Kindai University(Kindai Univ.) |
| 2nd Author's Name | Michiko Inoue |
| 2nd Author's Affiliation | Nara institute of science and technology(NAIST) |
| Date | 2016-10-27 |
| Paper # | SS2016-20,DC2016-22 |
| Volume (vol) | vol.116 |
| Number (no) | SS-277,DC-278 |
| Page | pp.pp.13-18(SS), pp.13-18(DC), |
| #Pages | 6 |
| Date of Issue | 2016-10-20 (SS, DC) |