Communication-efficient parallel algorithms for distributed random-access machines
DOI10.1007/BF01762110zbMATH Open0646.68067MaRDI QIDQ1104096FDOQ1104096
Authors: Charles E. Leiserson, Bruce M. Maggs 
Publication date: 1988
Published in: Algorithmica (Search for Journal in Brave)
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
parallel algorithmsPRAMconservative algorithmdistributed random-access machinefat-treesload factormodel for parallel computationtree-contractiontreefix computationvolume-universal networks
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Separator Theorem for Planar Graphs
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- Parallel Prefix Computation
- The Parallel Evaluation of General Arithmetic Expressions
- A Regular Layout for Parallel Adders
- An O(logn) parallel connectivity algorithm
- A Scheme for Fast Parallel Communication
- Title not available (Why is that?)
- Three-Dimensional Circuit Layouts
- Title not available (Why is that?)
Cited In (15)
- Randomized parallel communications on an extension of the omega network
- UNIVERSAL ROUTING AND PERFORMANCE ASSURANCE FOR DISTRIBUTED NETWORKS
- COMMUNICATION BALANCING IN THE PARALLEL GÖTTFERT ALGORITHM
- The power of multimedia: Combining point-to-point and multi-access networks
- Parallelism in random access machines
- Parallel algorithms for tree accumulations
- Improving multicut in directed trees by upgrading nodes
- A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs)
- Title not available (Why is that?)
- Communication complexity of PRAMs
- Methods for message routing in parallel machines
- Performance analysis of wormhole routed \(k\)-ary \(n\)-trees
- Efficient delay routing
- More general parallel tree contraction: register allocation and broadcasting in a tree
- Data independence of read, write, and control structures in PRAM computations
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)
