File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Routing with locality on meshes with buses

TitleRouting with locality on meshes with buses
Authors
Issue Date1996
PublisherAcademic Press. The Journal's web site is located at http://www.elsevier.com/locate/jpdc
Citation
Journal Of Parallel And Distributed Computing, 1996, v. 33 n. 1, p. 84-90 How to Cite?
AbstractRouting with locality is studied for meshes with buses. In this problem, packets' distances are bounded by a value, d, which is less than the diameter of the network. This problem arises naturally when specific known algorithms are implemented on meshes. Solving this problem in ordinary meshes requires at least a routing time of d steps. To do better than this, we propose adding a kind of short bus to ordinary meshes. By using a technique which we call iterative walk-and-ride, we show how the routing time can be reduced by approximately one-third for solving the problem (including the multipacket version) on one-and two-dimensional short-bus meshes. The bounds we develop are tight. © 1996 Academic Press, Inc.
Persistent Identifierhttp://hdl.handle.net/10722/89048
ISSN
2015 Impact Factor: 1.32
2015 SCImago Journal Rankings: 0.851
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorCheung, Sen_HK
dc.contributor.authorLau, FCMen_HK
dc.date.accessioned2010-09-06T09:51:44Z-
dc.date.available2010-09-06T09:51:44Z-
dc.date.issued1996en_HK
dc.identifier.citationJournal Of Parallel And Distributed Computing, 1996, v. 33 n. 1, p. 84-90en_HK
dc.identifier.issn0743-7315en_HK
dc.identifier.urihttp://hdl.handle.net/10722/89048-
dc.description.abstractRouting with locality is studied for meshes with buses. In this problem, packets' distances are bounded by a value, d, which is less than the diameter of the network. This problem arises naturally when specific known algorithms are implemented on meshes. Solving this problem in ordinary meshes requires at least a routing time of d steps. To do better than this, we propose adding a kind of short bus to ordinary meshes. By using a technique which we call iterative walk-and-ride, we show how the routing time can be reduced by approximately one-third for solving the problem (including the multipacket version) on one-and two-dimensional short-bus meshes. The bounds we develop are tight. © 1996 Academic Press, Inc.en_HK
dc.languageengen_HK
dc.publisherAcademic Press. The Journal's web site is located at http://www.elsevier.com/locate/jpdcen_HK
dc.relation.ispartofJournal of Parallel and Distributed Computingen_HK
dc.titleRouting with locality on meshes with busesen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0743-7315&volume=33&issue=1&spage=84&epage=90&date=1996&atitle=Routing+with+locality+on+meshes+with+busesen_HK
dc.identifier.emailLau, FCM:fcmlau@cs.hku.hken_HK
dc.identifier.authorityLau, FCM=rp00221en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1006/jpdc.1996.0027en_HK
dc.identifier.scopuseid_2-s2.0-0030600719en_HK
dc.identifier.hkuros9782en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0030600719&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume33en_HK
dc.identifier.issue1en_HK
dc.identifier.spage84en_HK
dc.identifier.epage90en_HK
dc.identifier.isiWOS:A1996UB20800009-
dc.publisher.placeUnited Statesen_HK
dc.identifier.scopusauthoridCheung, S=8059068300en_HK
dc.identifier.scopusauthoridLau, FCM=7102749723en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats