Routing, merging, and sorting on parallel models of computation
Journal of Computer and System Sciences
Fault tolerance of minimal path routings in a network
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
A new look at fault-tolerant network routing
Information and Computation
On fault tolerant routings in general networks
Information and Computation
Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
Efficient fault—tolerant routings in networks
Information and Computation
Algorithmics: theory & practice
Algorithmics: theory & practice
Algorithms for matrix transposition on Boolean N-cube configured ensemble architecture
SIAM Journal on Matrix Analysis and Applications
Efficient dispersal of information for security, load balancing, and fault tolerance
Journal of the ACM (JACM)
Randomized algorithms and pseudorandom numbers
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Performance of the Direct Binary n-Cube Network for Multiprocessors
IEEE Transactions on Computers
Load balancing, selection sorting on the hypercube
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Fast computation using faulty hypercubes
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
High performance communications in processor networks
ISCA '89 Proceedings of the 16th annual international symposium on Computer architecture
Optimum Broadcasting and Personalized Communication in Hypercubes
IEEE Transactions on Computers
A time-randomness trade-off for oblivious routing
SIAM Journal on Computing
Counterexample to a conjecture of Szymanski on hypercube routing
Information Processing Letters
Fast, Deterministic Routing, on Hypercubes, Using Small Buffers
IEEE Transactions on Computers
Adaptive Fault-Tolerant Routing in Hypercube Multicomputers
IEEE Transactions on Computers
Fast-fault-tolerant parallel communication and on-line maintenance using information dispersal
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
A unified approach to off-line permutation routing on parallel networks
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Deterministic sorting in nearly logarithmic time on the hypercube and related computers
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
On the power of randomization in online algorithms
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Hypercube algorithms: with applications to image processing and pattern recognition
Hypercube algorithms: with applications to image processing and pattern recognition
The efficiency of greedy routing in hypercubes and butterflies
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
General purpose parallel architectures
Handbook of theoretical computer science (vol. A)
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Load balancing and routing on the hypercube and related networks
Journal of Parallel and Distributed Computing
Sorting with Linear Speedup on a Pipelined Hypercube
IEEE Transactions on Computers
Packet routing and PRAM emulation on star graphs and leveled networks
Journal of Parallel and Distributed Computing
Randomized routing and sorting on fixed-connection networks
Journal of Algorithms
On fault-tolerant fixed routing in hypercubes
Information Processing Letters
Realization of an arbitrary permutation on a hypercube
Information Processing Letters
Methods and problems of communication in usual networks
Proceedings of the international workshop on Broadcasting and gossiping 1990
On the k-diameter of k-regular k-connected graphs
Discrete Mathematics
A d-move local permutation routing for the d-cube
Discrete Applied Mathematics
Journal of the ACM (JACM)
Complexity Results for Permuting Data and Other Computations on Parallel Processors
Journal of the ACM (JACM)
Parallel Sorting Algorithms
A Fault-Tolerant Communication Scheme for Hypercube Computers
IEEE Transactions on Computers
Manipulating General Vectors on Synchronous Binary N-Cube
IEEE Transactions on Computers
Depth-First Search Approach for Fault-Tolerant Routing in Hypercube Multicomputers
IEEE Transactions on Parallel and Distributed Systems
Adaptive and Oblivious Algorithms for D-Cube Permutation Routing
ISAAC '93 Proceedings of the 4th International Symposium on Algorithms and Computation
Improved Probabilistic Routing on Generalized Hypercubes
PARLE '94 Proceedings of the 6th International PARLE Conference on Parallel Architectures and Languages Europe
Universal schemes for parallel communication
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Parallel Algorithms to Set Up the Benes Permutation Network
IEEE Transactions on Computers
Optimal BPC Permutations on a Cube Connected SIMD Computer
IEEE Transactions on Computers
IEEE Transactions on Computers
Parallel Permutations of Data: A Benes Network Control Algorithm for Frequently Used Permutations
IEEE Transactions on Computers
Optimality of a Two-Phase Strategy for Routing in Interconnection Networks
IEEE Transactions on Computers
Access and Alignment of Data in an Array Processor
IEEE Transactions on Computers
Generalized Connection Networks for Parallel Processor Intercommunication
IEEE Transactions on Computers
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
A (fairly) simple circuit that (usually) sorts
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Sorting networks and their applications
AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference
| Hi-index | 0.00 |
We survey various aspects of packet routing, namely (partial) permutation, h-relation routing, routing to random destinations, dynamic routing, isotonic routing, fault tolerant routing, and related sorting results. We present theoretical results for general graphs and the hypercube topology, assuming both SIMD and MIMD communication models.