Multicast Algorithms for Hypercube Multiprocessors |
| |
| Affiliation: | 1. State Key Laboratory of ISN, Xidian University, Xi''an, China;2. Institute of Microelectronics, Xidian University, Xi''an, China;3. The University of Otago, Otago, New Zealand;1. Department of Computer Engineering, Science and Research Branch, Islamic Azad University, Ashrafi Esfahani Street, Poonak Sq., Tehran, Iran\n;2. Department of Computer Engineering, Sharif University of Technology, Tehran, Iran;3. School of Computer Science, Institute for Research in Fundamental Sciences (IPM), Tehran, Iran;4. Iran Telecommunication Research Center Institute, PO Box 3961-14155, Tehran, Iran |
| |
| Abstract: | Depending on different switching technologies, the multicast communication problem has been formulated as three different graph theoretical problems: the Steiner tree problem, the multicast tree problem, and the multicast path problem. Our efforts in this paper are to reduce the communication traffic of multicast in hypercube multiprocessors. We propose three heuristic algorithms for the three problem models. Our multicast path algorithm is distributed, our Steiner tree algorithm is centralized, and our multicast tree algorithm is hybrid. Compared with the previous results by simulation, each of our heuristic algorithms improves the communication traffic in the corresponding multicast problem model. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
