Permutations on the block PRAM

DOI10.1016/0020-0190(93)90218-XMaRDI QIDQ1209324zbMATH OpenFDO

Authors Andrew Chin

Publication date 16 May 1993

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(93)90218-X

zbMATH Keywords

block PRAM complexitycommunication latencyparallel computational complexityparallel computerspermutation routingshared-memory

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Distributed algorithms (68W15)

Recommendations

• PRAM's towards realistic parallelism: BRAM's
• Virtual shared memory: Algorithms and complexity
• scientific article; zbMATH DE number 4064477
• The Complexity of Parallel Sorting
• PRAMs with variable word-size

Cites work

• An optimal routing algorithm for mesh-connected Parallel computers
• Locality-preserving hash functions for general purpose parallel computation
• Parallel Permutations of Data: A Benes Network Control Algorithm for Frequently Used Permutations
• Parallel Processing with the Perfect Shuffle
• Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
• The Indirect Binary n-Cube Microprocessor Array

Cited in

(5)

• Locality-preserving hash functions for general purpose parallel computation
• Block patterns in Stirling permutations
• Permutations with ascending and descending blocks
• Stacking Blocks and Counting Permutations
• Permuting streaming data using RAMs

This page was built for publication: Permutations on the block PRAM

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1209324)