Folded petersen cube networks: New competitors for the hypercubes

IEEE Transactions on Parallel and Distributed Systems

Volumn 7, Issue 2, 1996, Pages 151-168

  Öhring, Sabine ^a,b   Das, Sajal K ^a,b  

^a IEEE

^b Center for Advanced Research and Technology   (United States)

Author keywords

Average distance; Broadcasting; Embedding; Fault tolerance; Folded Petersen graph; Hypercube; Interconnection network; Mesh; Pyramid; Routing; Tree

Indexed keywords

ALGORITHMS; BROADCASTING; COMPUTER ARCHITECTURE; DATA COMMUNICATION SYSTEMS; DATA STRUCTURES; ELECTRIC NETWORK TOPOLOGY; FAILURE ANALYSIS; GRAPHIC METHODS; ITERATIVE METHODS; TELECOMMUNICATION TRAFFIC;

AVERAGE DISTANCE; EMBEDDING; FAULT TOLERANCE; FOLDED PETERSEN CUBE NETWORKS; HYPERCUBES; OPTICAL CONNECTIVITY; SCALABILITY;

INTERCONNECTION NETWORKS;

EID: 0030085791     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.485505     Document Type: Article

References (31)

1. S.B. Akers, D. Harel, and B. Krishnamurthy, "The star graph: An attractive alternative to the n-cube," Proc. 1987 Int'l Conf. Parallel Processing, pp. 393-400, 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. 323-333, 1984.
3. G. Chartrand and R.J. Wilson, "The Petersen graph," Graphs and Applications, F. Harary and J.S. Maybee, eds., pp. 69-100, 1985.
4. C.J. Colbourn, The Combinatorics of Network Reliability, New York: Oxford Univ. Press, 1987.
5. S.K. Das, S. Öhring, and A.K. Banerjee, "Embeddings into hyper Petersen networks: Yet another hypercube-like interconnection topology," J. VLSI Design, special issue on interconnection networks, vol. 2, no. 4, pp. 335-351, 1995.
6. Also: Proc. Fourth Symp. Frontiers of Massively Parallel Computation (Frontiers '92), pp. 270-277, McLean, Vir., Oct. 1992.
7. K. Efe, "Embedding mesh of trees in the hypercube," J. Parallel and Distributed Computing, vol. 11, pp. 222-230, 1991.
8. A. El-Amawy and S. Latifi, "Properties and performance of folded hypercubes," IEEE Trans. Parallel and Distributed Systems, vol. 2, no. 1, pp. 31-42, Jan. 1991.
9. T. El-Ghazawi and A. Youssef, "A unified approach to fault-tolerant routing," Proc. 1992 Int'l Conf. Distributed Computing Systems, Japan, pp. 210-217, June 1992.
10. E. Ganesan and D.K. Pradhan, "The hyper-de Bruijn networks: Scalable versatile architecture," IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 9, pp. 962-978, Sept. 1993.
11. S.L. Johnsson and C.-T. Ho, "Optimum broadcasting and personalized communication in hypercubes," IEEE Trans. Computers, vol. 38, no. 9, pp. 1,249-1,268, Sept. 1989.
12. H.P. Katseff, "Incomplete hypercubes," IEEE Trans. Computers, vol. 37, no. 5, pp. 604-608, May 1988.
13. M.S. Krishnamoorty and B. Krishnamoorty, "Fault diameter of interconnection networks," Computers and Mathematics with Applications, vol. 13, no. 5-6, pp. 577-582, 1987.
14. F.T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays-Trees-Hypercubes. San Mateo, Calif.: Morgan Kaufmann, 1992.
15. F.J. Meyer and D.K. Pradhan, "Flip-trees: Fault-tolerant graphs with wide containers," IEEE Trans. Computers, vol. 37, no. 4, Apr. 1988.
16. B. Monien and H. Sudborough, "Embedding one interconnection network in another," Computational Graph Theory, pp. 257-282. Wien: Springer-Verlag, 1990.
17. S. Öhring, "Mapping data and algorithm structures on selected efficient multiprocessor networks," PhD thesis, Univ. of Würzburg, Germany, Feb. 1994.
18. S. Öhring and S.K. Das, "Dynamic embeddings of trees and quasi-grids into hyper-de Bruijn networks," Proc. Seventh Int't Parallel Processing Symp., pp. 519-523, Newport Beach, Calif., Apr. 1993.
19. 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. 582-589, Dec. 1993.
20. 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. 147-156, Dec. 1993.
21. S. Öhring and S.K. Das, "Efficient communication on the folded Petersen interconnection networks," Proc. Parallel Architecutres and Languages Europe 1994, Athens, Lecture Notes in Computer Science, pp. 689-700, Springer-Verlag, July 1994.
22. 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. 188-195, Oct. 1994.
23. S. Öhring, D.H. Hohndel, and S.K. Das, "Fault tolerant communication algorithms on the folded Petersen networks based on arc-disjoint spanning trees," Proc. 1994 Conpar 94/VAPP VI, Lecture Notes in Computer Science, vol. 854, pp. 749-760, Springer-Verlag, Sept. 1994.
24. 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. 581-586, Las Vegas, Oct. 1994.
25. S. Öhring, J. Sibeyn, and O. Sykora, "Optimal VLSI-layout for the efficient Petersen based interconnection network family," Proc. Sixth Int'l Conf. Parallel and Distributed Computing and Systems (PDCS'94), pp. 121-124, Washington, D.C., Oct. 1994.
26. S.R. Öhring, M. Ibel, S.K. Das, and M.J. Kumar, "On generalized fat trees," Proc. Ninth Int'l Parallel Processing Symp., pp. 37-44, Santa Barbara, Calif., Apr. 1995.
27. F.P. Preparata and J. Vuillemin, "The cube-connected cycles: A versatile network for parallel computation," Comm. ACM, vol. 24, no. 5, pp. 300-309, May 1981.
28. A.L. Rosenberg, "Product-shuffle networks: Towards reconciling shuffles and butterflies," Discrete Applied Mathematics, vol. 37/38, pp. 465-488, July 1992.
29. Y. Saad and M.H. Schulta, "Topological properties of hypercubes," IEEE Trans. Computers, vol. 37, no. 7, pp. 867-872, July 1988.
30. 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. 567-581, Apr. 1989.
31. A.S. Wagner, "Embedding all binary trees in the hypercube," Proc. Third IEEE Symp. Parallel and Distributed Processing, pp. 104-111, Dallas, Dec. 1991.