Communication-efficient parallel algorithms for distributed random-access machines

DOI10.1007/BF01762110MaRDI QIDQ1104096zbMATH OpenFDO

Authors Charles E. Leiserson, Bruce M. Maggs

Publication date 1988

Published in Algorithmica (Search for Journal in Brave)

zbMATH Keywords

parallel algorithmsPRAMconservative algorithmdistributed random-access machinefat-treesload factormodel for parallel computationtree-contractiontreefix computationvolume-universal networks

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Publication:4942231
• Efficient Schemes for Parallel Communication
• scientific article; zbMATH DE number 1333604
• Parallel-algorithm communication operations generated by uniform dependences
• Parallel Talbot's algorithm for distributed memory machines
• Parallelization of sequential programs: distribution of arrays among processors and structurization of communications
• Algorithms for the parallel alternating direction access machine

Cites work

• scientific article; zbMATH DE number 3936534 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3628373 (Why is no real title available?)
• scientific article; zbMATH DE number 3214539 (Why is no real title available?)
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• A Regular Layout for Parallel Adders
• A Scheme for Fast Parallel Communication
• A Separator Theorem for Planar Graphs
• An O(logn) parallel connectivity algorithm
• Parallel Prefix Computation
• The Parallel Evaluation of General Arithmetic Expressions
• Three-Dimensional Circuit Layouts

Cited in

(15)

• Performance analysis of wormhole routed \(k\)-ary \(n\)-trees
• The power of multimedia: Combining point-to-point and multi-access networks
• Methods for message routing in parallel machines
• More general parallel tree contraction: register allocation and broadcasting in a tree
• Communication complexity of PRAMs
• Parallel algorithms for tree accumulations
• COMMUNICATION BALANCING IN THE PARALLEL GÖTTFERT ALGORITHM
• Data independence of read, write, and control structures in PRAM computations
• Improving multicut in directed trees by upgrading nodes
• Efficient delay routing
• Randomized parallel communications on an extension of the omega network
• UNIVERSAL ROUTING AND PERFORMANCE ASSURANCE FOR DISTRIBUTED NETWORKS
• scientific article; zbMATH DE number 4035123 (Why is no real title available?)
• Parallelism in random access machines
• A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs)

This page was built for publication: Communication-efficient parallel algorithms for distributed random-access machines

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