dc.date.accessioned | 2018-10-17T10:27:00Z | |
dc.date.available | 2019-02-08T23:31:39Z | |
dc.date.created | 2018-01-20T21:58:31Z | |
dc.date.issued | 2017 | |
dc.identifier.citation | Peñaranda, Roberto Lopez, Pedro Gómez, Maria E. Gran, Ernst Gunnar Skeie, Tor . A Fault-Tolerant Routing Strategy for K-ary N-direct S-indirect Topologies Based on Intermediate Nodes. Concurrency and Computation. 2017, 29(13) | |
dc.identifier.uri | http://hdl.handle.net/10852/65180 | |
dc.description.abstract | Exascale computing systems are being built with thousands of nodes. The high number of components of these systems significantly increases the probability of failure. A key component for them is the interconnection network. If failures occur in the interconnection network, they may isolate a large fraction of the machine. For this reason, an efficient fault‐tolerant mechanism is needed to keep the system interconnected, even in the presence of faults. A recently proposed topology for these large systems is the hybrid k‐ary n‐direct s‐indirect family that provides optimal performance and connectivity at a reduced hardware cost. This paper presents a fault‐tolerant routing methodology for the k‐ary n‐direct s‐indirect topology that degrades performance gracefully in presence of faults and tolerates a large number of faults without disabling any healthy computing node. In order to tolerate network failures, the methodology uses a simple mechanism. For any source‐destination pair, if necessary, packets are forwarded to the destination node through a set of intermediate nodes (without being ejected from the network) with the aim of circumventing faults. The evaluation results shows that the proposed methodology tolerates a large number of faults. For instance, it is able to tolerate more than 99.5% of fault combinations when there are 10 faults in a 3‐D network with 1000 nodes using only 1 intermediate node and more than 99.98% if 2 intermediate nodes are used. Furthermore, the methodology offers a gracious performance degradation. As an example, performance degrades only by 1% for a 2‐D network with 1024 nodes and 1% faulty links. | en_US |
dc.language | EN | |
dc.publisher | Wiley-Interscience Publishers | |
dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 International | |
dc.rights.uri | https://creativecommons.org/licenses/by-nc-nd/4.0/ | |
dc.title | A Fault-Tolerant Routing Strategy for K-ary N-direct S-indirect Topologies Based on Intermediate Nodes | en_US |
dc.type | Journal article | en_US |
dc.creator.author | Peñaranda, Roberto | |
dc.creator.author | Lopez, Pedro | |
dc.creator.author | Gómez, Maria E. | |
dc.creator.author | Gran, Ernst Gunnar | |
dc.creator.author | Skeie, Tor | |
cristin.unitcode | 185,15,5,71 | |
cristin.unitname | Forskningsgruppen for nettverk og distribuerte systemer | |
cristin.ispublished | true | |
cristin.fulltext | postprint | |
cristin.qualitycode | 2 | |
dc.identifier.cristin | 1548470 | |
dc.identifier.bibliographiccitation | info:ofi/fmt:kev:mtx:ctx&ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.jtitle=Concurrency and Computation&rft.volume=29&rft.spage=&rft.date=2017 | |
dc.identifier.jtitle | Concurrency and Computation | |
dc.identifier.volume | 29 | |
dc.identifier.issue | 13 | |
dc.identifier.pagecount | 11 | |
dc.identifier.doi | http://dx.doi.org/10.1002/cpe.4065 | |
dc.identifier.urn | URN:NBN:no-67719 | |
dc.type.document | Tidsskriftartikkel | en_US |
dc.type.peerreviewed | Peer reviewed | |
dc.source.issn | 1532-0626 | |
dc.identifier.fulltext | Fulltext https://www.duo.uio.no/bitstream/handle/10852/65180/4/CRIStinEntryNr1548470_AFault-TolerantRoutingStrategyForKNSTopologiesBasedOnIntermediateNodes.pdf | |
dc.type.version | AcceptedVersion | |
dc.relation.project | NFR/213283 | |