Randomized multipacket routing and sorting on meshes
From MaRDI portal
(Redirected from Publication:675295)
Recommendations
Cites work
- scientific article; zbMATH DE number 107951 (Why is no real title available?)
- scientific article; zbMATH DE number 1256694 (Why is no real title available?)
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- A \(2n-2\) step algorithm for routing in an \(n \times n\) array with constant-size queues
- A guided tour of Chernoff bounds
- An Efficient Implementation of Batcher's Odd-Even Merge Algorithm and Its Application in Parallel Sorting Schemes
- Optimal routing algorithms for mesh-connected processor arrays
- Probabilistic Parallel Algorithms for Sorting and Selection
- Sorting on a mesh-connected parallel computer
- k-k Routing, k-k Sorting, and Cut-Through Routing on the Mesh
Cited in
(15)- scientific article; zbMATH DE number 1419213 (Why is no real title available?)
- Solving fundamental problems on sparse-meshes
- Faster deterministic sorting through better sampling.
- Flit-serial packet routing on meshes and tori
- Optimal multi-packet routing on the torus
- Deterministic Permutation Routing on Meshes
- Random permutations on distributed, external and hierarchical memory
- scientific article; zbMATH DE number 1559567 (Why is no real title available?)
- Mesh connected computers with fixed and reconfigurable buses: packet routing and sorting
- Optimal permutation routing for low-dimensional hypercubes
- scientific article; zbMATH DE number 1222837 (Why is no real title available?)
- PERMUTATION ROUTING AND SORTING ON THE RECONFIGURABLE MESH
- k-k Routing, k-k Sorting, and Cut-Through Routing on the Mesh
- Optimal deterministic sorting and routing on grids and tori with diagonals
- Optimal gossiping in square 2D meshes
This page was built for publication: Randomized multipacket routing and sorting on meshes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q675295)
