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

DOI10.1016/J.JPDC.2011.11.006MaRDI QIDQ433405zbMATH OpenOpenAlexFDO

Authors Meilian Liang, Xiaodong Xu, Jiarong Liang, 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

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

Recommendations

• The random connection model on the torus
• On simple connectivity of random 2-complexes
• Strong rainbow connection numbers of toroidal meshes
• On the \((l, 2n)\)-domination number of the \(n\)-dimensional undirected toroidal mesh
• On the probability of connectedness
• Homological connectivity of random 2-complexes
• Total and paired domination numbers of toroidal meshes
• Bounds on probability of connectedness of a random graph
• Lower bounds on the connectivity function in all directions for Bernoulli percolation in two and three dimensions

Cites work

• scientific article; zbMATH DE number 2117879 (Why is no real title available?)
• A Fault-Tolerant Communication Architecture for Distributed Systems
• Dynamically Restructurable Fault-Tolerant Processor Network Architectures
• Fault-tolerant wormhole routing in mesh with overlapped solid fault regions
• 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
• Probabilistic analysis on mesh network fault tolerance
• Probability inequalities.

Cited in

(7)

• \(L(2, 1)\)-labeling of the Cartesian and strong product of two directed cycles
• Probabilistic analysis on mesh network fault tolerance
• scientific article; zbMATH DE number 1839577 (Why is no real title available?)
• Strong matching preclusion for two-dimensional torus networks
• On the reliability of alternating group graph-based networks
• Estimating the subsystem reliability of bubblesort networks
• The reliability analysis of \(k\)-ary \(n\)-cube networks

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

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