Verifying Sequential Consistency on Shared-Memory Multiprocessors by Model Checking
Сохранить в:
| Опубликовано в:: | arXiv.org (Aug 25, 2001), p. n/a |
|---|---|
| Главный автор: | |
| Опубликовано: |
Cornell University Library, arXiv.org
|
| Предметы: | |
| Online-ссылка: | Citation/Abstract Full text outside of ProQuest |
| Метки: |
Нет меток, Требуется 1-ая метка записи!
|
MARC
| LEADER | 00000nab a2200000uu 4500 | ||
|---|---|---|---|
| 001 | 2092434205 | ||
| 003 | UK-CbPIL | ||
| 022 | |a 2331-8422 | ||
| 035 | |a 2092434205 | ||
| 045 | 0 | |b d20010825 | |
| 100 | 1 | |a Qadeer, Shaz | |
| 245 | 1 | |a Verifying Sequential Consistency on Shared-Memory Multiprocessors by Model Checking | |
| 260 | |b Cornell University Library, arXiv.org |c Aug 25, 2001 | ||
| 513 | |a Working Paper | ||
| 520 | 3 | |a The memory model of a shared-memory multiprocessor is a contract between the designer and programmer of the multiprocessor. The sequential consistency memory model specifies a total order among the memory (read and write) events performed at each processor. A trace of a memory system satisfies sequential consistency if there exists a total order of all memory events in the trace that is both consistent with the total order at each processor and has the property that every read event to a location returns the value of the last write to that location. Descriptions of shared-memory systems are typically parameterized by the number of processors, the number of memory locations, and the number of data values. It has been shown that even for finite parameter values, verifying sequential consistency on general shared-memory systems is undecidable. We observe that, in practice, shared-memory systems satisfy the properties of causality and data independence. Causality is the property that values of read events flow from values of write events. Data independence is the property that all traces can be generated by renaming data values from traces where the written values are distinct from each other. If a causal and data independent system also has the property that the logical order of write events to each location is identical to their temporal order, then sequential consistency can be verified algorithmically. Specifically, we present a model checking algorithm to verify sequential consistency on such systems for a finite number of processors and memory locations and an arbitrary number of data values. | |
| 653 | |a Distributed shared memory | ||
| 653 | |a Consistency | ||
| 653 | |a Algorithms | ||
| 653 | |a Processors | ||
| 653 | |a Microprocessors | ||
| 653 | |a Computer memory | ||
| 653 | |a Multiprocessing | ||
| 773 | 0 | |t arXiv.org |g (Aug 25, 2001), p. n/a | |
| 786 | 0 | |d ProQuest |t Engineering Database | |
| 856 | 4 | 1 | |3 Citation/Abstract |u https://www.proquest.com/docview/2092434205/abstract/embedded/L8HZQI7Z43R0LA5T?source=fedsrch |
| 856 | 4 | 0 | |3 Full text outside of ProQuest |u http://arxiv.org/abs/cs/0108016 |