
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Sabine Öhring, Sajal K. Das, "Folded Petersen Cube Networks: New Competitors for the Hypercubes," IEEE Transactions on Parallel and Distributed Systems, vol. 7, no. 2, pp. 151168, February, 1996.  
BibTex  x  
@article{ 10.1109/71.485505, author = {Sabine Öhring and Sajal K. Das}, title = {Folded Petersen Cube Networks: New Competitors for the Hypercubes}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {7}, number = {2}, issn = {10459219}, year = {1996}, pages = {151168}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.485505}, 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  Folded Petersen Cube Networks: New Competitors for the Hypercubes IS  2 SN  10459219 SP151 EP168 EPD  151168 A1  Sabine Öhring, A1  Sajal K. Das, PY  1996 KW  Average distance KW  broadcasting KW  embedding KW  faulttolerance KW  folded Petersen graph KW  hypercube KW  interconnection network KW  mesh KW  pyramid KW  routing KW  tree. VL  7 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—We introduce and analyze a new interconnection topology, called the
Since the number of nodes in
This paper also emphasizes the versatility of the folded Petersen cube networks as a multicomputer interconnection topology by providing embeddings of many computationally important structures such as rings, multidimensional meshes, hypercubes, complete binary trees, tree machines, meshes of trees, and pyramids. The dilation and edgecongestion of all such embeddings are at most two.
[1] S.B. Akers, D. Harel, and B. Krishnamurthy, "The star graph: An attractive alternative to the ncube," Proc. 1987 Int'l Conf. Parallel Processing, pp. 393400, St. Charles, Ill., 1987.
[2] L. Bhuyan and D.P. Agrawal, "Generalized hypercubes and hyperbus structures for a computer network," IEEE Trans. Computers, vol. 33, pp. 323333, 1984.
[3] G. Chartrand and R.J. Wilson, "The Petersen graph," Graphs and Applications, F. Harary and J.S. Maybee, eds., pp. 69100, 1985.
[4] C.J. Colbourn, The Combinatorics of Network Reliability, Oxford Univ. Press, 1987.
[5] S.K. Das, S. Öhring, and A.K. Banerjee, "Embeddings into hyper Petersen networks: Yet another hypercubelike interconnection topology," J. VLSI Design, special issue on interconnection networks, vol. 2, no. 4, pp. 335351, 1995. Also: Proc. Fourth Symp. Frontiers of Massively Parallel Computation (Frontiers '92), pp. 270277,McLean, Vir., Oct. 1992.
[6] K. Efe,“Embedding mesh of trees in the hypercube,” J. Parallel and Distributed Computing, vol. 11, no. 3, pp. 222230, Mar. 1991.
[7] A. ElAmawy and S. Latifi, "Properties and Performance of Folded Hypercubes," IEEE Trans. Parallel and Distributed Systems, vol. 2, no. 1, pp. 3142, 1991.
[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] 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.
[10] S.L. Johnsson and C.T. Ho,“Spanning graphs for optimum broadcasting and personalizedcommunication in hypercubes,” IEEE Trans. Computers, vol. 38, no. 9, pp. 1,2491,268, Sept. 1989.
[11] H.P. Katseff, "Incomplete Hypercubes," IEEE Trans. Computers, vol. 37, no. 5, pp. 604608, May 1988.
[12] M.S. Krishnamoorty and B. Krishnamoorty, "Fault diameter of interconnection networks," Computers and Mathematics with Applications, vol. 13, no. 56, pp. 577582, 1987.
[13] F.T. Leighton,Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes.San Mateo, Calif.: Morgan Kaufmann, 1992.
[14] F.J. Meyer and D.K. Pradhan, "Fliptrees: Fault tolerant graphs with wide containers," IEEE Trans. Computers, vol. 37, no. 4, pp. 472478, Apr. 1988.
[15] B. Monien and H. Sudborough, "Embedding one interconnection network in another," Computational Graph Theory, pp. 257282.Wien: SpringerVerlag, 1990.
[16] S. Öhring, "Mapping data and algorithm structures on selected efficient multiprocessor networks," PhD thesis, Univ. of Würzburg, Germany, Feb. 1994.
[17] S. Öhring and S.K. Das, "Dynamic embeddings of trees and quasigrids into hyperde Bruijn networks," Proc. Seventh Int'l Parallel Processing Symp., pp. 519523,Newport Beach, Calif., Apr. 1993.
[18] S. Öhring and S.K. Das, "The folded Petersen cube networks: New competitors for the hypercube," Proc. Fifth IEEE Symp. Parallel and Distributed Processing, pp. 582589, Dec. 1993.
[19] S. Öhring and S.K. Das, "Mapping dynamic data and algorithm structures into product networks," Proc. Fourth Int'l Symp. Algorithms and Computation (ISAAC '93),Hong Kong, Lecture Notes in Computer Science, vol. 762, pp. 147156, Dec. 1993.
[20] S.R. Öhring and S.K. Das, “Efficient Communication in the Folded Petersen Interconnection Networks,” Proc. Sixth Int'l Parallel Architectures and Languages Europe Conf., pp. 2536, 1994.
[21] S. Öhring and D.H. Hohndel, "Optimal fault tolerant communication algorithms on product networks using spanning trees," Proc. Sixth IEEE Symp. Parallel and Distributed Processing, pp. 188195, Oct. 1994.
[22] S. Öhring, D.H. Hohndel, and S.K. Das, "Fault tolerant communication algorithms on the folded Petersen networks based on arcdisjoint spanning trees," Proc. 1994 Conpar 94/VAPP VI, Lecture Notes in Computer Science, vol. 854, pp. 749760, SpringerVerlag, Sept. 1994.
[23] S. Öhring, D.H. Hohndel, and S.K. Das, "Scalable interconnection networks based on the Petersen graph," Proc. Seventh Int'l Conf. Parallel and Distributed Computing Systems (PDCS '94), pp. 581586,Las Vegas, Oct. 1994.
[24] S. Öhring, J. Sibeyn, and O. Sykora, "Optimal VLSIlayout for the efficient Petersen based interconnection network family," Proc. Sixth Int'l Conf. Parallel and Distributed Computing and Systems (PDCS'94), pp. 121124,Washington, D.C., Oct. 1994.
[25] S.R. Öhring, M. Ibel, S.K. Das, and M.J. Kumar, "On generalized fat trees," Proc. Ninth Int'l Parallel Processing Symp., pp. 3744,Santa Barbara, Calif., Apr. 1995.
[26] F.P. Preparata and J. Vuillemin, “The CubeConnected Cycles: A Versatile Network for Parallel Computation,” Comm ACM, vol. 24, no. 5, pp. 300309, 1981.
[27] A.L. Rosenberg,“Productshuffle networks: Toward reconciling shuffles and butterflies,” Discrete Applied Mathematics, vol. 37/38, pp. 465488, July 1992.
[28] Y. Saad and M. Schultz, "Topological Properties of Hypercubes," IEEE Trans. Computers, vol. 37, no. 7, pp. 867872, July 1988.
[29] M.R. Samatham and D.K. Pradhan, "The de Bruijn Multiprocessor Network: A Versatile Parallel Processing and Sorting Network for VLSI," IEEE Trans. Computers, vol. 38, no. 4, pp. 567581, Apr. 1989.
[30] A.S. Wagner, "Embedding all binary trees in the hypercube," Proc. Third IEEE Symp. Parallel and Distributed Processing, pp. 104111,Dallas, Dec. 1991.