This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Reducing Contention in Shared-Memory Multiprocessors
November 1988 (vol. 21 no. 11)
pp. 26-37
ASCII Text
x 
 
Per Stenstrom, "Reducing Contention in Shared-Memory Multiprocessors," Computer, vol. 21, no. 11, pp. 26-37, November, 1988.
 
 
BibTex
x
 
@article{ 10.1109/2.86784,
author = {Per Stenstrom},
title = {Reducing Contention in Shared-Memory Multiprocessors},
journal ={Computer},
volume = {21},
number = {11},
issn = {0018-9162},
year = {1988},
pages = {26-37},
doi = {http://doi.ieeecomputersociety.org/10.1109/2.86784},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - MGZN
JO - Computer
TI - Reducing Contention in Shared-Memory Multiprocessors
IS - 11
SN - 0018-9162
SP26
EP37
EPD - 26-37
A1 - Per Stenstrom,
PY - 1988
VL - 21
JA - Computer
ER -
 

The techniques that can be used to design a memory system that reduces the impact of contention are examined. To exemplify the techniques, the implementations and the design decisions taken in each are reviewed. The discussion covers memory organization, interconnection networks, memory allocation, cache memory, and synchronization and contention. The multiprocessor implementations considered are C.mmp, CM*, RP3, Alliant FX, Cedar, Butterfly, SPUR, Dragon, Multimax, and Balance.

Citation:
Per Stenstrom, "Reducing Contention in Shared-Memory Multiprocessors," Computer, vol. 21, no. 11, pp. 26-37, Nov. 1988, doi:10.1109/2.86784
Usage of this product signifies your acceptance of the Terms of Use.