Permutations on the block PRAM
From MaRDI portal
Publication:1209324
DOI10.1016/0020-0190(93)90218-XzbMath0795.68091MaRDI QIDQ1209324
Publication date: 16 May 1993
Published in: Information Processing Letters (Search for Journal in Brave)
parallel computerspermutation routingshared-memoryparallel computational complexityblock PRAM complexitycommunication latency
Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Distributed algorithms (68W15)
Related Items (1)
Cites Work
- Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
- Locality-preserving hash functions for general purpose parallel computation
- An optimal routing algorithm for mesh-connected Parallel computers
- The Indirect Binary n-Cube Microprocessor Array
- Parallel Permutations of Data: A Benes Network Control Algorithm for Frequently Used Permutations
- Parallel Processing with the Perfect Shuffle
This page was built for publication: Permutations on the block PRAM
