Memory access dependencies in shared-memory multiprocessors
Michel Dubois, C. Scheurich · IEEE Transactions on Software Engineering · 1990
The presence of high-performance mechanisms in shared-memory multiprocessors such as private caches, the extensive pipelining of memory access, and combining networks may render a logical concurrency model complex to implement or inefficient. The problem of implementing a given logical concurrency model in such a multiprocessor is addressed. Two concurrency models are considered, and simple rules are introduced to verify that a multiprocessor architecture adheres to the models. The rules are applied to several examples of multiprocessor architectures.>
Cited by 106 works. doi:10.1109/32.55094
Authors
References
- Time, clocks, and the ordering of events in a distributed system
- Cache Memories
- Proving the Correctness of Multiprocess Programs
- Solution of a problem in concurrent programming control
- How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
- Solution of a problem in concurrent programming control
- The NYU Ultracomputer—Designing an MIMD Shared Memory Parallel Computer
- Additional comments on a problem in concurrent programming control
- A New Solution to Coherence Problems in Multicache Systems
- The IBM Research Parallel Processor Prototype (RP3): Introduction and Architecture.