An efficient shortest path routing on the hypercube with blocking/faulty nodes-Reference-Cited by-同舟云学术

An efficient shortest path routing on the hypercube with blocking/faulty nodes

Published:2020-12-13 Issue:12 Volume:33 Page:
ISSN:1532-0626
Container-title:Concurrency and Computation: Practice and Experience
language:en
Short-container-title:Concurrency Computat Pract Exper

Author:

Arabpour Niasari Mehrdad¹^ORCID,Qiu Ke¹

Affiliation:

1. Department of Computer Science Brock University St. Catharines Ontario Canada

Publisher

Wiley

Subject

Computational Theory and Mathematics,Computer Networks and Communications,Computer Science Applications,Theoretical Computer Science,Software

Link

https://onlinelibrary.wiley.com/doi/pdf/10.1002/cpe.6124

Reference9 articles.

1. DietzfelbingerSMM SudboroughI. Three disjoint path paradigms in star networks. Paper presented at: Proceedings of the the 3rd IEEE Symposium on Parallel and Distributed Processing Dallas Texas;1991:400‐406.

2. A fault‐tolerant routing strategy in hypercube multicomputers;Chiu G;IEEE Trans Comput,1996

3. A fault tolerant routing scheme for hypercubes;Day K;Telecommun Syst,2000

4. Fault‐tolerant routing algorithms for hypercube interconnection networks;Kaneko K;IEICE Trans Inf Syst,2001

5. Routing on the hypercube with blocking/faulty nodes;Cheng E;Congressus Numerantium,2017

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An application-level failure detection algorithm based on a robust and efficient torus-tree for HPC;2021 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Big Data & Cloud Computing, Sustainable Computing & Communications, Social Computing & Networking (ISPA/BDCloud/SocialCom/SustainCom);2021-09