DocumentCode
2830109
Title
An alternative combining architecture for large-scale shared-memory multiprocessors
Author
Tzeng, Nian-Feng
Author_Institution
Center for Adv. Comput. Studies, Southwestern Louisiana Univ., Lafayette, LA, USA
fYear
1991
fDate
11-14 Jun 1991
Firstpage
1049
Abstract
Investigates an alternative combining architecture for removing degradation of the multiprocessor interconnection network due to hot-spot contention, which results in drastically inferior performance. Based on a combining tree, the proposed combining architecture has much lower hardware complexity than the prior combining network and yet can effectively eliminate hot-spot contention. Simulation results confirm that the mean latency of hot-spot requests through the alternative combining architecture is low, provided that the concurrent hot-spot number is reasonably small (say, no more than 8). A fault-tolerant technique for the combining architecture is also addressed to significantly enhance its reliability at a little extra cost
Keywords
concurrency control; fault tolerant computing; multiprocessing systems; multiprocessor interconnection networks; parallel architectures; combining architecture; combining tree; concurrent hot-spot number; fault-tolerant technique; hardware complexity; hot-spot contention; large-scale shared-memory multiprocessors; mean latency; multiprocessor interconnection network; reliability; Computer architecture; Computer networks; Degradation; Delay; Fault tolerance; Hardware; Large-scale systems; Multiprocessor interconnection networks; Resource management; Telecommunication traffic;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 1991., IEEE International Sympoisum on
Print_ISBN
0-7803-0050-5
Type
conf
DOI
10.1109/ISCAS.1991.176545
Filename
176545
Link To Document