Hamiltonian-connectedness of the pyramid network with one faulty node

Proceedings of the IASTED International Multi-Conference on Applied Informatics

Volumn , Issue , 2005, Pages 147-152

  Chen, Yi Ching ^a   Duh, Dyi Rong ^a   Wu, Ruei Yu ^b  

^a NATIONAL CHI NAN UNIVERSITY   (Taiwan)

^b HWA HSIA INSTITUTE OF TECHNOLOGY   (Taiwan)

Author keywords

Fault tolerance; Hamiltonian connectedness; Interconnection networks; Pyramid networks

Indexed keywords

COMPUTER SYSTEM RECOVERY; DISTRIBUTED COMPUTER SYSTEMS; FAULT TOLERANT COMPUTER SYSTEMS; HAMILTONIANS; INTERCONNECTION NETWORKS;

FAULTY NODES; HAMILTONIAN-CONNECTEDNESS; PYRAMID NETWORKS;

COMPUTER NETWORKS;

EID: 27944485696     PISSN: 10272666     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (26)

1. C.C. Aggarwal, N. Jain and P. Gupta, An efficient selection algorithm on the pyramid, Information Processing Letters, 53, 1995, 37-37.
2. D.R. Avresky, Embedding and reconfiguration of spanning trees in faulty hypercubes, IEEE Transactions on Parallel and Distributed Systems, 70(3), 1999, 211-222.
3. R. Balakrishnan and K. Ranganathan, A Textbook of Graph Theory (Springer, 1999).
4. S. Brandt, 9-connected claw-free graphs are hamiltonian-connected, Journal of Combinatorial Theory, B75, 1999, 167-173.
5. F. Cao, D.Z. Du, D.F. Hsu, and S.H. Teng. Fault tolerance properties of pyramid networks, IEEE Transactions on Computers, 48(1), 1999, 88-93.
6. Y.W. Chen and K.L. Chung, A Parallel approach for embedding large pyramids into smaller hypercubes with load balancing, Journal of Information Science and Engineering, 16, 2000, 117-126.
7. L. Cinque and G. Bongiovanni, Parallel prefix computation on a pyramid computer, Pattern Recognition Letter, 16, 1995, 19-22.
8. R. Cipher and H.L.G. Sanz, SIMD architectures and algorithms for image processing and computer vision, IEEE Transactions on Acoustic, Speech, and Signal processing, 37, 1989, 2158-2174.
9. Z. Quo and R.G. Melhem, Embedding binary X-trees and pyramids in processor array with spanning buses, IEEE Transaction on Parallel and Distributed System, 5(6), 1994, 664-672.
10. S.Y. Hsieh, G.H. Chen, and C.W. Ho, Longest fault-free paths in star graphs with vertex faults, Theoretical Computer Science, 262(1-2), 2001, 215-227.
11. S.Y. Hsieh, C.W. Ho, and G.H. Chen, Longest fault-free paths in star graphs with edge faults, IEEE Transactions on Computers, 50(9), 2001, 960-971.
12. J.F. Jenq and S. Sahni, Image Shrinking and Expanding on a Pyramid, IEEE Transactions on Parallel and Distributed System, 4(11), 1993, 1291-1296.
13. T.E. Lindquester, The effects of distance and neighborhood union conditions on Hamiltonian properties in graph, Journal of Graph Theory, 13(3), 1989, 335-352.
14. R.S. Lo and G.H. Chen, Embedding longest fault-free paths in arrangement graphs with faulty vertices, Networks, 37(2), 2001, 84-93.
15. C.K.Y. Ng, L.K.L. Pun, D.M.C. Ip, M. Hamdi, and I. Ahmad, Embedding pyramids into 3D meshes, Journal of Parallel and Distributed Computing, 36, 1996, 173-184.
16. J. Ore, Hamiltonian paths in oriented graphs, Journal of Combinatorial Theory, 21B, 1976, 76-80.
17. M.J. Quinn, Design Efficient Algorithms for parallel Computers (New York, McGraw-Hill, 1987).
18. H. Sarbazi-Azad, M. Ould-Khaoua and L.M. Mackenzie, Algorithmic construction of hamiltonians in pyramids, Information Processing Letters, 80, 2001, 75-79.
19. H. Senoussi and A. Saoudi, A quadtree algorithm for template matching on a pyramid computer, Theoretical Computer Science, 136, 1994, 387-417.
20. G. Steiner, On the k-path partition of graphs, Theoretical Computer Science, 290, 2003, 2147-2155.
21. Q.F. Stout, Mapping vision algorithms to parallel architectures, Proceedings of The IEEE, 76(8), 1988, 982-995.
22. D.B. West, Introduction to Graph Theory, Second Edition, (Prentice-Hall, 2001).
23. P.K. Wong, Optimal path cover problem on block graphs, Theoretical Computer Science, 225, 1999, 163-169.
24. R. Y. Wu, Hamiltonicity of pyramid networks, Master Thesis (Department of Computer Science and Information Engineering, National Chi Nan University, Taiwan, 2001).
25. J. Xu, Topological Structure and Analysis of Interconnection Networks (Kluwer Academic, 2001).
26. J.H. Yan, G.J. Chang, S.M. Hedetniemi, and S.T. Hedetniemi, k-Path partitions in trees, Discrete Applied Mathematics, 78, 1997, 227-233.