Graduate School and Research Center In communication systems
Fast access to distributed atomic memory
SIAM Journal on Computing, Vol 39, N°8, December 2010
We study efficient and robust implementations of an atomic read-write data structure over an asynchronous distributed message-passing system made of reader and writer processes, as well as a number of servers implementing the data structure. We determine the exact conditions under which every read and write involves one round of communication with the servers. These conditions relate the number of readers to the tolerated number of faulty servers and the nature of these failures.
| Keywords: | Atomic registers, Byzantine failures, Distributed algorithms, Fault-tolerance, Time-complexity, Shared-memory emulations |
| Type: | Journal |
| Language: | English |
| City: | |
| Date: | December 2010 |
| Department: | Networking and Security |
| Eurecom ref: | 3336 |
| Copyright: | SIAM |
| Bibtex: | @article{EURECOM+3336, doi = {http://dx.doi.org/http://dx.doi.org/10.1137/090757010}, year = {2010}, month = {12}, title = {{F}ast access to distributed atomic memory }, author = {{D}utta, {P}artha and {G}uerraoui, {R}achid and {L}evy, {R}on {R} and {V}ukolic, {M}arko}, journal = {{SIAM} {J}ournal on {C}omputing, {V}ol 39, {N}°8, {D}ecember 2010}, url = {http://www.eurecom.fr/publication/3336} } |
Permalink: http://www.eurecom.fr/publication/3336
