Download:
|
by Ratan Nalumasu, Ganesh Gopalakrishnan
Formal Methods in System Design
http://www.cs.utah.edu/~ratan/papers/fmppta98.ps.gz
Add To MetaCart
Abstract:
Abstract. We address the problem of developing efficient cache coherence protocols implementing distributed shared memory (DSM) using message passing. A serious drawback of traditional approaches to this problem is that designers are required to state the desired coherence protocol at the level of asynchronous message interactions. We propose a method in which designers express the desired protocol at a high-level using rendezvous communication. These descriptions are much easier to understand and computationally more efficient to verify than asynchronous protocols due to their small state spaces. The rendezvous protocol can also be synthesized into efficient asynchronous protocols. We present our protocol refinement procedure, prove its soundness, and provide examples of its efficiency.
Citations
|
2701
|
Communicating sequential processes
– Hoare
- 1978
|
|
1351
|
The Temporal Logic of Reactive and Concurrent Systems: Specification
– Manna, Pnueli
- 1992
|
|
721
|
Design and Validation of Computer Protocols
– Holzmann
- 1990
|
|
697
|
Parallel Program Design: A Foundation
– Chandy, Misra
- 1989
|
|
364
|
The Stanford Dash multiprocessor
– Kern, Lenoski, et al.
- 1992
|
|
207
|
Protocol verification as a hardware design aid
– Dill, A, et al.
- 1992
|
|
174
|
PVS: Combining specification, proof checking, and model checking
– Owre, Rajan, et al.
|
|
168
|
et al. The Stanford FLASH Multiprocessor
– Kuskin
- 1994
|
|
95
|
Reduction: A method of proving properties of parallel programs
– Lipton
- 1975
|
|
57
|
The state of SPIN
– Holzmann, Peled
- 1996
|
|
52
|
Teapot: Language Support for Writing Memory Coherence
– Chandra, Richards, et al.
- 1996
|
|
52
|
The s3.mp scalable shared memory multiprocessor
– Nowatzyk, Aybay, et al.
- 1994
|
|
33
|
Pretending atomicity
– Lamport, Schneider
- 1989
|
|
28
|
An effective implementation for the generalized input-output construct of CSP
– Buckley, Silberschatz
- 1983
|
|
17
|
Using formal verification/analysis methods on the critical path in system design
– Eir'iksson, McMillan
- 1995
|
|
12
|
Protocol verification by aggregation of distributed transactions
– Park, Dill
- 1996
|
|
6
|
Ravindra Kuramkote. A comparison of software and hardware synchronization mechanisms for distributed shared memory multiprocessors
– Carter, Kuo
- 1996
|
|
3
|
Computer Architecture: A Quantitative Apporach
– Hennessy, Patterson
- 1996
|
|
3
|
A comparison of software and hardware synchronization mechanisms for distributed shared memory multiprocessors
– Carter, Kuo, et al.
- 1996
|
|
3
|
From synchronous to asynchronous communication
– Gribomont
- 1990
|
|
2
|
Gribo mont. From synchronous to asynchronous communication
– P
- 1990
|
|
1
|
Gribo `mont. From synchronous to asynchronous communication
– Pascal
- 1990
|
|
1
|
A correctness proof of refinement rules using PVS
– Nalumasu
- 1997
|
|
1
|
The state of SPIN. InCAV
– Holzmann, Peled
- 1996
|
