The triangular pyramid: Routing and topological properties

Information Sciences

Volumn 180, Issue 11, 2010, Pages 2328-2339

  Razavi, S ^a   Sarbazi Azad, H ^b  

^a INSTITUTE FOR RESEARCH IN FUNDAMENTAL SCIENCES IPM   (Iran)

^b SHARIF UNIVERSITY OF TECHNOLOGY   (Iran)

Author keywords

Cycle embedding; Hamiltonian properties; Interconnection network; Pyramid; Routing; Triangular mesh; Triangular pyramid

Indexed keywords

CYCLE EMBEDDING; MULTICOMPUTERS; NETWORK BANDWIDTH; NETWORK-BASED; PANCYCLIC; PYRAMID NETWORK; TOPOLOGICAL PROPERTIES; TRIANGULAR MESHES;

HAMILTONIANS; INTERCONNECTION NETWORKS; MESH GENERATION; TOPOLOGY;

MESH NETWORKING;

EID: 77649342449     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2010.02.016     Document Type: Article

References (32)

1. Bertsekas D.P., and Tsitsiklis J.N. Parallel and Distributed Computation: Numerical Methods (1997), Prentice-Hall, New York
2. Cao F., and Hsu D.F. Fault-tolerance properties of pyramid networks. IEEE Transactions on Computers 48 (1999) 88-93
3. Chen X.-B. Many-to-many disjoint paths in faulty hypercubes. Information Sciences 179 (2009) 3110-3115
4. Culler D.E., Singh J.P., and Gupta A. Parallel Computer Architecture: A Hardware/Software Approach (1999), Morgan Kaufmann, San Francisco, CA
5. H. Dingle, H. Sudborough, Simulation of binary trees and x-trees on pyramid networks, in: Proc. IEEE Symp. Parallel and Distributed Processing, May 1992, pp. 220-229.
6. Dong Q., Yang X., Zhao J., and Tang Y.Y. Embedding a family of disjoint 3D meshes into a crossed cube. Information Sciences 178 (2008) 2396-2405
7. Duato J., Yalamanchili S., and Ni L. Interconnection Networks (2003), Morgan Kaufmann publishers
8. Fang J.-F. The bipancycle-connectivity of the hypercube. Information Sciences 178 (2008) 4679-4687
9. Fu J.-S. Hamiltonian connectivity of the WK-recursive network with faulty nodes. Information Sciences 178 (2008) 2573-2584
10. Ghose K., and Desai K.R. Hierarchical cubic networks. IEEE Transactions on Parallel and Distributed Systems 6 (1995) 427-435
11. M. Hoseiny Farahabady, H. Sarbazi-Azad, The recursive transpose-connected cycles (RTCC) interconnection network for multiprocessors, in: ACM SAC'05, Santa Fe, New Mexico, USA, March 2005.
12. Hoseiny-Farahabadi M., Imani N., and Sarbazi-Azad H. Some topological and combinatorial properties of WK-recursive mesh and WK-pyramid interconnection networks. Journal of Systems Architecture 54 (2008) 967-976
13. Hwang K., and Ghosh J. Hyper net: a communication efficient architecture for constructing massively parallel computers. IEEE Transactions on Computers 36 12 (1987) 1450-1466
14. Imani N., Sarbazi-Azad H., Zomaya A., and Moinzadeh P. Detecting threats in star graphs. IEEE Transactions on Parallel and Distributed Systems 20 (2009) 474-483
15. Imani N., Sarbazi-Azad H., and Akl S.G. Some topological properties of star graphs: the surface area and volume. Discrete Mathematics 309 (2009) 560-569
16. Imani N., Sarbazi-Azad H., and Akl S.G. Perfect load balancing on the star interconnection network. The Journal of Supercomputing 41 (2007) 269-286
17. Kueng T.-L., Liang T., Hsu L.-H., and Tan J.J.M. Long paths in hypercubes with conditional node-faults. Information Sciences 179 (2009) 667-681
18. Kwai D.-M., and Parhami B. Pruned three-dimensional toroidal networks. Information Processing Letters 68 (1998) 179-183
19. Lai P.L., and Hsu H.-C. Constructing the nearly shortest path in crossed cubes. Information Sciences 179 (2009) 2487-2493
20. Latifi S., Saberinia E., and Wu X. Robustness of star graph network under link failure. Information Sciences 178 (2008) 802-806
21. Lin T.-C., and Duh D.-R. Constructing vertex-disjoint paths in (n, k)-star graphs. Information Sciences 178 (2008) 788-801
22. Miller R., and Stout Q. Data movement techniques for the pyramid computer. SIAM Journal of Computing 16 (1987) 38-60
23. Y Ng C.K. Embedding pyramids into 3D meshes. Journal of Parallel and Distributed Computing 36 (1996) 173-184
24. Parhami B. Introduction to Parallel Processing: Algorithms and Architectures (1999), Plenum, New York
25. Sarbazi-Azad H., Ould-Khaoua M., and Mackenzie L. Algorithmic construction of Hamiltonians in pyramid networks. Information Processing Letters 80 (2001) 75-79
26. Shareghi P., and Sarbazi-Azad H. The stretched network: properties, routing, and performance. Journal of Information Science and Engineering 24 (2008) 361-378
27. G.D. Vecchia, C. Sanges, Recursively scalable networks for message passing architectures, in: Proc. Conf. Parallel Processing and Applications, 1987, pp. 33-40.
28. Wang H.-L., Wang J.-W., and Xu J.-M. Edge-fault-tolerant bipanconnectivity of hypercubes. Information Sciences 179 (2009) 404-409
29. Wu R.-Y., Chen G.-H., Kuo Y.-L., and Chang G.J. Node-disjoint paths in hierarchical hypercube networks. Information Sciences 177 (2007) 4200-4207
30. Wu X., and Latifi S. Substar reliability analysis in star networks. Information Sciences 178 (2008) 2337-2348
31. Zhu Q., Xu J., Hou X., and Xu M. On reliability of the folded hypercubes. Information Sciences 177 (2007) 1782-1788
32. Zhu Q., Liu S.-Y., and Xu M. On conditional diagnosability of the folded hypercubes. Information Sciences 178 (2008) 1069-1077