Adaptive Wormhole Routing in Hypercube Multicomputers |
| |
Authors: | X. Lin A-H. Esfahanian A. Burago |
| |
Affiliation: | aDepartment of Electric and Electronic Engineering, The University of Hong Kong, Hong Kong;bDepartment of Computer Science, Michigan State University, East Lansing, Michigan, 48824 |
| |
Abstract: | Both adaptive unicast routing and efficient multicast communication have been shown to be important to the performance of distributed-memory multiprocessors, or multicomputers. In this paper, we propose a uniform adaptive routing strategy for wormhole-routed hypercube networks that accommodates both unicast and multicast communication. Based on a node labeling method, the resultant routing algorithms are shown to be deadlock-free without requiring virtual channels. We present an optimal ordering algorithm that minimizes the traffic generated under the proposed paradigm. A greedy algorithm with less time complexity is also proposed. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|