Robust algorithms for packet routing in a mesh
- 1 January 1995
- journal article
- research article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 28 (1) , 1-11
- https://doi.org/10.1007/bf01294592
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Asymptotically tight bounds for computing with faulty arrays of processorsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Fast Computation Using Faulty HypercubesPublished by Defense Technical Information Center (DTIC) ,1989
- An O(logN) deterministic packet routing schemePublished by Association for Computing Machinery (ACM) ,1989
- Expanders might be practical: fast algorithms for routing around faults on multibutterfliesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Reconfiguring a hypercube in the presence of faultsPublished by Association for Computing Machinery (ACM) ,1987
- Universal schemes for parallel communicationPublished by Association for Computing Machinery (ACM) ,1981
- Sorting on a mesh-connected parallel computerCommunications of the ACM, 1977
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of ObservationsThe Annals of Mathematical Statistics, 1952