Packet Routing in Fixed-Connection Networks: A Survey
- 1 November 1998
- journal article
- review article
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 54 (2) , 77-132
- https://doi.org/10.1006/jpdc.1998.1483
Abstract
No abstract availableKeywords
This publication has 264 references indexed in Scilit:
- Flit-serial packet routing on meshes and toriTheory of Computing Systems, 1996
- Robust algorithms for packet routing in a meshTheory of Computing Systems, 1995
- Realization of an arbitrary permutation on a hypercubeInformation Processing Letters, 1994
- A lower bound for sorting networks based on the shuffle permutationTheory of Computing Systems, 1994
- On fault-tolerant fixed routing in hybercubesInformation Processing Letters, 1994
- Packet routing and job-shop scheduling inO(congestion+dilation) stepsCombinatorica, 1994
- On the power of randomization in on-line algorithmsAlgorithmica, 1994
- Deterministic sorting in nearly logarithmic time on the hypercube and related computersJournal of Computer and System Sciences, 1993
- How to emulate shared memoryJournal of Computer and System Sciences, 1991
- Counterexample to a conjecture of szymanski on hypercube routingInformation Processing Letters, 1990