Broadcasting on Incomplete WK-Recursive Networks

Journal of Parallel and Distributed Computing

Volumn 57, Issue 3, 1999, Pages 271-294

  Su, Ming Yang ^a   Chen, Gen Huey ^b   Duh, Dyi Rong ^c  

^a HWA HSIA INSTITUTE OF TECHNOLOGY   (Taiwan)

^b NATIONAL TAIWAN UNIVERSITY   (Taiwan)

^c NATIONAL CHI NAN UNIVERSITY   (Taiwan)

Author keywords

Broadcasting algorithms; Graph theoretic interconnection networks; Incomplete WK recursive networks; WK recursive networks

Indexed keywords

EID: 0006092528     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1999.1538     Document Type: Article

References (35)

1. Akers S. B., Krishnamurthy B. A group-theoretic model for symmetry interconnection networks. IEEE Trans. Comput. 38:1989;555-566.
2. Bowen N. S., Nikolaou C. N., Ghafoor A. On the assignment problem of arbitrary process systems to heterogeneous distributed computer systems. IEEE Trans. Comput. 41:1992;257-273.
3. Buckley F., Harary F. Distance in Graph. 1990;Addison-Wesley, Reading.
4. Chen G. H., Duh D. R. Topological properties, communication, and computation on WK-recursive networks. Networks. 24:1994;303-317.
5. Corbett P. Rotator graphs: An efficient topology for point-to-point multiprocessor networks. IEEE Trans. Parallel Distrib. Sytems. 3:1992;622-626.
6. Duh D. R., Chen G. H. Topological properties of WK-recursive networks. J. Parallel Distrib. Comput. 23:1994;468-474.
7. Duh D. R., Chen G. H. On the Rabin number problem. Networks. 30:1997;219-230.
8. R. Fernandes, Recursive interconnection networks for multicomputer networks, Proceedings of the International Conference on Parallel Processing, Vol. I, 1992, 76, 79.
9. R. Fernandes, A. Kanevsky, Hierarchical WK-recursive topologies for multicomputer systems, Proceedings of the International Conference on Parallel Processing, Vol. I, 1993, 315, 318.
10. R. Fernandes, A. Kanevsky, Substructure allocation in recursive interconnection networks, Proceedings of International Conference on Parallel Processing, Vol. I, 1993, 319, 322.
11. R. Fernandes, D. K. Griesen, A. Kanevsky, Efficient routing and broadcasting in recursive interconnection networks, Proceeding of the International Conference on Parallel Processing, 1994, 51, 58.
12. R. Fernandes, D. K. Friesen, A. Kanevsky, Embedding rings in recursive networks, Proceedings of International Symposium on Parallel and Distributed Processing, Oct. 1994, 273, 280.
13. Hwang K., Ghosh J. Hypernet: A communication efficient architecture for constructing massively parallel computers. IEEE Trans. Comput. 36:1987;1450-1466.
14. A. Iazzetta, C. Sanges, U. Scafuri, Special multicast wormhole routing for WK-networks.
15. Irani K. B., Chen K. Minimization of interprocessor communication for parallel computation. IEEE Trans. Comput. C-31:1982;1067-1075.
16. Johnsson S., Ho C. T. Optimal broadcasting and personalized communication in hypercubes. IEEE Trans. Comput. 38:1989;1249-1268.
17. Katseff H. P. Incomplete hypercubes. IEEE Trans. Comput. C-37:1988;604-608.
18. Latifi S., Bagherzadeh N. Incomplete star: An incrementally scalable network based on the star graph. IEEE Trans. Parallel Distrib. Systems. 5:1994;97-102.
19. S. Latifi, N. Bagherzadeh, On clustered-star graph and its properties.
20. Lee D. T., Preparata F. P. Computational geometry - a survey. IEEE Trans. Comput. C-33:1984;1072-1101.
21. Lee S., Shin K. G. Interleaved all-to-all reliable broadcast on meshes and hypercubes. IEEE Trans. Parallel Distrib. Systems. 5:1994;449-458.
22. Mendia V. E., Sarkar D. Optimal broadcasting on the star graph. IEEE Trans. Parallel Distrib. Systems. 3:1992;389-396.
23. S. Ponnuswamy, V. Chaudhary, Embedding of cycles in rotator and incomplete rotator graphs, Proceedings of International Symposium on Parallel and Distributed Processing, Oct. 1994, 603, 610.
24. Preparata F. P., Vuillemin J. The cube-connected cycles: A versatile network for parallel computation. Comm. ACM. 24:1981;300-309.
25. C. P. Ravikumar, A. Kuchlous, G. Manimaran, Incomplete star graph: An economical fault-tolerant interconnection network, Proceedings of International Conference on Parallel Processing, Vol. I, 1993, 83, 90.
26. Samatham M. R., Pradhan D. K. The de Bruijn multiprocessor networks: A versatile parallel processing and sorting networks for VLSI. IEEE Trans. Comput. 38:1989;567-581.
27. Sen A. Supercube: An optimally fault tolerant network architecture. Acta Inform. 26:1989;741-748.
28. Sheu J. P., Wu C. T., Chen T. S. An optimal broadcasting algorithm without message redundancy in star graphs. IEEE Trans. Parallel Distrib. Systems. 6:1995;653-658.
29. Stone H. S. Parallel processing with the perfect shuffle. IEEE Trans. Comput. 20:1971;153-161.
30. Su M. Y., Chen G. H., Duh D. R. A shortest-path routing algorithm for the incomplete WK-recursive networks. IEEE Trans. Parallel Distrib. Systems. 8:1997;367-379.
31. Su M. Y., Chen G. H., Duh D. R. Topological properties of incomplete WK-recursive networks. Networks. 32:1998;23-45.
32. Su M. Y., Chen G. H., Duh D. R. Technical Report. December 1995.
33. Tzeng N. F. An effective approach to the enhancement of incomplete hypercube computers. J. Parallel Distrib. Comput. 14:1992;163-174.
34. Vecchia G. D., Sanges C. A recursively scalable network VLSI implementation. Future Generation Computer Systems. 4:1988;235-243.
35. Vecchia G. D., Sanges C. An optimized broadcasting technique for WK-recursive topologies. Future Generation Computer Systems. 4:1989/1990;353-357.