File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Multi-phase minimal fault-tolerant wormhole routing in meshes

TitleMulti-phase minimal fault-tolerant wormhole routing in meshes
Authors
KeywordsArticulation point
Disjoint fault-connected region
Fault-tolerant wormhole routing
Mesh multiprocessors
Multi-phase minimal path
Virtual channel
Issue Date2004
PublisherElsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/parco
Citation
Parallel Computing, 2004, v. 30 n. 3, p. 423-442 How to Cite?
AbstractIn a multiprocessor system, it is important that the shortest path is always selected for inter-process communication. If every node in the system can acquire the accurate status of all nodes, then optimal routing is possible, but this is not feasible in view of the space and time costs involved. We propose a fault-tolerant wormhole routing algorithm for the mesh network in this paper, which is based on the idea of multi-phase minimal routing. The algorithm requires only local information at every node. When messages in transit come in contact with a fault region, they would select a locally minimal path around the region. The proposed algorithm can tolerate convex fault regions with only four virtual channels per physical channel regardless of how processors of different fault regions may overlap. The aggregation of locally minimal path segments gives a complete routing path between source and destination. Via simulation, we find that the algorithm has near optimal performance in most cases. © 2004 Elsevier B.V. All rights reserved.
Persistent Identifierhttp://hdl.handle.net/10722/89010
ISSN
2015 Impact Factor: 1.0
2015 SCImago Journal Rankings: 0.726
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorZhou, Jen_HK
dc.contributor.authorLau, FCMen_HK
dc.date.accessioned2010-09-06T09:51:16Z-
dc.date.available2010-09-06T09:51:16Z-
dc.date.issued2004en_HK
dc.identifier.citationParallel Computing, 2004, v. 30 n. 3, p. 423-442en_HK
dc.identifier.issn0167-8191en_HK
dc.identifier.urihttp://hdl.handle.net/10722/89010-
dc.description.abstractIn a multiprocessor system, it is important that the shortest path is always selected for inter-process communication. If every node in the system can acquire the accurate status of all nodes, then optimal routing is possible, but this is not feasible in view of the space and time costs involved. We propose a fault-tolerant wormhole routing algorithm for the mesh network in this paper, which is based on the idea of multi-phase minimal routing. The algorithm requires only local information at every node. When messages in transit come in contact with a fault region, they would select a locally minimal path around the region. The proposed algorithm can tolerate convex fault regions with only four virtual channels per physical channel regardless of how processors of different fault regions may overlap. The aggregation of locally minimal path segments gives a complete routing path between source and destination. Via simulation, we find that the algorithm has near optimal performance in most cases. © 2004 Elsevier B.V. All rights reserved.en_HK
dc.languageengen_HK
dc.publisherElsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/parcoen_HK
dc.relation.ispartofParallel Computingen_HK
dc.rightsParallel Computing. Copyright © Elsevier BV.en_HK
dc.subjectArticulation pointen_HK
dc.subjectDisjoint fault-connected regionen_HK
dc.subjectFault-tolerant wormhole routingen_HK
dc.subjectMesh multiprocessorsen_HK
dc.subjectMulti-phase minimal pathen_HK
dc.subjectVirtual channelen_HK
dc.titleMulti-phase minimal fault-tolerant wormhole routing in meshesen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0167-8191&volume=30&issue=3&spage=423&epage=442&date=2004&atitle=Multi-phase+Minimal+Fault-tolerant+Wormhole+Routing+in+Meshesen_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.1016/j.parco.2004.01.001en_HK
dc.identifier.scopuseid_2-s2.0-1842852968en_HK
dc.identifier.hkuros92472en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-1842852968&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume30en_HK
dc.identifier.issue3en_HK
dc.identifier.spage423en_HK
dc.identifier.epage442en_HK
dc.identifier.isiWOS:000221135000007-
dc.publisher.placeNetherlandsen_HK
dc.identifier.scopusauthoridZhou, J=7405551486en_HK
dc.identifier.scopusauthoridLau, FCM=7102749723en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats