File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Adaptive fault-tolerant wormhole routing with two virtual channels in 2D meshes

TitleAdaptive fault-tolerant wormhole routing with two virtual channels in 2D meshes
Authors
Zhou, JLau, FCM
KeywordsAdaptive Fault-Tolerant Routing
Deadlock Freedom
Disjoint Fault-Connected Regions
Virtual Channel
Wormhole Routing
Issue Date2004
Citation
Proceedings Of The International Symposium On Parallel Architectures, Algorithms And Networks, I-Span, 2004, p. 142-148 How to Cite?
AbstractAn adaptive fault-tolerant wormhole routing algorithm based on a convex fault model in 2D meshes is presented. With the algorithm, a normal routing message, when blocked by faulty processors, would detour along some special polygons around the fault region. The result is that the proposed algorithm can tolerate convex faults with only two virtual channels per physical channel regardless of the overlapping of the boundaries of different fault regions. The convex fault model used does not include any nonfaulty processors and the proposed algorithm is deadlock-free.
Persistent Identifierhttp://hdl.handle.net/10722/151900
References
References in Scopus

 

DC FieldValueLanguage
dc.contributor.authorZhou, Jen_US
dc.contributor.authorLau, FCMen_US
dc.date.accessioned2012-06-26T06:30:35Z-
dc.date.available2012-06-26T06:30:35Z-
dc.date.issued2004en_US
dc.identifier.citationProceedings Of The International Symposium On Parallel Architectures, Algorithms And Networks, I-Span, 2004, p. 142-148en_US
dc.identifier.urihttp://hdl.handle.net/10722/151900-
dc.description.abstractAn adaptive fault-tolerant wormhole routing algorithm based on a convex fault model in 2D meshes is presented. With the algorithm, a normal routing message, when blocked by faulty processors, would detour along some special polygons around the fault region. The result is that the proposed algorithm can tolerate convex faults with only two virtual channels per physical channel regardless of the overlapping of the boundaries of different fault regions. The convex fault model used does not include any nonfaulty processors and the proposed algorithm is deadlock-free.en_US
dc.languageengen_US
dc.relation.ispartofProceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPANen_US
dc.subjectAdaptive Fault-Tolerant Routingen_US
dc.subjectDeadlock Freedomen_US
dc.subjectDisjoint Fault-Connected Regionsen_US
dc.subjectVirtual Channelen_US
dc.subjectWormhole Routingen_US
dc.titleAdaptive fault-tolerant wormhole routing with two virtual channels in 2D meshesen_US
dc.typeConference_Paperen_US
dc.identifier.emailLau, FCM:fcmlau@cs.hku.hken_US
dc.identifier.authorityLau, FCM=rp00221en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.scopuseid_2-s2.0-3543088106en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-3543088106&selection=ref&src=s&origin=recordpageen_US
dc.identifier.spage142en_US
dc.identifier.epage148en_US
dc.identifier.scopusauthoridZhou, J=7405551486en_US
dc.identifier.scopusauthoridLau, FCM=7102749723en_US

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats