On the mapping of massively parallel processors onto finite element graphs
From MaRDI portal
Publication:3495946
DOI10.1016/0045-7949(89)90046-1zbMath0711.73225MaRDI QIDQ3495946
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
heuristics; MIMD machines; SIMD computers; mapping adjacent generalized elements; matching two graphs; onto directly connected processors
68R10: Graph theory (including graph drawing) in computer science
74S05: Finite element methods applied to problems in solid mechanics
68W15: Distributed algorithms
74-04: Software, source code, etc. for problems pertaining to mechanics of deformable solids
Related Items
Mesh partitioning algorithms for the parallel solution of partial differential equations, 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