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.
Similar content being viewed by others
References
H. Chernoff. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations.Ann. of Math. Statist., 23:493–509, 1952.
J. Hastad, F. T. Leighton, and M. Newman. Reconfiguring a hypercube in the presence of faults.Proc. 19th Annual Symposium on Theory of Computing, pages 274–294, 1987.
J. Hastad, F. T. Leighton, and M. Newman. Fast computation using faulty hypercubes.Proc. 21st Annual Symposium on Theory of Computing, pages 251–263, 1989.
C. Kaklamanis, A. R. Karlin, F. T. Leighton, V. Milenkovic, P. Raghavan, S. Rao, C. D. Thomborson, and A. Tsantilas. Asymptotically tight bounds for computing with faulty arrays of processors.Proc. 31st Annual Symposium on Foundations of Computer Science, pages 285–296, 1990.
F. T. Leighton and C. E. Leiserson, A survey of algorithms for integrating wafer-scale systolic arrays. InWafer Scale Integration, pages 177–195. Elsevier, Amsterdam, 1986.
F. T. Leighton and B. Maggs. Expanders might be practical: Fast algorithms for routing around faults in multibutterflies.Proc. 30th Annual Symposium on Foundations of Computer Science, pages 384–389, 1989.
C. D. Thompson and H. T. Kung. Sorting on a mesh-connected parallel computer.Comm. ACM, 20:263–271, 1977.
E. Upfal. AnO(logN) deterministic packet routing scheme.Proc. 21st ACM Annual Symposium on Theory of Computing, pages 241–250, 1989.
L. G. Valiant and G. J. Brebner. Universal schemes for parallel communication.Proc. 13th Annual ACM Symposium on Theory of Computing, pages 263–277, 1981.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Raghavan, P. Robust algorithms for packet routing in a mesh. Math. Systems Theory 28, 1–11 (1995). https://doi.org/10.1007/BF01294592
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF01294592