File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Adaptive Wormbole Routing in Hypercube Multicomputers

TitleAdaptive Wormbole Routing in Hypercube Multicomputers
Authors
Issue Date1998
PublisherAcademic 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?
AbstractBoth 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 Identifierhttp://hdl.handle.net/10722/225192
ISSN
2015 Impact Factor: 1.32
2015 SCImago Journal Rankings: 0.851

 

DC FieldValueLanguage
dc.contributor.authorLin, X-
dc.contributor.authorEsfahanian, AH-
dc.contributor.authorBurgo, A-
dc.date.accessioned2016-04-28T02:15:33Z-
dc.date.available2016-04-28T02:15:33Z-
dc.date.issued1998-
dc.identifier.citationJournal of Parallel and Distributed Computing, 1998, v. 48, p. 165-174-
dc.identifier.issn0743-7315-
dc.identifier.urihttp://hdl.handle.net/10722/225192-
dc.description.abstractBoth 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.languageeng-
dc.publisherAcademic Press. The Journal's web site is located at http://www.elsevier.com/locate/jpdc-
dc.relation.ispartofJournal of Parallel and Distributed Computing-
dc.titleAdaptive Wormbole Routing in Hypercube Multicomputers-
dc.typeArticle-
dc.identifier.emailLin, X: xlin@hkueee.hku.hk-
dc.identifier.doi10.1006/jpdc.1997.1417-
dc.identifier.scopuseid_2-s2.0-0040088600-
dc.identifier.hkuros36908-
dc.identifier.volume48-
dc.identifier.spage165-
dc.identifier.epage174-
dc.publisher.placeUnited States-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats