Change search
ReferencesLink to record
Permanent link

Direct link
Boosting the Performance of Shared Memory Multiprocessors
Show others and affiliations
Responsible organisation
1997 (English)In: Computer, ISSN 0018-9162, E-ISSN 1558-0814, Vol. 30, no 7, 63-70 p.Article in journal (Refereed) Published
Abstract [en]

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.

Place, publisher, year, edition, pages
Long Beach, Calif.: IEEE Computer Society , 1997. Vol. 30, no 7, 63-70 p.
National Category
Computer Science
URN: urn:nbn:se:bth-9774Local ID: diva2:837712
Available from: 2012-09-18 Created: 2000-03-15 Last updated: 2015-06-30Bibliographically approved

Open Access in DiVA

fulltext(102 kB)40 downloads
File information
File name FULLTEXT01.pdfFile size 102 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Grahn, Håkan
In the same journal
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 40 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 32 hits
ReferencesLink to record
Permanent link

Direct link