On the mapping of massively parallel processors onto finite element graphs

DOI10.1016/0045-7949(89)90046-1MaRDI QIDQ3495946zbMATH OpenOpenAlexFDO

Authors C. Farhat

Publication date 1989

Published in Computers & Structures (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0045-7949(89)90046-1

zbMATH Keywords

heuristicsmapping adjacent generalized elementsmatching two graphsMIMD machinesonto directly connected processorsSIMD computers

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15) Software, source code, etc. for problems pertaining to mechanics of deformable solids (74-04) Finite element methods applied to problems in solid mechanics (74S05)

Recommendations

• DYNAMIC FINITE ELEMENT SIMULATIONS ON THE CONNECTION MACHINE
• Mapping finite element graphs on hypercubes
• A Set of New Mapping and Coloring Heuristics for Distributed-Memory Parallel Processors
• Partitioning graphs on message-passing machines by pairwise mincut
• scientific article; zbMATH DE number 279005

Cited in

(11)

• Computation of incompressible flows with implicit finite element implementations on the Connection Machine
• Two-dimensional viscous flow computations on the Connection Machine: Unstructured meshes, upwind schemes and massively parallel computations
• An efficient communications strategy for finite element methods on the Connection Machine CM-5 system
• WorkStream -- A Design Pattern for Multicore-Enabled Finite Element Computations
• DYNAMIC FINITE ELEMENT SIMULATIONS ON THE CONNECTION MACHINE
• A Set of New Mapping and Coloring Heuristics for Distributed-Memory Parallel Processors
• The Torus-Wrap Mapping for Dense Matrix Calculations on Massively Parallel Computers
• Eigenanalysis-based task mapping on parallel computers with cellular networks
• Improved schemes for mapping arbitrary algorithms onto processor meshes
• Mesh partitioning algorithms for the parallel solution of partial differential equations
• Mapping finite element graphs on hypercubes

This page was built for publication: On the mapping of massively parallel processors onto finite element graphs

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