121 search results - page 1 / 25 » Efficient algorithms for verifying memory consistency |
SPAA
2005
ACM
13 years 10 months ago
2005
ACM
One approach in verifying the correctness of a multiprocessor system is to show that its execution results comply with the memory consistency model it is meant to implement. It ha...
HPCA
2006
IEEE
14 years 5 months ago
2006
IEEE
An important means of validating the design of commercial-grade shared memory multiprocessors is to run a large number of pseudo-random test programs on them. However, when intent...
SPAA
2003
ACM
13 years 10 months ago
2003
ACM
The general problem of verifying coherence for shared-memory multiprocessor executions is NP-Complete. Verifying memory consistency models is therefore NP-Hard, because memory con...
CAV
2004
Springer
13 years 8 months ago
2004
Springer
We study the problem of formally verifying shared memory multiprocessor executions against memory consistency models--an important step during post-silicon verification of multipro...
JSS
2008
13 years 4 months ago
2008
In this paper, we present an algorithm that can be used to implement sequential, causal, or cache consistency in distributed shared memory (DSM) systems. For this purpose it inclu...