File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1006/jpdc.1997.1417
- Scopus: eid_2-s2.0-0040088600
- WOS: WOS:000073484200002
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Adaptive Wormbole Routing in Hypercube Multicomputers
Title | Adaptive Wormbole Routing in Hypercube Multicomputers |
---|---|
Authors | |
Issue Date | 1998 |
Publisher | Academic Press. The Journal's web site is located at http://www.elsevier.com/locate/jpdc |
Citation | Journal of Parallel and Distributed Computing, 1998, v. 48, p. 165-174 How to Cite? |
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. |
Persistent Identifier | http://hdl.handle.net/10722/225192 |
ISSN | 2023 Impact Factor: 3.4 2023 SCImago Journal Rankings: 1.187 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lin, X | - |
dc.contributor.author | Esfahanian, AH | - |
dc.contributor.author | Burgo, A | - |
dc.date.accessioned | 2016-04-28T02:15:33Z | - |
dc.date.available | 2016-04-28T02:15:33Z | - |
dc.date.issued | 1998 | - |
dc.identifier.citation | Journal of Parallel and Distributed Computing, 1998, v. 48, p. 165-174 | - |
dc.identifier.issn | 0743-7315 | - |
dc.identifier.uri | http://hdl.handle.net/10722/225192 | - |
dc.description.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. | - |
dc.language | eng | - |
dc.publisher | Academic Press. The Journal's web site is located at http://www.elsevier.com/locate/jpdc | - |
dc.relation.ispartof | Journal of Parallel and Distributed Computing | - |
dc.title | Adaptive Wormbole Routing in Hypercube Multicomputers | - |
dc.type | Article | - |
dc.identifier.email | Lin, X: xlin@hkueee.hku.hk | - |
dc.identifier.doi | 10.1006/jpdc.1997.1417 | - |
dc.identifier.scopus | eid_2-s2.0-0040088600 | - |
dc.identifier.hkuros | 36908 | - |
dc.identifier.volume | 48 | - |
dc.identifier.spage | 165 | - |
dc.identifier.epage | 174 | - |
dc.identifier.isi | WOS:000073484200002 | - |
dc.publisher.place | United States | - |
dc.identifier.issnl | 0743-7315 | - |