File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Optimal routing algorithm for shuffle-exchange networks

TitleOptimal routing algorithm for shuffle-exchange networks
Authors
KeywordsInterconnection network
Multiprocessor
Routing
Shuffle-exchange network
Issue Date2001
Citation
Jisuanji Xuebao/Chinese Journal Of Computers, 2001, v. 24 n. 1, p. 25-31 How to Cite?
AbstractThe shuffle-exchange network is among the most interesting interconnection networks. However, one of its drawbacks is the lack of the optimal routing algorithm. An optimal routing algorithm always directs a message along the shortest path between any two nodes. We propose an O(n 2)-time algorithm for the optimal routing in a shuffle-exchange network having 2 n nodes; in particular, it would avoid cycling through a common substring of the source and destination addresses if it is deemed profitable. The algorithm can be easily adapted to routing in the cube-connected cycles (CCC)--the result is a much simpler algorithm than a previous algorithm for the CCC.
Persistent Identifierhttp://hdl.handle.net/10722/88906
ISSN
2015 SCImago Journal Rankings: 0.338
References

 

DC FieldValueLanguage
dc.contributor.authorChen, GHen_HK
dc.contributor.authorLau, FCMen_HK
dc.contributor.authorGu, Qen_HK
dc.contributor.authorXie, Len_HK
dc.date.accessioned2010-09-06T09:49:57Z-
dc.date.available2010-09-06T09:49:57Z-
dc.date.issued2001en_HK
dc.identifier.citationJisuanji Xuebao/Chinese Journal Of Computers, 2001, v. 24 n. 1, p. 25-31en_HK
dc.identifier.issn0254-4164en_HK
dc.identifier.urihttp://hdl.handle.net/10722/88906-
dc.description.abstractThe shuffle-exchange network is among the most interesting interconnection networks. However, one of its drawbacks is the lack of the optimal routing algorithm. An optimal routing algorithm always directs a message along the shortest path between any two nodes. We propose an O(n 2)-time algorithm for the optimal routing in a shuffle-exchange network having 2 n nodes; in particular, it would avoid cycling through a common substring of the source and destination addresses if it is deemed profitable. The algorithm can be easily adapted to routing in the cube-connected cycles (CCC)--the result is a much simpler algorithm than a previous algorithm for the CCC.en_HK
dc.languageengen_HK
dc.relation.ispartofJisuanji Xuebao/Chinese Journal of Computersen_HK
dc.subjectInterconnection networken_HK
dc.subjectMultiprocessoren_HK
dc.subjectRoutingen_HK
dc.subjectShuffle-exchange networken_HK
dc.titleOptimal routing algorithm for shuffle-exchange networksen_HK
dc.typeArticleen_HK
dc.identifier.emailLau, FCM:fcmlau@cs.hku.hken_HK
dc.identifier.authorityLau, FCM=rp00221en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.scopuseid_2-s2.0-0034855559en_HK
dc.identifier.hkuros71133en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0034855559&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume24en_HK
dc.identifier.issue1en_HK
dc.identifier.spage25en_HK
dc.identifier.epage31en_HK
dc.publisher.placeChinaen_HK
dc.identifier.scopusauthoridChen, GH=7406537386en_HK
dc.identifier.scopusauthoridLau, FCM=7102749723en_HK
dc.identifier.scopusauthoridGu, Q=35242234100en_HK
dc.identifier.scopusauthoridXie, L=8563876300en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats