𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Cache-Based Synchronization in Shared Memory Multiprocessors

✍ Scribed by Umakishore Ramachandran; Joonwon Lee

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
343 KB
Volume
32
Category
Article
ISSN
0743-7315

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Integrating Fine-Grained Message Passing
Integrating Fine-Grained Message Passing in Cache Coherent Shared Memory Multiprocessors
✍ David K. Poulsen; Pen-Chung Yew πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 397 KB

This paper considers the use of data prefetching and an alternative mechanism, data forwarding, for reducing memory latency caused by interprocessor communication in cache coherent, shared memory multiprocessors. Data prefetching is accomplished by using a multiprocessor software pipelined algorithm

The Performance Implications of Locality
The Performance Implications of Locality Information Usage in Shared-Memory Multiprocessors
✍ Frank Bellosa; Martin Steckermeier πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 326 KB

The latest processor generations-e.g., HPPA 8000, MIPS R10000 or Ultra SPARC-include a monitoring unit. A processor monitor can count events like read/write cache misses and processor stall cycles due to load and store operations. This information is usually only used for offline profiling. However,

Evaluation of Compiler-Controlled Updati
Evaluation of Compiler-Controlled Updating to Reduce Coherence-Miss Penalties in Shared-Memory Multiprocessors
✍ Jonas Skeppstedt; Fredrik Dahlgren; Per StenstrΓΆm πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 291 KB

We consider in this paper the effectiveness of a new approach called compiler-controlled updating to reduce coherence-miss penalties in shared-memory multiprocessors. A key part of the method is a compiler algorithm that identifies the last store instruction to a memory block in a flow graph using c