Upper bounds on the connection probability for 2-D meshes and tori

DOI10.1016/j.jpdc.2011.11.006zbMath1242.68006OpenAlexW2038745738MaRDI QIDQ433405

Meilian Liang, Jiarong Liang, Xiaodong Xu, Zehui Shao

Publication date: 13 July 2012

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2011.11.006

zbMATH Keywords

torusfault tolerancemeshconnection probabilityparallel computer systemsubmesh

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Mathematical problems of computer architecture (68M07)

Related Items (5)

\(L(2, 1)\)-labeling of the Cartesian and strong product of two directed cycles ⋮ The reliability analysis of \(k\)-ary \(n\)-cube networks ⋮ On the reliability of alternating group graph-based networks ⋮ Estimating the subsystem reliability of bubblesort networks ⋮ Strong matching preclusion for two-dimensional torus networks

Cites Work

• Unnamed Item
• Probabilistic analysis on mesh network fault tolerance
• Fault-tolerant wormhole routing in mesh with overlapped solid fault regions
• Dynamically Restructurable Fault-Tolerant Processor Network Architectures
• A Fault-Tolerant Communication Architecture for Distributed Systems
• Locally subcube-connected hypercube networks: theoretical analysis and experimental results
• Practical Deadlock-Free Fault-Tolerant Routing in Meshes Based on the Planar Network Fault Model
• Routing complexity of faulty networks
• Probability Inequalities

This page was built for publication: Upper bounds on the connection probability for 2-D meshes and tori