TY - GEN
T1 - A performance bound analysis of multistage Combining networks using a probabilistic model
AU - Kang, Byung Chang
AU - Lee, Gyungho
AU - Kain, Richard
N1 - Funding Information:
t’ This work was supported in part by the Graduate School at the University of Minnesota and SamSung Electronic Co. Ltd. tt The second author is currently with Samsung Electronics-Computers in Seoul, Korea, on leave of absence from the University of Minnesota. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requiree a fee and/or specific permission. @1991 ACM 0-89791 -434-1/91 /0006 /0448 ...$1 .50
Publisher Copyright:
© 1991 ACM.
PY - 1991/6/1
Y1 - 1991/6/1
N2 - Combining networks have been suggested to improve the performance of shared memory MIMD computer systems, which can be seriously degraded when many processors access a shared variable at virtually the same time. Although it has been claimed that combining improves performance, the performance improvement has not been fully analyzed because of the complicated nature of combining networks. In this paper we introduce a probabilistic model to evaluate the performance of combining networks quantitatively. Using the probabilistic approach, we show a performance bound of multistage networks that use 2x2 combining switches. The bounds of performance improvement, in terms of network bandwidth and delay gain, are presented. We also discuss the effect of changing the combining queue size on the performance of combining networks.
AB - Combining networks have been suggested to improve the performance of shared memory MIMD computer systems, which can be seriously degraded when many processors access a shared variable at virtually the same time. Although it has been claimed that combining improves performance, the performance improvement has not been fully analyzed because of the complicated nature of combining networks. In this paper we introduce a probabilistic model to evaluate the performance of combining networks quantitatively. Using the probabilistic approach, we show a performance bound of multistage networks that use 2x2 combining switches. The bounds of performance improvement, in terms of network bandwidth and delay gain, are presented. We also discuss the effect of changing the combining queue size on the performance of combining networks.
UR - http://www.scopus.com/inward/record.url?scp=84941870773&partnerID=8YFLogxK
U2 - 10.1145/109025.109128
DO - 10.1145/109025.109128
M3 - Conference contribution
AN - SCOPUS:84941870773
SN - 0897914341
SN - 9780897914345
T3 - Proceedings of the International Conference on Supercomputing
SP - 448
EP - 457
BT - ICS 1991 - Proceedings of the 5th International Conference on Supercomputing
A2 - Davidson, Edward S.
A2 - Hossfield, Friedel
PB - Association for Computing Machinery
T2 - 5th International Conference on Supercomputing, ICS 1991
Y2 - 17 June 1991 through 21 June 1991
ER -