Limitations of fast consistency conditions for distributed shared memories☆
References (17)
Algorithms for Mutual Exclusion
(1986)- et al.
Weak ordering — A new definition
- et al.
The power of processor consistency
- et al.
Implementing and programming causal distributed shared memory
- M. Ahamad, G. Neiger, P. Kohli, J. Burns and P. Hutto, Causal memory: Definitions, implementation and programming,...
- et al.
A correctness condition for high-performance multiprocessors
Revised version: Tech. Rept. #767, Dept. of Computer Science, The... - et al.
A correctness condition for high-performance multiprocessors
- et al.
Sequential consistency versus linearizability
ACM Trans. Comput. Systems
(1994)
There are more references available in the full text version of this article.
Cited by (0)
- ☆
This research was supported by grant No. 92–0233 from the United States-Israel Binational Science Foundation (BSF), Jerusalem, Israel, the fund for the promotion of research in the Technion, and by Technion V.P.R. funds.
- ∗
Most of this research was performed while the author was at the Department of Computer Science, The Technion.
Copyright © 1996 Published by Elsevier B.V.