Access the full text.
Sign up today, get DeepDyve free for 14 days.
L. Lamport (1979)
How to Make a Multiprocessor Computer That Correctly Executes Multiprocess ProgramsIEEE Transactions on Computers, C-28
Phillip Gibbons, Michael Merritt, K. Gharachorloo (1991)
Proving sequential consistency of high-performance shared memories (extended abstract)
A. Agarwal, D. Chaiken, Kirk Johnson, D. Kranz, J. Kubiatowicz, K. Kurihara, B. Lim, G. Maa, Daniel Nussbaum, M. Parkin, D. Yeung (1991)
THE MIT ALEWIFE MACHINE: A LARGE-SCALE DISTRIBUTED-MEMORY MULTIPROCESSOR
K. Birman, T. Joseph (1987)
Exploiting virtual synchrony in distributed systems
P. Hutto, M. Ahamad (1990)
Slow memory: weakening consistency to enhance concurrency in distributed shared memoriesProceedings.,10th International Conference on Distributed Computing Systems
H. Attiya, S. Chaudhuri, R. Friedman, J. Welch (1993)
Shared memory consistency conditions for non-sequential execution: definitions and programming strategies
(1992)
ACM Symp. on the Theory Of Computing
M. Ahamad, P. Hutto, Ranjit John (1991)
Implementing and programming causal distributed shared memory[1991] Proceedings. 11th International Conference on Distributed Computing Systems
R. Bisiani, A. Nowatzyk, M. Ravishankar (1989)
Coherent Shared Memory on a Distributed Memory Machine
M Ahamad, G Neiger, P Kohli, J Burns, P Hutto (1995)
Causal memory: definitions, implementation, and programmingDistrib Comput, 9
M. Kaashoek, A. Tanenbaum, S. Hummel, H. Bal (1989)
An efficient reliable broadcast protocolACM SIGOPS Oper. Syst. Rev., 23
W. Brantley, K. McAuliffe, Jodi Weiss (1985)
RP3 Processor-Memory Element
M. Herlihy, Jeannette Wing (1990)
Linearizability: a correctness condition for concurrent objectsACM Trans. Program. Lang. Syst., 12
F. Cristian, R. Beijer, Shivakant Mishra (1994)
A performance comparison of asynchronous atomic broadcast protocolsDistributed Syst. Eng., 1
on Progranrnring Languages and System~
K. Birman, A. Schiper, Patrick Stephenson (1991)
Lightweight causal and atomic group multicastACM Trans. Comput. Syst., 9
M. Ahamad, J. Burns, P. Hutto, G. Neiger (1991)
Causal Memory
K. Marzullo, R. Cooper, M. Wood, K. Birman (1991)
Tools for distributed application managementComputer, 24
H. Attiya, R. Friedman (1992)
A correctness condition for high-performance multiprocessors (extended abstract)
H. Attiya, J. Welch (1991)
Sequential consistency versus linearizability (extended abstract)
Jo-Mei Chang, N. Maxemchuk (1984)
Reliable broadcast protocolsACM Trans. Comput. Syst., 2
A. Siegel, K. Birman, K. Marzullo (1990)
Deceit: a flexible distributed file system[1990] Proceedings. Workshop on the Management of Replicated Data
J. Goodman (1991)
Cache Consistency and Sequential Consistency
R. Sites (1995)
Alpha Architecture Reference Manual
K. Gharachorloo, D. Lenoski, J. Laudon, Phillip Gibbons, Anoop Gupta, J. Hennessy (1990)
Memory consistency and event ordering in scalable shared-memory multiprocessors
Phillip Gibbons, Michael Merritt (1992)
Specifying non-blocking shared memories (extended abstract)
H. Attiya (1991)
Implementing FIFO Queus and Stacks (Extended Abstract)
Martha Kosa (1994)
Making operations of concurrent data types fast
M. Dubois, C. Scheurich, F. Briggs (1988)
Synchronization, coherence, and event ordering in multiprocessorsComputer, 21
S. Adve, M. Hill (1990)
Weak ordering—a new definition
S. Adve, M. Hill (1993)
A Unified Formalization of Four Shared-Memory ModelsIEEE Trans. Parallel Distributed Syst., 4
K. Birman (1992)
The process group approach to reliable distributed computingCommun. ACM, 36
Y. Afek, Geoffrey Brown, Michael Merritt (1993)
Lazy cachingACM Trans. Program. Lang. Syst., 15
(1991)
Cache Consistency anti Seqllential Consistency Compnter Science Technical Repo~ t #l 006, University of J1'isconsiu, hIadison
H. Attiya, J. Welch (1994)
Sequential consistency versus linearizabilityACM Trans. Comput. Syst., 12
K. Birman, T. Joseph (1987)
Reliable communication in the presence of failuresACM Trans. Comput. Syst., 5
D. Dolev, S. Kramer, D. Malkhi (1992)
Total Ordering of Messages in Broadcast Domains
Y. Afek, Geoffrey Brown, Michael Merritt (1989)
A lazy cache algorithm
M. Mavronicolas, Dan Roth (1992)
Efficient, Strongly Consistent Implementations of Shared Memory (Extended Abstract)
SummaryIn recent years, there is a growing tendency to support high-level synchronization operations, such as read-modify-write, FIFO queues and stacks, as part of the programmer’s shared memory model. This paper examines the problem of implementing hybrid consistency with high-level synchronization operations. It is shown that for any implementation of weak consistency, the time required to execute a read-modify-write, a dequeue or a pop operation is Ω(d), where d is the network delay. Following this, an efficient and simple algorithm for providing hybrid consistency that supports most types of high-level synchronization operations and weak read and weak write operations is presented. Weak read and weak write operations are executed instantaneously, while the time required to execute strong operations is O(d). This is within a constant factor of the lower bounds for most of the commonly used types of operations.
Distributed Computing – Springer Journals
Published: Dec 1, 1995
Keywords: Distributed shared memory; Consistency condition; Hybrid consistency; Synchronization operations
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.