File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Fault-tolerant wormhole routing algorithm in 2d meshes without virtual channels

TitleFault-tolerant wormhole routing algorithm in 2d meshes without virtual channels
Authors
Issue Date2004
PublisherSpringer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/
Citation
2nd International Symposium on Parallel and Distributed Processing and Applications (ISPA'2004), Hong Kong, China, 13-15 December 2004. In Lecture Notes In Computer Science (Including Subseries Lecture Notes In Artificial Intelligence And Lecture Notes In Bioinformatics), 2004, v. 3358, p. 688-697 How to Cite?
AbstractIn wormhole meshes, many routing algorithms prevent deadlocks by enclosing faulty nodes within faulty blocks. None of them however can tolerate the convex fault model without virtual channels. We propose a deterministic fault-tolerant wormhole routing algorithm for mesh networks that can handle disjoint convex faulty regions. These regions would not contain any nonfaulty nodes. The proposed algorithm does not use any virtual channels, which routes the messages using an extended X-Y routing algorithm in the fault-free regions. The algorithm is deadlock- and livelock-free. © Springer-Verlag Berlin Heidelberg 2004.
Persistent Identifierhttp://hdl.handle.net/10722/152365
ISBN
ISSN
2005 Impact Factor: 0.402
2015 SCImago Journal Rankings: 0.252
References

 

DC FieldValueLanguage
dc.contributor.authorZhou, Jen_US
dc.contributor.authorLau, FCMen_US
dc.date.accessioned2012-06-26T06:37:39Z-
dc.date.available2012-06-26T06:37:39Z-
dc.date.issued2004en_US
dc.identifier.citation2nd International Symposium on Parallel and Distributed Processing and Applications (ISPA'2004), Hong Kong, China, 13-15 December 2004. In Lecture Notes In Computer Science (Including Subseries Lecture Notes In Artificial Intelligence And Lecture Notes In Bioinformatics), 2004, v. 3358, p. 688-697en_US
dc.identifier.isbn978-3-540-24128-7-
dc.identifier.issn0302-9743en_US
dc.identifier.urihttp://hdl.handle.net/10722/152365-
dc.description.abstractIn wormhole meshes, many routing algorithms prevent deadlocks by enclosing faulty nodes within faulty blocks. None of them however can tolerate the convex fault model without virtual channels. We propose a deterministic fault-tolerant wormhole routing algorithm for mesh networks that can handle disjoint convex faulty regions. These regions would not contain any nonfaulty nodes. The proposed algorithm does not use any virtual channels, which routes the messages using an extended X-Y routing algorithm in the fault-free regions. The algorithm is deadlock- and livelock-free. © Springer-Verlag Berlin Heidelberg 2004.en_US
dc.languageengen_US
dc.publisherSpringer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/en_US
dc.relation.ispartofLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)en_US
dc.titleFault-tolerant wormhole routing algorithm in 2d meshes without virtual channelsen_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.doi10.1007/978-3-540-30566-8_80-
dc.identifier.scopuseid_2-s2.0-35048817918en_US
dc.identifier.hkuros104852-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-35048817918&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume3358en_US
dc.identifier.spage688en_US
dc.identifier.epage697en_US
dc.publisher.placeGermanyen_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