Randomized multipacket routing and sorting on meshes
From MaRDI portal
Publication:675295
DOI10.1007/BF02523190zbMath0865.68056OpenAlexW2043038847MaRDI QIDQ675295
Michael Kaufmann, Jop F. Sibeyn
Publication date: 30 June 1997
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02523190
Related Items (6)
Random permutations on distributed, external and hierarchical memory ⋮ Solving fundamental problems on sparse-meshes ⋮ Optimal multi-packet routing on the torus ⋮ Optimal gossiping in square 2D meshes ⋮ Faster deterministic sorting through better sampling. ⋮ Optimal permutation routing for low-dimensional hypercubes
Cites Work
- A guided tour of Chernoff bounds
- Optimal routing algorithms for mesh-connected processor arrays
- A \(2n-2\) step algorithm for routing in an \(n \times n\) array with constant-size queues
- An Efficient Implementation of Batcher's Odd-Even Merge Algorithm and Its Application in Parallel Sorting Schemes
- 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
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- Unnamed Item
- Unnamed Item
This page was built for publication: Randomized multipacket routing and sorting on meshes
