The complexity of verifying memory coherence and consistency

The complexity of verifying memory coherence and consistency

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on parallel and distributed systems 2005-07, Vol.16 (7), p.663-671
Hauptverfasser: Cantin, J.F., Lipasti, M.H., Smith, J.E.
Format: Artikel
Sprache:eng
Schlagworte:
Algorithm design and analysis
Circuit testing
Coherence
design styles
error-checking
Fault tolerance
Hardware
memory structures
Multiprocessing systems
nonnumerical algorithms and problems
Processor scheduling
reliability
Reliability theory
Scheduling algorithm
sequencing and scheduling
shared memory
System testing
testing
theory of computation
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:1045-9219
1558-2183
DOI:10.1109/TPDS.2005.86