
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
S.P. Dandamudi, D.L. Eager, "Hierarchical Interconnection Networks for Multicomputer Systems," IEEE Transactions on Computers, vol. 39, no. 6, pp. 786797, June, 1990.  
BibTex  x  
@article{ 10.1109/12.53600, author = {S.P. Dandamudi and D.L. Eager}, title = {Hierarchical Interconnection Networks for Multicomputer Systems}, journal ={IEEE Transactions on Computers}, volume = {39}, number = {6}, issn = {00189340}, year = {1990}, pages = {786797}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.53600}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Hierarchical Interconnection Networks for Multicomputer Systems IS  6 SN  00189340 SP786 EP797 EPD  786797 A1  S.P. Dandamudi, A1  D.L. Eager, PY  1990 KW  multicomputer systems; performance analysis; hierarchical interconnection networks; static analysis; queueing delays; queueing analysis; costbenefit ratios; performance enhancement schemes; routing algorithms; multiprocessor interconnection networks; performance evaluation; queueing theory. VL  39 JA  IEEE Transactions on Computers ER   
A performance analysis of a class of hierarchical interconnection networks is presented. The analysis includes both static analysis (i.e. queueing delays are neglected) and queueing analysis. In both cases, the hierarchical networks are shown to have better costbenefit ratios. The queueing analysis is also validated by several simulation experiments. The impact of two performance enhancement schemesreplication of links and improved routing algorithmson hierarchical interconnection network performance is also presented.
[1] D. P. Agrawalet al., "Evaluating the performance of multicomputer configurations,"IEEE Comput. Mag., vol. 19, pp. 2337, May 1986.
[2] D. P. Agrawal and I. E. O. Mahgoub, "Performance analysis of clusterbased supersystems," inProc. 1st Int. Conf. Supercomput. Syst., IEEE Computer Society Press, 1985, pp. 593602.
[3] L. N. Bhuyan and D. P. Agrawal, "A general class of processor interconnection strategies," inProc. 9th Symp. Comput. Architecture, 1982, pp. 2629.
[4] D. Carlson, "The mesh with a global mesh: A flexible, highspeed organization for parallel computation," inProc. 1st Int. Conf. Supercomput. Syst., IEEE Computer Society Press, 1985, pp. 618627.
[5] W. Crowtheret al., "Performance measurements on a 128node butterfly parallel processor," inProc. 1985 Int. Conf. Parallel Processing, 1985, pp. 531540.
[6] S. P. Dandamudi, "Hierarchical interconnection networks for multicomputer systems," Ph.D. dissertation, Dep. Computat. Sci., Univ. Saskatchewan, Saskatoon, 1988.
[7] A. M. Despain and D. A. Patterson, "Xtree: A tree structured multiprocessor computer architecture," inProc. Fifth Int. Symp. Comput. Architecture, Apr. 1978, pp. 144151.Comput. Architecture, pp. 2128, Dec. 1973.
[8] TY. Feng, "A survey of interconnection networks,"IEEE Comput. Mag., vol. 14, pp. 1227, 1981.
[9] D. Gajski, D. Kuck, D. Lawrie, and A. Sameh, "CEDAR," Dep. Comput. Sci., Univ. of Illinois, Urbana, 1983. (Reprinted inTutorial on Supercomputers: Design and Applications, K. Hwang, Ed., IEEE Computer Society Press, 1983, pp. 251275.)
[10] G. Gopal and J. W. Wong, "Delay analysis of broadcast routing in packetswitching networks,"IEEE Trans. Comput., vol. C30, pp. 915922, 1981.
[11] A. Gottliebet al., "The NYU UltracomputerDesigning a MIMD, shared memory parallel machine,"IEEE Trans. Comput., vol. C32, pp. 175189, 1983.
[12] J. A. Harris and D. R. Smith, "Hierarchical multiprocessor organizations," inProc. 4th Symp. Comput. Architecture, 1977, pp. 4148.
[13] J. P. Hayes, T. N. Mudge, Q. F. Stout, S. Colley, and J. Palmer, "Architecture of a hypercube supercomputer," inProc. 1986 Int. Conf. Parallel Processing, 1986, pp. 653660.
[14] W. D. Hillis,The Connection Machine. Cambridge, MA: MIT Press, 1985.
[15] E. Horowitz and A. Zorat, "The binary tree as an interconnection network: Applications to multiprocessor systems and VLSI,"IEEE Trans. Comput., vol. C30, pp. 247253, 1981.
[16] L. Kleinrock,Queueing Systems: Vol. 1. New York: Wiley, 1975.
[17] L. Kleinrock,Queueing Systems: Vol. 2. New York: Wiley, 1976.
[18] D. Lawrie, "Access and alignment of data in an array processor,"IEEE Trans. Comput., vol. C24, pp. 11451155, 1975.
[19] E. D. Lazowska, J. Zahorjan, G. S. Graham, and K. C. Sevcik,Computer System Performance. Englewood Cliffs, NJ: PrenticeHall, 1984.
[20] D. D. Leondorf, "Development and use of an asynchronous MIMD computer for finite element analysis," inAlgorithmically Specialized Parallel Computers, L. Snyder, L. H. Jamieson, D. B. Gannon, and J. H. Siegel, Eds. New York: Academic, 1985, pp. 213222.
[21] D. Nassimi and S. Sahni, "Bitonic sort on a meshconnected parallel computer,"IEEE Trans. Comput., vol. C28, pp. 27, 1979.
[22] D. Nassimi and S. Sahni, "Finding connected components and connected ones on a meshconnected parallel computer,"SIAM J. Comput., vol. 9, pp. 744757, 1980.
[23] G. F. Pfister, W. C. Brantley, D. A. George, S. L. Harvey, K. P. Kleinfelder, E. A. Melton, V. A. Norton, and J. Wiess, "The IBM Research Parallel Processor Prototype (RP3): Introduction and architecture," inProc. 1985 Int. Conf. Parallel Processing, 1985, pp. 764771.
[24] F. P. Preparata and J. Vuillemin, "The cubeconnected cycle: A versatile network for parallel computation,"Commun. ACM, vol. 24, pp. 300309, May 1981.
[25] C. L. Seitz, "The Cosmic Cube,"Commun. ACM, pp. 2233, Jan. 1985.
[26] L. Snyder, "Introduction to the configurable highly parallel computer,"IEEE Comput. Mag., vol. 15, pp. 4756, 1982.
[27] L. Snyder, "Supercomputers and VLSI: The effects of largescale integration on computer architecture," inAdvances in Computers. New York, Academic, 1984, pp. 133.
[28] L. Snyder, "Type architectures, shared memory and the corollary of modest potential,"Annu. Rev. Comput. Sci., vol. 1, pp. 289317, 1986.
[29] Q. F. Stout, "Meshconnected computers with broadcasting,"IEEE Trans. Comput., vol. C32, pp. 826830, 1983.
[30] C. WhitbyStrevens, "The Transputer," inProc. 12th Annu. Symp. Comput. Architecture, Boston, MA, June 1985, pp. 292300.
[31] R. J. Swan, S. H. Fuller, and D. Siewiorek, "Cm*A modular, multiprocessor," inProc. Nat. Comput. Conf., 1977, pp. 3946. (Reprinted inTutorial on Parallel Processing, R. H. Kuhn and D. A. Padua, Eds. IEEE Computer Society Press, 1981, pp. 146153.)
[32] C. D. Thompson and H. T. Kung, "Sorting on a mesh connected processor array,"Commun. ACM, pp. 263271, 1972.
[33] L. D. Wittie, "Communication structures for large networks of microcomputers,"IEEE Trans. Comput., vol. C30, pp. 264273, 1981.
[34] S. W. Wu and M. T. Liu, "A cluster structure as an interconnection network for large multicomputer systems,"IEEE Trans. Comput., vol. C30, pp. 254264, 1981.