The Community for Technology Leaders
RSS Icon
Issue No.07 - July (2005 vol.16)
pp: 663-671
<p><b>Abstract</b>—The problem of testing shared memories for memory coherence and consistency is studied. First, it is proved that detecting violations of coherence in an execution is NP-Complete, and it remains NP-Complete for a number of restricted instances. This result leads to a proof that all known consistency models are NP-Hard to verify. The complexity of verifying consistency models is not a mere consequence of coherence, and verifying sequential consistency remains NP-Complete even after coherence has been verified.</p>
Hardware, memory structures, design styles, shared memory, reliability, testing, fault-tolerance, error-checking, theory of computation, nonnumerical algorithms and problems, sequencing and scheduling.
Jason F. Cantin, James E. Smith, "The Complexity of Verifying Memory Coherence and Consistency", IEEE Transactions on Parallel & Distributed Systems, vol.16, no. 7, pp. 663-671, July 2005, doi:10.1109/TPDS.2005.86
19 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool