On the fault-tolerant embedding of complete binary trees in the pancake graph interconnection network

Information sciences

Volumn 126, Issue 1, 2000, Pages 191-204

  Fang, Wei Chen ^a   Hsu, Chiun Chieh ^a  

^a NATIONAL TAIWAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SYSTEM RECOVERY; CONFORMAL MAPPING; EMBEDDED SYSTEMS; FAULT TOLERANT COMPUTER SYSTEMS; INTERCONNECTION NETWORKS; TOPOLOGY;

COMPLETE BINARY TREE; DILATION; PANCAKE GRAPH;

TREES (MATHEMATICS);

EID: 0034225301     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0255(00)00021-9     Document Type: Article

References (18)

1. Akers S.B., Krishnamurthy B. A group-theoretic model for symmetric interconnection networks. IEEE Trans. Comput. 38(4):1989;555-566.
2. Qiu K., Akl S.G., Meijer H. On some properties and algorithms for the star and pancake interconnection networks. J. Parallel Distrib. Comput. 22:1994;16-25.
3. J.-S. Jwo, Properties of star graph, bubble-sort graph, prefix-reversal graph and complete-transposition graph, J. Inform. Sci. Engrg. 12 (4) 603-617.
4. Akl S.G., Qiu K. Fundamental algorithms for the star and pancake interconnection networks with applications to computational geometry. Networks. 23:1993;215-225.
5. Optimal information dissemination in star and pancake networks, IEEE Trans. Parallel Distrib. Syst. 7 (12) (1996).
6. S.G. Akl, K. Qiu, Data communication and computational geometry on the star and pancake interconnection networks, in: Proceedings of 1991 IEEE Symposium on Parallel and Distributed Processing, 1991, pp. 415-422.
7. Lakshmivarahan S., Jwo J.-S., Dhall S.K. Symmetry in interconnection networks based on Cayley graphs of permutation groups: a survey. Parallel Comput. 19:1993;361-407.
8. S.B. Akers, D. Harel, B. Krishnamurthy, The star graph: an attractive alternative to the n-cube, in: Proceedings of 1987 International Conference on Parallel Processing, pp. 393-400.
9. S.B. Akers, B. Krishnamurthy, The fault tolerance of star graphs, in: Proceedings of the Second International Conference on Supercomputing, vol. 3, 1987, pp. 270-276.
10. A. Kanevsky, C. Feng, On the embedding of cycles in pancake graphs, Parallel Comput. 21 (6) 923-936.
11. C.C. Hsu, All-fault-tolerant embedding of a complete binary tree in a group of Cayley graphs, in: IEE Proceedings: Comput. Digit. Tech. 143 (2) (1996) 156-160.
12. C.C. Hsu, Y.W. Liu, Quick recovery of two embedded complete binary trees in a hypercubes, IEE Proceedings of Computing Digit. Tech. 141 (4) (1994) 205-211.
13. Krishnamoorthy M.S., Krishnamurthy B. Fault diameter of interconnection networks. Comput. Math. Appl. 18(5/6):1987;577-582.
14. Johnsson S.L. Communication efficient basic linear algebra computations on hypercube architectures. J. Parallel Distrib. Comput. 4:1987;132-172.
15. Lee J.I., Chang J.H. Embedding complete binary trees in star graphs. J. Korean Inform. Sci. Soc. 21(2):1994;407-415.
16. Leiss E.L., Reddy H.N. Embedding complete trees into hypercubes. Inform. Process. Lett. 38(5):1991;197-199.
17. S.R. Desphande, R.M. Jenevein, Scalability of a binary tree on a hypercube, in: Proceedings of 1986 International Conference on Parallel Processing, 1986, pp. 661-668.
18. Miller Z., Pritikin D., Sudborough I.H. Near embeddings of hypercubes into Calyley graph graphs on the symmetric group. IEEE Trans. Comput. 43(1):1994;13-22.