This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Performance Analysis of Single Stage Interconnection Networks
March 1991 (vol. 40 no. 3)
pp. 357-365

A single-stage interconnection network (SSIN) consisting of only one stage of switches and recirculation through processors is studied. An analytical probability model for SSINs using 2*2 switches is introduced, and results obtained with the model are compared with simulation results. Four SSINs with different network sizes, loading, and routing strategies are discussed. Processors with and without buffers are considered, and three different routing strategies are applied to resolve conflicts. The analytical model is seen to be in close agreement with the simulation results while providing at least an order of magnitude reduction in CPU time.

[1] T. Y. Feng, "A survey of interconnection networks,"IEEE Comput. Mag., vol. 4, pp. 12-27, Dec. 1981.
[2] D. P. Agrawal, "Advanced computer architecture," Tutorial Text, Computer Society Press, 386 pp., 1986.
[3] J. E. Wirsching and T. Kishi, "Minimization of path lengths in single stage connection networks," inProc. 3rd Int. Conf. Distributed Comput. Syst., Oct. 18-22, 1982, pp. 563-571.
[4] X. N. Tan and K. C. Sevcik, "Reduced distance routing in single-stage shuffle-exchange interconnection networks," Tech. Rep., Computer System Research Institute, Univ. of Toronto, Sept. 1986, 32 pp.
[5] J. R. Burke and D. P. Agrawal, "On static and dynamic interconnection networks," inProc. 25th Annu. Conf., South Region, ACM, Apr. 1-3, 1987, pp. 186-192.
[6] J. R. Burke, "Single stage interconnection networks and the impact of multiple faults on performance," M.S. thesis, N.C. State Univ., Apr. 1986.
[7] H. S. Stone, "Parallel processing with the perfect shuffle,"IEEE Trans. Comput., vol. C-20, no. 2, pp. 153-161, Feb. 1971.
[8] T. Lang and H. S. Stone, "A shuffle-exchange network with simplified control,"IEEE Trans. Comput., vol. C-25, no. 1, pp. 55-65, Jan. 1976.
[9] P-Y. Chen, D. H. Lawrie, and P-C. Yew, "Interconnection networks using shuffles,"IEEE Comput. Mag., pp. 55-64, Dec. 1981.
[10] D. P. Agrawal, S. C. Kim, and N. K. Swain, "Analysis and design of nonequivalent multistage interconnection networks,"IEEE Trans. Comput., vol. C-37, no. 2, pp. 232-236, Feb. 1988.
[11] D. P. Agrawal and J. S. Leu, "Dynamic accessibility testing and path length optimization of multistage interconnection networks,"IEEE Trans. Comput., vol. C-34, no. 3, pp. 255-266, Mar. 1985.

Index Terms:
performance analysis; conflict resolution; single stage interconnection networks; switches; recirculation; processors; analytical probability model; simulation; loading; routing; buffers; CPU time; multiprocessor interconnection networks; performance evaluation; queueing theory.
Citation:
J.R. Burke, C. Chen, T.-Y. Lee, D.P. Agrawal, "Performance Analysis of Single Stage Interconnection Networks," IEEE Transactions on Computers, vol. 40, no. 3, pp. 357-365, March 1991, doi:10.1109/12.76415
Usage of this product signifies your acceptance of the Terms of Use.