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

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on parallel and distributed systems Ročník 16; číslo 7; s. 663 - 671
Hlavní autoři:	Cantin, J.F., Lipasti, M.H., Smith, J.E.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York IEEE 01.07.2005 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	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
ISSN:	1045-9219, 1558-2183
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!