Topological Properties of Hypercubes
IEEE Transactions on Computers
Optimal communication algorithms for regular decompositions on the hypercube
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
Intensive hypercube communication. Prearranged communication in link-bound machines
Journal of Parallel and Distributed Computing
Data Structures and Algorithms
Data Structures and Algorithms
IEEE Transactions on Parallel and Distributed Systems
Heuristic Algorithms for Broadcasting in Point-to-Point Computer Networks
IEEE Transactions on Computers
| Hi-index | 0.00 |
Abstract: The banyan-hypercube (BH) is one of the recently introduced hypercube-based interconnection networks. Due to the importance of communication in the overall system performance in a multiprocessing environment, this paper presents a near-optimal personalized broadcasting algorithm on the BHs. The analysis of this algorithm for both BHs and hypercubes is conducted for both single-port communication and multiple-port communication. We show that personalized broadcasting for both networks have the same communication time in the single-port mode. In multiple-port mode, the performance of the BH depends on its number of levels. When the number of levels is less than 4, the BHs outperform the hypercubes. However, the hypercubes have better performance than the BHs with large number of levels (4). When the number of levels is equal to 4, both networks have the same performance.