Electronic Resource
Springer
Theory of computing systems
28 (1995), S. 1-11
ISSN:
1433-0490
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
Notes:
Abstract This paper considers the problem of permutation packet routing on a √n×√n mesh-connected array of processors. Each node in the array is assumed to be independently faulty with a probability bounded above by a valuep. This paper gives a routing algorithm which, ifp⩽ 0.29, will with very high probability route every packet that can be routed inO(√n logn) steps with queue lengths that areO(log2 n). Extensions to higher-dimensional meshes are given.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01294592
Permalink
Library |
Location |
Call Number |
Volume/Issue/Year |
Availability |