Download:
|
by Charles Wallace, Guy Tremblay, Jose N. Amaral
http://www.cs.ualberta.ca/~amaral/papers/ASM-LC-CAST01.ps.gz
Add To MetaCart
Abstract:
Abstract. We use the Abstract State Machine methodology to give formal operational semantics for the Location Consistency memory model and cache protocol. With these formal models, we prove that the cache protocol satises the memory model, but in a way that is strictly stronger than necessary, disallowing certain behavior allowed by the memory model. 1
Citations
|
801
|
How to Make a Multiprocessor Computer that Correctly Executes Multiprocess Programs
– Lamport
- 1979
|
|
637
|
Memory consistency and event ordering in scalable shared-memory multiprocessors
– Gharachorloo, Lenoski, et al.
- 1990
|
|
422
|
Lazy release consistency for software distributed shared memory
– Keleher, Cox, et al.
- 1992
|
|
376
|
Parallel Computer Architecture: A Hardware/Software Approach
– Culler, Singh
- 1998
|
|
360
|
The Midway distributed shared memory system
– Bershad, Zekauskas, et al.
- 1993
|
|
343
|
Evolving algebras 1993: Lipari guide
– Gurevich
- 1995
|
|
191
|
Shared Memory Consistency Models: A Tutorial
– V, Gharachorloo
- 1996
|
|
89
|
An Analysis Of Dag-Consistent Distributed Shared-Memory Algorithms
– Blumofe, Frigo, et al.
- 1996
|
|
60
|
Time bounded random access machines
– Cook, Reckhow
- 1973
|
|
30
|
Commit-Reconcile & Fences (CRF): A new memory model for architects and compiler writers
– Shen, Arvind, et al.
- 1999
|
|
29
|
Location consistency - a new memory model and cache consistency protocol
– Gao, Sarkar
- 1998
|
|
24
|
Model checking support for the ASM high-level language
– Castillo, Winter
- 2000
|
|
20
|
Location consistency: stepping beyond the barriers of memory coherence and serializability
– Gao, Sarkar
- 1994
|
