
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
W.J. Dally, "Performance Analysis of kary ncube Interconnection Networks," IEEE Transactions on Computers, vol. 39, no. 6, pp. 775785, June, 1990.  
BibTex  x  
@article{ 10.1109/12.53599, author = {W.J. Dally}, title = {Performance Analysis of kary ncube Interconnection Networks}, journal ={IEEE Transactions on Computers}, volume = {39}, number = {6}, issn = {00189340}, year = {1990}, pages = {775785}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.53599}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Performance Analysis of kary ncube Interconnection Networks IS  6 SN  00189340 SP775 EP785 EPD  775785 A1  W.J. Dally, PY  1990 KW  kary ncube interconnection networks; VLSI communication networks; switches; average case throughput; lowdimensional networks; multiprocessor interconnection networks; VLSI. VL  39 JA  IEEE Transactions on Computers ER   
VLSI communication networks are wirelimited, i.e. the cost of a network is not a function of the number of switches required, but rather a function of the wiring density required to construct the network. Communication networks of varying dimensions are analyzed under the assumption of constant wire bisection. Expressions for the latency, average case throughput, and hotspot throughput of kary ncube networks with constant bisection that agree closely with experimental measurements are derived. It is shown that lowdimensional networks (e.g. tori) have lower latency and higher hotspot throughput than highdimensional networks (e.g. binary ncubes) with the same bisection width.
[1] Ametek Corporation, Ametek 2010 product announcement, 1987.
[2] K. E. Batcher, "Sorting networks and their applications," inProc. AFIPS FJCC, vol. 32, 1968, pp. 307314.
[3] K. E. Batcher, "The Flip network in STARAN," inProc. 1976 Int. Conf. Parallel Processing, pp. 6571.
[4] V. E. Benes,Mathematical Theory of Connecting Networks and Telephone Traffic. New York: Academic, 1965.
[5] L. N. Bhuyan and D. P. Agrawal, "Generalized hypercube and hyperbus structures for a computer network,"IEEE Trans. Comput., vol. C33, no. 4, pp. 323333, Apr. 1984.
[6] S. Browning, "The tree machine: A highly concurrent computing environment," Dep. Comput. Sci., California Instit. Technol., Rep. 3760, 1980.
[7] W. J. Dally,A VLSI Architecture for Concurrent Data Structures. Boston, MA: Kluwer Academic, 1987, pp. 144161.
[8] W.J. Dally and C.L. Seitz, "DeadlockFree Message Routing in Multiprocessor Interconnection Networks,"IEEE Trans. Computers, Vol. C36, No. 5, May 1987, pp. 547553.
[9] W. J. Dally and C. L. Seitz, "The torus routing chip,"J. Distributed Syst., vol. 1, no. 3, pp. 187196, 1986.
[10] W. J. Dally, "Wire efficient VLSI multiprocessor communication networks," inProc. Stanford Conf. Advanced Res. VLSI, Losleben, Ed. Cambridge, MA: MIT Press, Mar. 1987, pp. 391415.
[11] W. J. Dally, L. Chao, and A. Chien et al., "Architecture of a messagedriven processor," inProc. 14th Annu. Symp. Comput. Architecture, ACM, June 1987, pp. 189196.
[12] W. J. Dally and P. Song, "Design of a selftimed VLSI multicomputer communicationcontroller," inProc. IEEE Int. Conf. Comput. Design, 1987.
[13] P. Kermani and L. Kleinrock, "Virtual cutthrough: A new computer communication switching technique,"Comput. Networks, vol. 3, pp. 267286, 1979.
[14] D. H. Lawrie, "Alignment and access of data in an array processor,"IEEE Trans. Comput., vol. C24, no. 12, pp. 11451155, Dec. 1975.
[15] C. E. Leiserson, "Fattrees: Universal networks for hardwareefficient supercomputing,"IEEE Trans. Comput., vol. C34, pp. 892900, Oct. 1985.
[16] C. Mead and L. Conway,Introduction to VLSI Systems. Reading, MA: AddisonWesley, 1980, pp. 150152.
[17] M. C. Pease, III, "The indirect binaryncube microprocessor array,"IEEE Trans. Comput., vol. C26, no. 5, pp. 458473, May 1977.
[18] G. F. Pfister and V. A. Norton, "Hot spot contention and combining in multistage interconnection networks,"IEEE Trans. Comput., vol. C34, no. 10, pp. 943948, Oct. 1985.
[19] C. L. Seitz, "Concurrent VLSI architectures,"IEEE Trans. Comput., vol. C33, no. 12, pp. 12471265, Dec. 1984.
[20] C. L. Seitzet al., "The hypercube communications chip," Dep. Comput. Sci., California Inst. Technol., Display File 5182:DF:85, Mar. 1985.
[21] C. H. Sequin, "Single chip computers, The new VLSI building block," inProc. Caltech Conf. VLSI, C. L. Seitz, Ed., Jan. 1979, pp. 435452.
[22] H. J. Siegel, "Interconnection network for SIMD machines,"IEEE Comput. Mag., vol. 12, no. 6, pp. 5765, June 1979.
[23] H. S. Stone, "Parallel processing with the perfect shuffle,"IEEE Trans. Comput., vol. C20, no. 2, pp. 153161, Feb. 1971.
[24] H. Sulivan and T. R. Bashkov, "A large scale homogeneous, fully distributed parallel machine, I," inProc. 4th Symp. Comput. Arch., March 1977, pp. 105117.
[25] A. S. Tanenbaum,Computer Networks, Englewood Cliffs, NJ: PrenticeHall, 1981.
[26] C. D. Thompson, "A complexity theory of VLSI,"Dep. Comput. Sci., CarnegieMellon Univ., Tech. Rep. CMUCS80140, Aug. 1980.