Communication Performance Evaluation of the Locally Twisted Cube

DOI10.1142/S0129054120500057zbMath1458.68022OpenAlexW3011021998MaRDI QIDQ5859737

Yuejuan Han, Lantao You, Jianxi Fan, Cheng-Kuan Lin

Publication date: 20 April 2021

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054120500057

zbMATH Keywords

fault diameterwide diameterinterconnection networklocally twisted cubeparallel computing system

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (2)

Hyper star fault tolerance of bubble sort networks ⋮ Embedding hierarchical cubic networks into \(k\)-rooted complete binary trees for minimum wirelength

Cites Work

• Unnamed Item
• Conditional edge-fault Hamiltonian-connectivity of restricted hypercube-like networks
• Diagnosable evaluation of enhanced optical transpose interconnection system networks
• Optimal broadcasting for locally twisted cubes
• \(h\)-restricted connectivity of locally twisted cubes
• Fault-tolerant edge-pancyclicity of locally twisted cubes
• Structure connectivity and substructure connectivity of \(k\)-ary \(n\)-cube networks
• \(\{2,3\}\)-restricted connectivity of locally twisted cubes
• Embedding meshes into locally twisted cubes
• The twisted-cube connected networks
• The crossing number of locally twisted cubes \(L T Q_n\)
• Reliability analysis of twisted cubes
• Locally twisted cubes are 4-pancyclic.
• Topological properties of twisted cube
• Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults
• Fault tolerance of locally twisted cubes
• The \(g\)-extra connectivity and diagnosability of crossed cubes
• An efficient construction of one-to-many node-disjoint paths in folded hypercubes
• Changing the diameter of the locally twisted cube
• The $t/k$-Diagnosability of Star Graph Networks
• A Fault-Free Unicast Algorithm in the Generalized Hypercube with Restricted Faulty Vertices
• Optimal Bounds for Disjoint Hamilton Cycles in Star Graphs
• The locally twisted cubes
• Component Edge Connectivity of Hypercubes
• Strong Diagnosability and Conditional Diagnosability of Multiprocessor Systems and Folded Hypercubes
• Linear layout of locally twisted cubes

This page was built for publication: Communication Performance Evaluation of the Locally Twisted Cube