This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Indirect Star-Type Networks for Large Multiprocessor Systems
November 1991 (vol. 40 no. 11)
pp. 1277-1282

The authors propose three indirect star-type networks, the indirect star networks I and II and the star-delta network, and investigate their properties. An indirect star-type network is obtained by unfolding the star graph. The star-delta network is obtained through an unfolding scheme based on the recursive property of the star graph, and has n-1 switching stages. The star-delta network has the advantage of being controlled by the destination tag routing scheme. The indirect star-type networks are to the star graph as the indirect cube-type networks are to the n-cube. The authors analyze the performance of the indirect star-type networks under uniform traffic to investigate their potential as an alternative to the indirect cube-type networks for the future high-performance large multiprocessor systems.

[1] S.B. Akers, D. Harel, and B. Krishnamurthy, "The star graph: An attractive alternative to the n-cube," inProc. 1987 Int. Conf. Parallel Processing, Aug. 1987, pp. 393-400.
[2] S.B. Akers and B. Krishnamurthy, "A group theoretic model for symmetric interconnection networks," inProc. 1986 Int. Conf. Parallel Processing, Aug. 1986, pp. 216-223.
[3] S.B. Akers and B. Krishnamurthy, "The fault tolerance of star graphs," inProc. 2nd Int. Conf. Supercomput., 1987.
[4] J.R. Armstrong and F.G. Gray, "Fault diagnosis in Boolean n-cube array of microprocessors,"IEEE Trans. Comput., vol. C-30, pp. 587-590, Aug. 1981.
[5] F. S. Baskett and A. J. Smith, "Interference in multiprocessor computer systems with interleaved memory,"Commun. ACM, vol. 19, pp. 327-334, Jun. 1976.
[6] D.P. Bhandarkar, "Analysis of memory interference in multiprocessors,"IEEE Trans. Comput.vol. C-24, pp. 897-908, Sept. 1975.
[7] N.L. Briggs,Algebraic Graph TheoryCambridge, MA: Cambridge University Press, 1974.
[8] D.Y. Chang, D.J. Kuck, and D.H. Lawrie, "On the effective bandwidth of parallel memories,"IEEE Trans. Comput.vol. C-26, pp. 480-490, May 1977.
[9] D.J. Kuck and R.A. Stokes, "The Burroughs Scientific Processor (BSP)."IEEE Trans. Comput., vol. C-31, pp. 363-376, May 1982.
[10] K.Y. Lee, H. Yoon, and M.T. Liu, "Performance evaluation of a class of multi-path packet switching interconnection networks,"J. Parallel Distributed Comput., to be published.
[11] J.H. Patel, "Performance of processor-memory interconnections for multiprocessors,"IEEE Trans. Comput., vol. C-30, pp. 771-780, Oct. 1981.
[12] M.C. Pease III, "The indirect binary n-cube microprocessor array,"IEEE Trans. Comput., vol. C-26, pp. 458-473, May 1977.
[13] C.L. Seitz, "Concurrent VLSI architectures,"IEEE Trans. Comput., vol. C-33, pp. 1247-1265, Dec. 1984.
[14] W.D. Strecker, "Analysis of the instruction execution rate in certain computer structure," Ph.D. dissertation, Carnegie-Mellon Univ., 1970.
[15] H. Yoon, K. Y. Lee, and M. T. Liu, "Performance analysis and comparison of packet switching interconnection networks," inProc. 1987 Int. Conf. Parallel Processing, pp. 542-545, Aug. 1987.

Index Terms:
star network II; large multiprocessor systems; indirect star-type networks; star networks I; star-delta network; star-delta network; unfolding scheme; recursive property; destination tag routing scheme; indirect cube-type networks; n-cube; performance; multiprocessor interconnection networks; performance evaluation.
Citation:
K.Y. Lee, H. Yoon, "Indirect Star-Type Networks for Large Multiprocessor Systems," IEEE Transactions on Computers, vol. 40, no. 11, pp. 1277-1282, Nov. 1991, doi:10.1109/12.102833
Usage of this product signifies your acceptance of the Terms of Use.