Distributing hot-spot addressing in large-scale multiprocessors
Technical Report
·
OSTI ID:7258116
When a large number of processors try to access a common variable, referred to as hot-spot accesses by Pfister and Norton not only can the resulting memory contention seriously degrade performance, but it may also cause tree saturation in the interconnection network which blocks both hot-spot and regular requests alike. It is shown by Pfister and Norton that even if only a small percentage of all requests are to a hot-spot location, these requests can cause very serious performance problems, and networks that do the necessary combining of requests are suggested to keep the interconnection network and memory contention from becoming a bottleneck. Instead we propose a software combining tree concept and show that it is effective in decreasing memory contention and preventing tree saturation because it distributes hot-spot accesses over a software tree whose nodes can be dispersed among many memoray modules. Thus it is an inexpensive alternative to expensive combining networks. 16 refs., 9 figs.
- Research Organization:
- Illinois Univ., Urbana (USA). Center for Supercomputing Research and Development
- DOE Contract Number:
- FG02-85ER25001
- OSTI ID:
- 7258116
- Report Number(s):
- DOE/ER/25001-24; CSRD-540; ON: DE87002072
- Country of Publication:
- United States
- Language:
- English
Similar Records
Distributing hot-spot addressing in large-scale multiprocessors
Hot spot analysis in large scale shared memory multiprocessors
On the effectiveness of combining in resolving hot spot'' contention
Journal Article
·
Tue Mar 31 23:00:00 EST 1987
· IEEE Trans. Comput.; (United States)
·
OSTI ID:6624924
Hot spot analysis in large scale shared memory multiprocessors
Conference
·
Thu Dec 30 23:00:00 EST 1993
·
OSTI ID:46284
On the effectiveness of combining in resolving hot spot'' contention
Journal Article
·
Mon Jan 31 23:00:00 EST 1994
· Journal of Parallel and Distributed Computing; (United States)
·
OSTI ID:7279722