Communication Performance Evaluation of the Locally Twisted Cube

DOI10.1142/S0129054120500057MaRDI QIDQ5859737zbMATH OpenOpenAlexFDO

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

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 diameterinterconnection networklocally twisted cubeparallel computing systemwide diameter

Mathematics Subject Classification ID

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

Recommendations

• Optimal broadcasting for locally twisted cubes
• scientific article; zbMATH DE number 426142
• One-to-one communication in twisted cubes under restricted connectivity
• Communication delay in hypercubes in the presence of bit-reversal traffic
• Fault tolerance of locally twisted cubes
• Communication algorithms in k-ary n-cube interconnection networks
• Transmitting in the n-dimensional cube
• Efficient collective communications in dual-cube

Cites work

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

Cited in

(8)

• Hyper star fault tolerance of bubble sort networks
• Changing the diameter of the locally twisted cube
• scientific article; zbMATH DE number 426142 (Why is no real title available?)
• One-to-one communication in twisted cubes under restricted connectivity
• Optimal broadcasting for locally twisted cubes
• The locally twisted cubes
• scientific article; zbMATH DE number 841652 (Why is no real title available?)
• Embedding hierarchical cubic networks into k-rooted complete binary trees for minimum wirelength

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5859737)