This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Analysis of Finite Buffered Multistage Combining Networks
July 1995 (vol. 6 no. 7)
pp. 760-766

Abstract—Analyzing the performance of finite buffered multistage networks has been considered a difficult task because of dynamic blocking effects due to finite sized buffers. With the multistage networks enhanced with combining capability, in which multiple requests directed to a shared location combine together to form a single request to be forwarded, the analysis becomes even more difficult due to the interactions between combining probability and queuing delay. Performance bounds for combining networks are known under two extreme assumptions: infinite combining queues and saturated finite combining queues. We analyze multistage combining networks with the consideration of blocking due to finite combining queues. Our analysis provides iterative solutions for combining probability, blocking probability, and queuing delay.

[1] R. Bianchini,S. Dickey,J. Edler,G. Goodman,A. Gottlieb,R. Kenner,, and J. Wang,“The Ultra III prototype,” Proc. Parallel Systems Fair Seventh Int’l Parallel Processing Symp., IEEE Computer Society Press, Apr. 1993.
[2] S. Dickey,Systolic Combining Queue Designs, PhD thesis, Dept. Computer Science, New York University, 1994.
[3] J. Ding and L. Bhuyan,“Finite buffer analysis of multistage interconnection networks,” IEEE Trans. Computers, vol. 43, no. 2, pp. 243-246, Feb. 1994.
[4] A. Gottlieb,R. Grishman,C.P. Krushkal,, and K.P. Mcauliffe,“The NYU Ultracomputer-designing an MIMD shared memory parallel computer,” IEEE Trans. Computers, vol. 32, no. 2, Feb. 1983.
[5] Y.-C. Jenq,“Performance analysis of a packet switch based on single-buffered Banyan network,” IEEE J. Selected Areas in Communications, vol. 1, no. 6, pp. 1,014-1,021, Dec. 1983.
[6] B.C. Kang,G. Lee,, and R. Kain,“A performance bound analysis of multistage combining networks using a probabilistic model,” Proc. 1991 Int’l Conf. Supercomputing, ACM Press, pp. 448-457, 1991.
[7] C.P. Kruskal and M. Snir,“The performance of multistage interconnection networks for multiprocessors,” IEEE Trans. Computers, vol. 32, no. 12, Dec. 1983.
[8] D.H. Lawrie,“Access and alignment of data in an array processor,” IEEE Trans. Computers, vol. 24, pp. 1,145-1,155, Dec. 1975.
[9] G. Lee,C.P. Kruskal,, and D.J. Kuck,“On the effectiveness of combining in resolving’hot spot’contention,” J. Parallel and Distributed Computing, vol. 20, no. 2, pp. 136-144, 1994.
[10] G. Lee,“Another combining scheme to reduce hot spot contention in large scale shared memory parallel computers,” Lecture Notes in Computer Science, Vol. 297: Supercomputing, E.N. Houstis, T.S. Papatheodorou, and C.D. Polychronopoulos, eds., Springer-Verlag, 1988, pp. 68-79.
[11] G. Lee,“A performance bound of multistage combining networks,” IEEE Trans. Computers, vol. 38, no. 10, pp. 1,387-1,395, Oct. 1989.
[12] Y. Mun and H.Y. Youn,“Performance analysis of finite buffered multistage interconnection networks,” IEEE Trans. Computers, vol. 43, no. 2, pp. 153-162, Feb. 1994.
[13] G.F. Pfister,W.C. Brantley,D.A. George,S.L. Harvey,W.J. Kleinfelder,K.P. McAuliffe,E.A. Melton,V.A. Norton,, and J. Weiss,“The IBM research parallel processor prototype (RP3): Introduction and architecture,” Proc. Int’l Conf. Parallel Processing, pp. 764-771, 1985.
[14] G.F. Pfister and V.A. Norton,“Hot spot contention and combining in multistage interconnection networks,” IEEE Trans. Computers, vol. 34, no. 10, pp. 943-948, Oct. 1985.
[15] N.F. Tzeng,“A cost-effective combining structure for large-scale shared-memory multiprocessors,” IEEE Trans. Computers, vol. 41, no. 11, pp. 1,420-1,429, Nov. 1992.
[16] P. C. Yew, N. F. Tzeng, and D. H. Lawrie,“Distributing hot-spot addressing in large-scale multiprocessors,”IEEE Trans. Comput., vol. C-36, pp. 388–395, Apr. 1987.
[17] H. Yoon,K.Y. Lee,, and M.T. Liu,“Performance analysis of multibuffered packet-switching networks in multiprocessor systems,” IEEE Trans. Computers, vol. 39, no. 3, pp. 319-327, Mar. 1990.

Index Terms:
Combining, hot-spot traffic, multistage interconnection network, performance analysis, queuing delay.
Citation:
Gyungho Lee, Byung-Chang Kang, Richard Y. Kain, "Analysis of Finite Buffered Multistage Combining Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 6, no. 7, pp. 760-766, July 1995, doi:10.1109/71.395405
Usage of this product signifies your acceptance of the Terms of Use.