✦ LIBER ✦

Reducing hot-spot contention in shared-memory multiprocessor systems

✍ Scribed by Dandamudi, S.P.

Book ID: 114561097
Publisher: IEEE Computer Society
Year: 1999
Tongue: English
Weight: 170 KB
Volume: 7
Category: Article
ISSN: 1092-3063
DOI: 10.1109/4434.749135

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Reducing run queue contention in shared

Reducing run queue contention in shared memory multiprocessors

✍ Dandamudi, S.P. 📂 Article 📅 1997 🏛 IEEE 🌐 English ⚖ 147 KB

Design tradeoffs for process scheduling

Design tradeoffs for process scheduling in shared memory multiprocessor systems

✍ Ni, L.M.; Wu, C.-F.E. 📂 Article 📅 1989 🏛 IEEE 🌐 English ⚖ 786 KB

Prospects of distributed shared memory f

Prospects of distributed shared memory for reducing global traffic in shared-bus multiprocessors

✍ Gyungho Lee; Jinseok Kong 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 431 KB

Analysis on Memory Contentions in a Homo

Analysis on Memory Contentions in a Homogeneous Multiprocessor System

✍ Yongjian Zhao; Hiromi Okada; Sadao Maekawa 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 817 KB

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

Stochastic model of a multiprocessor sys

Stochastic model of a multiprocessor system in the presence of memory contention

✍ R Gchönefeld; H Jacobi 📂 Article 📅 1985 🏛 Elsevier Science ⚖ 278 KB