Congestion-free embedding of 2(n-k) spanning trees in an arrangement graph

Journal of Systems Architecture

Volumn 47, Issue 1, 2001, Pages 73-86

  Chen, Yuh Shyan ^a   Juang, Tong Ying ^a   Shen, Ying Ying ^b  

^a NATIONAL TAIPEI UNIVERSITY   (Taiwan)

^b Optoma Corporation   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

CONGESTION CONTROL (COMMUNICATION); EMBEDDED SYSTEMS; INTERCONNECTION NETWORKS; TELECOMMUNICATION TRAFFIC; TREES (MATHEMATICS);

CONGESTION-FREE SPANNING TREES;

PARALLEL PROCESSING SYSTEMS;

EID: 0035200643     PISSN: 13837621     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1383-7621(00)00041-2     Document Type: Article

References (14)

1. S.B. Akers, D. Harel, B. Krishnameurthy, The star graph: an attractive alternative to the n-cube, in: Proceedings of the International Conference on Parallel Processing, 1987, pp. 393-400.
2. Bai L.Q., Ebara H., Nakano H., Maeda H. Fault-tolerant broadcasting on the arrangement graph. Comput J. 41(3):1998;171-184.
3. Chen Y.-S., Juang T.-J., Tseng E.-H. Efficient broadcast in an arrangement graph using multiple spanning trees. IEICE Trans Fundamentals Elect Commun Comput Sci. E83-A(1):2000;139-149.
4. Chen Y.-S., Sheu J.-P. A fault-tolerant reconfiguration scheme in the faulty star graph. J Inform Sci Eng. 16(1):2000;25-40.
5. K. Day, A. Tripathi, Characterization of node disjoint path in arrangement graphs, in: Technical Report TR91-43, Computer Science Department, University of Minnesota, 1991.
6. Day K., Tripathi A. Arrangement grapha: a class of generalized star graphs. Inform Process Lett. 42(5):1992;235-241.
7. Day K., Tripathi A. Embedding cycles in arrangement graphs. IEEE Trans Comput. 12(8):1992;1002-1006.
8. K. Day, A. Tripathi, Embedding grids, hypercube, and trees in arrangement graphs, in: Proceedings of the International Conference on Parallel Processing, 1999, pp. 3-65-3-72.
9. Hsieh S.-Y., Chen G.-H., Ho C.-W. Fault-free hamiltonian cycles in faulty arrangement graphs. IEEE Trans Parallel Distributed Sys. 10(3):1999;223-237.
10. Sheu J.-P., Wu C.-T., Chen T.-S. An optimal broadcasting algorithm without message redundancy in star graphs. IEEE Trans Parallel Distributed Sys. 6(6):1995;653-658.
11. Tsai S.-S., Horng S.-J. Efficient embedding hypercube on arrangement graphs. J Inform Sci Eng. 12(4):1996;585-592.
12. Tseng Y.-C., Chang S.-H., Sheu J.-P. Fault-tolerant ring embedding in star graphs. IEEE Trans Parallel Distributed Sys. 8(12):1997;1185-1195.
13. Tseng Y.-C., Chen Y.-S., Juang T.-Y., Chang C.-J. Congestion-free, dilation-2 embeding of complete binary tree in star graphs. Networks. 33(3):1999;221-231.
14. Tseng Y.-C., Sheu J.-P. Toward optimal broadcast in a star graph using multiple spanning trees. IEEE Trans Comput. 46(5):1997;593-599.