An optimal time bound for oblivious routing

DOI10.1007/BF01840387zbMath0693.68028MaRDI QIDQ908701

Ian Parberry

Publication date: 1990

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

parallel machinesoblivious routingnetwork of processorsshuffle-exchange

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Theory of software (68N99)

Related Items

Tight bounds for oblivious routing in the hypercube

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