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 clock 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
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Sen MORIYA, Katsuro SUDA, Michiko INOUE, Toshimitsu MASUZAWA, Hideo FUJIWARA, "Wait-Free Linearizable Distributed Shared Memory" in IEICE TRANSACTIONS on Information,
vol. E83-D, no. 8, pp. 1611-1621, August 2000, doi: .
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 clock 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
URL: https://global.ieice.org/en_transactions/information/10.1587/e83-d_8_1611/_p
Copy
@ARTICLE{e83-d_8_1611,
author={Sen MORIYA, Katsuro SUDA, Michiko INOUE, Toshimitsu MASUZAWA, Hideo FUJIWARA, },
journal={IEICE TRANSACTIONS on Information},
title={Wait-Free Linearizable Distributed Shared Memory},
year={2000},
volume={E83-D},
number={8},
pages={1611-1621},
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 clock 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
keywords={},
doi={},
ISSN={},
month={August},}
Copy
TY - JOUR
TI - Wait-Free Linearizable Distributed Shared Memory
T2 - IEICE TRANSACTIONS on Information
SP - 1611
EP - 1621
AU - Sen MORIYA
AU - Katsuro SUDA
AU - Michiko INOUE
AU - Toshimitsu MASUZAWA
AU - Hideo FUJIWARA
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E83-D
IS - 8
JA - IEICE TRANSACTIONS on Information
Y1 - August 2000
AB - 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 clock 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
ER -