Wait-free linearizable distributed shared memory

Citation
S. Moriya et al., Wait-free linearizable distributed shared memory, IEICE T INF, E83D(8), 2000, pp. 1611-1621
Citations number
7
Language
INGLESE
art.tipo
Article
Categorie Soggetti
Information Tecnology & Communication Systems
Journal title
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS
ISSN journal
0916-8532 → ACNP
Volume
E83D
Issue
8
Year of publication
2000
Pages
1611 - 1621
Database
ISI
SICI code
0916-8532(200008)E83D:8<1611:WLDSM>2.0.ZU;2-5
Abstract
We consider a wait-free linearizable implementation of shared objects on a distributed message-passing system. We assume that the system provides each process with a local cluck that runs: at the same speed as global time and that all message delays are in the range [d - u, d] where d and u. (0 < u less than or equal to d) are constants known to every process. We present f our wait-free linearizable implementations of read/write registers on relia ble and unreliable broadcast models. We also present two wait-free lineariz able implementations of general objects on a reliable broadcast model. The efficacy of an implementation is measured by the worst-case response time f or each operation of the implemented object. Response times of our wait-fre e implementations of read/write registers on a reliable broadcast model is better than a previously known implementation in which wait-freedom is not taken into account.