This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Distributing Hot-Spot Addressing in Large-Scale Multiprocessors
April 1987 (vol. 36 no. 4)
pp. 388-395
null Pen-Chung Yew, Center for Supercomputing Research and Development, University of Illinois
When a large number of processors try to access a common variable, referred to as hot-spot accesses in [6], not only can the resulting memory contention seriously degrade performance, but it can also cause tree saturation in the interconnection network which blocks both hot and regular requests alike. It is shown in [6] that even if only a small percentage of all requests are to a hot-spot, these requests can cause very serious performances problems, and networks that do the necessary combining of requests are suggested to keep the interconnection network and memory contention from becoming a bottleneck.
Index Terms:
synchronization, Combining networks, hot-spot memory, memory bandwidth, memory contention, software combining tree
Citation:
null Pen-Chung Yew, null Nian-Feng Tzeng, D.H. Lawrie, "Distributing Hot-Spot Addressing in Large-Scale Multiprocessors," IEEE Transactions on Computers, vol. 36, no. 4, pp. 388-395, April 1987, doi:10.1109/TC.1987.1676921
Usage of this product signifies your acceptance of the Terms of Use.