Fault-tolerant routing algorithm based on disjoint paths in 3-ary n-cube networks with structure faults
暂无分享,去创建一个
[1] Xiaowei Liu,et al. Deadlock-Free Broadcast Routing in Dragonfly Networks without Virtual Channels , 2016, IEEE Transactions on Parallel and Distributed Systems.
[2] Jianxi Fan,et al. The constructive algorithm of vertex-disjoint paths in the generalized hypercube under restricted connectivity , 2019 .
[3] José Ranilla,et al. High-performance computing: the essential tool and the essential challenge , 2016, The Journal of Supercomputing.
[4] Mengjie Lv,et al. Reliability of (n, k)-star network based on g-extra conditional fault , 2019, Theor. Comput. Sci..
[5] Sun-Yuan Hsieh,et al. Panconnectivity and edge-pancyclicity of 3-ary N-cubes , 2007, The Journal of Supercomputing.
[6] Chiara Francalanci,et al. A High-Performance Deadlock-Free Multicast Routing Algorithm for K-Ary N-Cubes , 2010, IEEE Transactions on Computers.
[7] Stefan Hougardy,et al. The Floyd-Warshall algorithm on graphs with negative cycles , 2010, Inf. Process. Lett..
[8] Cheng-Kuan Lin,et al. Hamiltonian Cycle and Path Embeddings in 3-Ary 3-Cubes Based on K1,3 Structure Faults , 2016, 2016 International Computer Symposium (ICS).
[9] Litao Guo,et al. Reliability analysis of twisted cubes , 2018, Theor. Comput. Sci..
[10] Ravindra K. Ahuja,et al. Network Flows: Theory, Algorithms, and Applications , 1993 .
[11] Kung-Jui Pai,et al. Constructing two completely independent spanning trees in hypercube-variant networks , 2016, Theor. Comput. Sci..
[12] Cheng-Kuan Lin,et al. Structure connectivity and substructure connectivity of hypercubes , 2016, Theor. Comput. Sci..
[13] Huaxi Gu,et al. Improving Cloud-Based IoT Services Through Virtual Network Embedding in Elastic Optical Inter-DC Networks , 2019, IEEE Internet of Things Journal.
[14] Ru-chuan Wang,et al. Fault-tolerant hamiltonian cycles and paths embedding into locally exchanged twisted cubes , 2021 .
[15] Cheng-Kuan Lin,et al. An efficient algorithm for embedding exchanged hypercubes into grids , 2018, The Journal of Supercomputing.
[16] Cheng-Kuan Lin,et al. Optimally Embedding 3-Ary n-Cubes into Grids , 2019, Journal of Computer Science and Technology.
[17] Ruchuan Wang,et al. Reconfigurable Fault‐tolerance mapping of ternary N‐cubes onto chips , 2020, Concurr. Comput. Pract. Exp..
[18] Shuming Zhou,et al. On Reliability of Multiprocessor System Based on Star Graph , 2020, IEEE Transactions on Reliability.
[19] Hari Krishnan,et al. Fault-Tolerant Routing with Minimum Delay for Mesh Architecture , 2018, 2018 International CET Conference on Control, Communication, and Computing (IC4).
[20] Xiaohua Jia,et al. A Novel Low Cost Interconnection Architecture Based on the Generalized Hypercube , 2020, IEEE Transactions on Parallel and Distributed Systems.
[21] Aixia Liu,et al. g-Good-neighbor conditional diagnosability measures for 3-ary n-cube networks , 2016, Theor. Comput. Sci..
[22] Ahmad Patooghy,et al. Fault-tolerant routing methodology for hypercube and cube-connected cycles interconnection networks , 2017, The Journal of Supercomputing.
[23] Jie Wu,et al. A General Fault-Tolerant Minimal Routing for Mesh Architectures , 2017, IEEE Transactions on Computers.
[24] Dong Xiang,et al. Fault-Tolerant Adaptive Routing in Dragonfly Networks , 2019, IEEE Transactions on Dependable and Secure Computing.
[25] Dajin Wang. Hamiltonian Embedding in Crossed Cubes with Failed Links , 2012, IEEE Transactions on Parallel and Distributed Systems.
[26] Haitao Wu,et al. BCube: a high performance, server-centric network architecture for modular data centers , 2009, SIGCOMM '09.
[27] Jing Li,et al. Panconnectivity and pancyclicity of the 3-ary n-cube network under the path restrictions , 2014, Appl. Math. Comput..
[28] Sun-Yuan Hsieh,et al. The Conditional Diagnosability of k-Ary n-Cubes under the Comparison Diagnosis Model , 2013, IEEE Trans. Computers.
[29] Yoon Seok Yang,et al. SDPR: Improving Latency and Bandwidth in On-Chip Interconnect Through Simultaneous Dual-Path Routing , 2018, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[30] Xiaofan Yang,et al. Embedding paths and cycles in 3-ary n-cubes with faulty nodes and links , 2010, Inf. Sci..
[31] Keiichi Kaneko,et al. Fault-tolerant Routing Methods in Crossed Cubes , 2018, IAIT 2018.
[32] GUOZHEN ZHANG,et al. Structure Connectivity and Substructure Connectivity of k-Ary n-Cube Networks , 2019, IEEE Access.
[33] Guozhen Zhang,et al. Structure connectivity and substructure connectivity of bubble-sort star graph networks , 2019, Appl. Math. Comput..
[34] Qiang Wang,et al. A Path-Counter Method for Fault-Tolerant Minimal Routing Algorithms in 2D Mesh , 2018, J. Circuits Syst. Comput..
[35] Cheng-Nan Lai,et al. Optimal Construction of All Shortest Node-Disjoint Paths in Hypercubes with Applications , 2012, IEEE Transactions on Parallel and Distributed Systems.
[36] Rong-Xia Hao,et al. 3-extra Connectivity of 3-ary N-cube Networks , 2014, Inf. Process. Lett..
[37] Wenshui Lin,et al. Fault tolerance of locally twisted cubes , 2018, Appl. Math. Comput..
[38] Cheng-Kuan Lin,et al. Vertex-disjoint paths in DCell networks , 2016, J. Parallel Distributed Comput..
[39] Nanning Zheng,et al. Fault-Aware Load-Balancing Routing for 2D-Mesh and Torus On-Chip Network Topologies , 2016, IEEE Transactions on Computers.
[40] Cheng-Kuan Lin,et al. An efficient algorithm to construct disjoint path covers of DCell networks , 2016, Theor. Comput. Sci..
[41] Yu Yang,et al. A multiquadric quasi-interpolations method for CEV option pricing model , 2019, J. Comput. Appl. Math..
[42] James Aspnes,et al. Fault-tolerant routing in peer-to-peer systems , 2002, PODC '02.
[43] John Kim,et al. SuperSim: Extensible Flit-Level Simulation of Large-Scale Interconnection Networks , 2018, 2018 IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS).
[44] Kyomin Jung,et al. Fully Distributed Algorithms for Minimum Delay Routing Under Heavy Traffic , 2014, IEEE Transactions on Mobile Computing.
[45] Ruay-Shiung Chang,et al. Three completely independent spanning trees of crossed cubes with application to secure-protection routing , 2020, Inf. Sci..