Lower bounds on the connectivity probability for 2-D mesh networks

Authors:
Meilian Liang;Jiarong Liang;Guoning Liang;Xiaodong Xu
Affiliations:
School of Mathematics and Information Science, Guangxi University, Nanning, P.R. China;School of Computer, Electronics and Information, Guangxi University, Nanning, P.R. China;Joint Lab of Next-Generation Internet Interactive Computing, Shanghai University, Shanghai, P.R. China;Guangxi Academy of Sciences, Nanning, P.R. China
Venue:
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Year:
2009

Citing 12
Cited 1

Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
The Stanford Dash Multiprocessor

Computer
Computational science experiences on the Intel touchstone DELTA supercomputer

COMPCON '92 Proceedings of the thirty-seventh international conference on COMPCON
The MIT Alewife machine: architecture and performance

ISCA '95 Proceedings of the 22nd annual international symposium on Computer architecture
The Tera computer system

ICS '90 Proceedings of the 4th international conference on Supercomputing
Fault-Tolerant Communication Algorithms in Toroidal Networks

IEEE Transactions on Parallel and Distributed Systems
A Fault-Tolerant Routing Scheme for Meshes with Nonconvex Faults

IEEE Transactions on Parallel and Distributed Systems
A Fast and Efficient Processor Allocation Scheme for Mesh-Connected Multicomputers

IEEE Transactions on Computers
Fault-Tolerant Wormhole Routing Algorithms for Mesh Networks

IEEE Transactions on Computers
The Dataparallel Computer MasPar MP - 1

Supercomputer '91 Anwendungen, Architekturen, Trends, Seminar
Blue Gene: a vision for protein science using a petaflop supercomputer

IBM Systems Journal - Deep computing for the life sciences
Probabilistic analysis on mesh network fault tolerance

Journal of Parallel and Distributed Computing

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

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Mesh networks are among the most important and popular interconnection network topologies for large parallel computer systems. New analysis techniques to get better lower bounds on the connectivity probability for mesh networks are developed, by which the known lower bounds on the connectivity probability for 2-D mesh networks have been improved significantly.