An optimal time bound for oblivious routing
From MaRDI portal
Publication:908701
DOI10.1007/BF01840387zbMath0693.68028MaRDI QIDQ908701
Publication date: 1990
Published in: Algorithmica (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
68P10: Searching and sorting
68N99: Theory of software
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- On recurrent and recursive interconnection patterns
- Routing, merging, and sorting on parallel models of computation
- Some practical simulations of impractical parallel computers
- Parallel permutation and sorting algorithms and a new generalized connection network
- A universal interconnection pattern for parallel computers
- Interconnections Between Processors and Memory Modules Using the Shuffle-Exchange Network
- Parallel Processing with the Perfect Shuffle