DocumentCode
1293628
Title
“Hot spot” contention and combining in multistage interconnection networks
Author
Pfister, Gregory F. ; Norton, V. Alan
Author_Institution
IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
Issue
10
fYear
1985
Firstpage
943
Lastpage
948
Abstract
The combining of messages within a multistage switching network has been proposed to reduce memory contention in highly parallel shared-memory multiprocessors, especially for shared lock and synchronization data. A quantitative investigation of the performance impact of such contention and the effectiveness of combining in reducing this impact is reported. The effect of a nonuniform traffic pattern consisting of a single hot spot of higher access rate superimposed on a background of uniform traffic was investigated. The potential degradation due to even moderate hot spot traffic was found to be very significant, severely degrading all memory access, not just access to shared lock locations, due to an effect the authors call tree saturation. The technique of message combining was found to be an effective means of eliminating this problem if it arises due to lock or synchronization contention.
Keywords
computer networks; multiprocessing systems; switching networks; synchronisation; highly parallel shared-memory multiprocessors; hot spot contention; memory contention; multistage interconnection networks; multistage switching network; nonuniform traffic pattern; performance impact; shared lock; synchronization data; tree saturation; Parallel processing; Program processors; Routing; Switches; Telecommunication traffic; Throughput; Time factors; Concurrent computation; highly parallel systems; hot spots; message combining; multiprocessors; multistage interconnection networks; parallel processing;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/TC.1985.6312198
Filename
6312198
Link To Document