Limitations of fast consistency conditions for distributed shared memories

A consistency condition for distributed shared memory is fast if it has a fast implementation in which the execution time of every operation is significantly faster than the network delay. These conditions include Pipelined RAM, weak consistency, causal memory, and one interpretation of processor co...

Full description

Saved in:
Bibliographic Details
Published in:Information processing letters Vol. 57; no. 5; pp. 243 - 248
Main Authors: Attiya, Hagit, Friedman, Roy
Format: Journal Article
Language:English
Published: Amsterdam Elsevier B.V 11.03.1996
Elsevier Science
Elsevier Sequoia S.A
Subjects:
Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer programming
Computer science; control theory; systems
Computer systems and distributed systems. User interface
Consistency conditions
Distributed computing
Distributed processing
Distributed shared memory
Exact sciences and technology
Random access memory
Software
Studies
Theoretical computing
Distributed computing
Distributed shared memory
Consistency conditions
Mutual exclusion
Shared memory
Implementation
Distributed computer systems
Execution time
ISSN:0020-0190, 1872-6119
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A consistency condition for distributed shared memory is fast if it has a fast implementation in which the execution time of every operation is significantly faster than the network delay. These conditions include Pipelined RAM, weak consistency, causal memory, and one interpretation of processor consistency. It is shown that if a condition is fast then it does not support non-centralized solutions for mutual exclusion.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ISSN:0020-0190
1872-6119
DOI:10.1016/0020-0190(96)00007-5