
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Kemal Efe, Antonio Fernández, "Products of Networks with Logarithmic Diameter and Fixed Degree," IEEE Transactions on Parallel and Distributed Systems, vol. 6, no. 9, pp. 963975, September, 1995.  
BibTex  x  
@article{ 10.1109/71.466633, author = {Kemal Efe and Antonio Fernández}, title = {Products of Networks with Logarithmic Diameter and Fixed Degree}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {6}, number = {9}, issn = {10459219}, year = {1995}, pages = {963975}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.466633}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Products of Networks with Logarithmic Diameter and Fixed Degree IS  9 SN  10459219 SP963 EP975 EPD  963975 A1  Kemal Efe, A1  Antonio Fernández, PY  1995 KW  Product networks KW  interconnection networks KW  parallel architectures KW  multiprocessors KW  graph embedding KW  application specific array processors KW  emulation KW  embedded architectures. VL  6 JA  IEEE Transactions on Parallel and Distributed Systems ER   
[1] M. Baumslag and F. Annextein,“A unified framework for offline permutation routing in product petworks,” Math. Systems Theory, vol. 24, no. 4, pp. 233251, 1991.
[2] S. Bhatt,F. Chung,J.W. Hong,T. Leighton,, and A. Rosenberg,“Optimal simulations by butterfly networks,” Proc. 20th Ann. ACM Symp. Theory of Computing, pp. 192204, May 1988.
[3] L.N. Bhuyan and D.P. Agrawal,“Generalized hypercube and hyperbus structures for a computer network,” IEEE Trans. Computers, vol. 33, no. 4, pp. 323333, Apr. 1984.
[4] M.Y. Chan,“Embedding of grids into optimal hypercubes,” SIAM J. Computing, vol. 20, pp. 834864, Oct. 1991.
[5] K. Efe,“Embedding mesh of trees in the hypercube,” J. Parallel and Distributed Computing, vol. 11, no. 3, pp. 222230, Mar. 1991.
[6] K. Efe, “The Crossed Cube Architecture for Parallel Computing,” IEEE Trans. Parallel and Distributed Systems, vol. 3, no. 5, pp. 513524, Sept.Oct. 1992.
[7] K. Efe,“Embedding large mesh of trees and related networks on smaller hypercubes with load balancing,” Proc. Int’l Conf. Parallel Processing, vol. 3, pp. 311315, 1993.
[8] T. ElGhazawi and A. Youssef,“A unified approach to fault tolerant routing,” Proc. 12th Int’l Conf. Distributed Computing Systems, pp. 210217,Yokohama, Japan, June 1992.
[9] R. Feldmann and P. Mysliwietz,“The shuffle exchange network has a Hamiltonian path,” Proc. Mathematical Foundations of Computer Science, pp. 246254, 1992.
[10] A. Fernandez and K. Efe,“Efficient VLSI layouts for homogeneous product networks,” Technical Report 9484, Center for Advanced Computer Studies, Univ. ofSouthwestern Louisiana (submitted for publication).
[11] J.P. Fishburn and R.A. Finkel,“Quotient networks,” IEEE Trans. Computers, vol. 31 no. 4, pp. 288295, Apr. 1982.
[12] E. Ganesan and D.K. Pradhan,“The hyperde Bruijn multiprocessor networks: Scalable versatile architecture,” IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 9, pp. 962978, Sept. 1993.
[13] I. Havel and P. Kiebl,“Embedding the polytomic tree into the ncube,” Casopis pro Pestovan i Matematiky, vol. 98, pp. 307314, 1973.
[14] M. Imase,T. Soneko,, and K. Okada,“Connectivity of regular directed graphs with small diameters,” IEEE Trans. Computers, vol. 34, no. 3, pp. 267273, Mar. 1985.
[15] R. Koch,T. Leighton,B. Maggs,S. Rao,, and A. L. Rosenberg,“Workpreserving emulations for fixedconnection networks,” Proc. 21st Ann. ACM Symp. Theory of Computing, pp. 227240,Seattle, May 1989.
[16] F.T. Leighton,Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes.San Mateo, Calif.: Morgan Kaufmann, 1992.
[17] A.L. Rosenberg,“Productshuffle networks: Toward reconciling shuffles and butterflies,” Discrete Applied Mathematics, vol. 37/38, pp. 465488, July 1992.
[18] M. Yoeli,“Binary ring sequences,” American Math. Monthly, vol. 69, pp. 852855, 1962.
[19] C.D. Thompson,“A complexity theory for VLSI,” PhD thesis, CarnegieMellon Univ., Aug. 1980.
[20] A.K. Gupta,A.J. Boals,N.A. Sherwani,, and S.E. Hambrusch,“A lower bound on embedding large hypercubes into small hypercubes,” Congressus Numerantium, vol. 78, pp. 141151, 1990.