Efficient broadcasting in an arrangement graph using multiple spanning trees

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E83-A, Issue 1, 2000, Pages 139-149

  Chen, Yuh Shyan ^a,b   Juang, Tong Ying ^a   Tseng, En Huai ^a  

^a CHUNG HUA UNIVERSITY   (Taiwan)

^b NATIONAL CHUNG HSING UNIVERSITY   (Taiwan)

Author keywords

Arrangement graph; Broadcast, interconnection network; Parallel processing; Routing

Indexed keywords

ALGORITHMS; BROADCASTING; PACKET SWITCHING; PARALLEL PROCESSING SYSTEMS; TREES (MATHEMATICS);

ARRANGEMENT GRAPH; MULTIPLE SPANNING TREES;

INTERCONNECTION NETWORKS;

EID: 0033903615     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (13)

1. S.B. Akers, D. Hard, and B. Krishnameurthy.The star graph: An attractive alternative to the n-cube," Proc. ICPP '87, pp.393-400, Aug. 1987.
2. L.Q. Bai, II. Ebara, II. Nakano, and H. Maeda.Faulttolerant broadcasting on the arrangement graph," The Computer Journal, vol.41, no.3, pp.171-184, 1998.
3. Y.-S. Chen and J.-P. Sheu.A fault-tolerant reconfiguration scheme in the faulty star graph," Journal of Information Science and Engineering, vol.16, no.1, Jan. 2000.
4. K. Day and A. Tripathi.Characterization of node disjoint path in arrangement graphs," Technical Report TR91-43, Computer Science Department, University of Minnesota, 1991.
5. K. Day and A. Tripathi.Arrangement grapha: A class of generalized star graphs," Information Processing Letter, vol.42, no.5, pp.235-241, 1992.
6. K. Day and A. Tripathi.Embedding of cycles in arangement graphs," IEEE Trans. Comput., vol.12, no.8, pp.1002-1006, 1992.
7. K. Day and A. Tripathi.Embedding grids, hypercube, and trees in arrangement graphs," Proc. International Conference on Parallel Processing, vol.Ill, pp.C5-72, 1993.
8. S.-Y. Hsieh, G.-H. Chen, and C.-W. Ho.Fault-free Hamiltonian cycles in faulty arrangement graph," IEEE Trans. Parallel and Distributed Systems, vol.10, no.3, pp.223-237, March 1999.
9. J.-P. Sheu, C.-T. Wu, and T.-S. Chen.An optimal broadcasting algorithm without message redundancy in star graphs," IEEE Trans. Parallel and Distributed Systems, vol.6, no.6, pp.053-658, 1995.
10. S.-S. Tsai and S.-J. Horng.Efficient embedding hypercube on arrangement graphs," Journal of Information Science and Engineering, vol.12, no.3, pp.585-592, Dec. 1996.
11. Y.-C. Tseng, S.-H. Chang, and J.-P. Sheu.Fault-tolerant ring embedding in star graphs," IEEE Trans. Parallel and Distributed Systems, vol.8, no.12, pp.1185-1195, Dec. 1999.
12. Y.-C. Tseng, Y.-S. Chen, T.-Y. Juang, and C.-J. Chang.Congestion-free, dilation-2 embedding of complete binary tree in star graphs," Networks, vol.33, no.3, pp.221-231, May 1999.
13. Y.-C. Tseng and J.-P. Sheu.Toward optimal broadcast in a star graph using multiple spanning trees," IEEE Trans. Comput., vol.46, no.5, pp.593-599, 1997.