|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
| ASCII Text | x | ||
| Per Stenström, Mats Brorsson, Fredrik Dahlgren, Håkan Grahn, Michel Dubois, "Boosting the Performance of Shared Memory Multiprocessors," Computer, vol. 30, no. 7, pp. 63-70, July, 1997. | |||
| BibTex | x | ||
| @article{ 10.1109/2.596630, author = {Per Stenström and Mats Brorsson and Fredrik Dahlgren and Håkan Grahn and Michel Dubois}, title = {Boosting the Performance of Shared Memory Multiprocessors}, journal ={Computer}, volume = {30}, number = {7}, issn = {0018-9162}, year = {1997}, pages = {63-70}, doi = {http://doi.ieeecomputersociety.org/10.1109/2.596630}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - MGZN JO - Computer TI - Boosting the Performance of Shared Memory Multiprocessors IS - 7 SN - 0018-9162 SP63 EP70 EPD - 63-70 A1 - Per Stenström, A1 - Mats Brorsson, A1 - Fredrik Dahlgren, A1 - Håkan Grahn, A1 - Michel Dubois, PY - 1997 VL - 30 JA - Computer ER - | |||
Shared memory multiprocessors make it practical to convert sequential programs to parallel ones in a variety of applications. An emerging class of shared memory multiprocessors are nonuniform memory access machines with private caches and a cache coherence protocol.
Proposed hardware optimizations to CC-NUMA machines can shorten the time processors lose because of cache misses and invalidations. The authors look at cost-performance trade-offs for each of four proposed optimizations: release consistency, adaptive sequential prefetching, migratory sharing detection, and hybrid update/invalidate with a write cache.
The four optimizations differ with respect to which application features they attack, what hardware resources they require, and what constraints they impose on the application software. The authors measured the degree of performance improvement using the four optimizations in isolation and in combination, looking at the trade-offs in hardware and programming complexities.
Although one combination of the proposed optimizations (prefetching and migratory sharing detection) can boost a sequentially consistent machine to perform as well as a machine with release consistency, release consistency models offer significant performance improvements across a broad application domain at little extra complexity in the machine design. Moreover, a combination of sequential prefetching and hybrid update/invalidate with a write cache cuts the execution time of a sequentially consistent machine by half with fairly modest changes to the second-level cache and the cache protocol. The authors expect that designers will begin to turn more to the release consistency model.

