File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1016/j.parco.2004.01.001
- Scopus: eid_2-s2.0-1842852968
- WOS: WOS:000221135000007
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Multi-phase minimal fault-tolerant wormhole routing in meshes
Title | Multi-phase minimal fault-tolerant wormhole routing in meshes |
---|---|
Authors | |
Keywords | Articulation point Disjoint fault-connected region Fault-tolerant wormhole routing Mesh multiprocessors Multi-phase minimal path Virtual channel |
Issue Date | 2004 |
Publisher | Elsevier 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? |
Abstract | In 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 Identifier | http://hdl.handle.net/10722/89010 |
ISSN | 2023 Impact Factor: 2.0 2023 SCImago Journal Rankings: 0.460 |
ISI Accession Number ID | |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Zhou, J | en_HK |
dc.contributor.author | Lau, FCM | en_HK |
dc.date.accessioned | 2010-09-06T09:51:16Z | - |
dc.date.available | 2010-09-06T09:51:16Z | - |
dc.date.issued | 2004 | en_HK |
dc.identifier.citation | Parallel Computing, 2004, v. 30 n. 3, p. 423-442 | en_HK |
dc.identifier.issn | 0167-8191 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/89010 | - |
dc.description.abstract | In 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.language | eng | en_HK |
dc.publisher | Elsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/parco | en_HK |
dc.relation.ispartof | Parallel Computing | en_HK |
dc.rights | Parallel Computing. Copyright © Elsevier BV. | en_HK |
dc.subject | Articulation point | en_HK |
dc.subject | Disjoint fault-connected region | en_HK |
dc.subject | Fault-tolerant wormhole routing | en_HK |
dc.subject | Mesh multiprocessors | en_HK |
dc.subject | Multi-phase minimal path | en_HK |
dc.subject | Virtual channel | en_HK |
dc.title | Multi-phase minimal fault-tolerant wormhole routing in meshes | en_HK |
dc.type | Article | en_HK |
dc.identifier.openurl | http://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+Meshes | en_HK |
dc.identifier.email | Lau, FCM:fcmlau@cs.hku.hk | en_HK |
dc.identifier.authority | Lau, FCM=rp00221 | en_HK |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1016/j.parco.2004.01.001 | en_HK |
dc.identifier.scopus | eid_2-s2.0-1842852968 | en_HK |
dc.identifier.hkuros | 92472 | en_HK |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-1842852968&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.volume | 30 | en_HK |
dc.identifier.issue | 3 | en_HK |
dc.identifier.spage | 423 | en_HK |
dc.identifier.epage | 442 | en_HK |
dc.identifier.isi | WOS:000221135000007 | - |
dc.publisher.place | Netherlands | en_HK |
dc.identifier.scopusauthorid | Zhou, J=7405551486 | en_HK |
dc.identifier.scopusauthorid | Lau, FCM=7102749723 | en_HK |
dc.identifier.issnl | 0167-8191 | - |