A MIMD implementation of a parallel Euler solver for unstructured grids

DOI10.1007/BF00129774zbMath1187.65159MaRDI QIDQ973415

B. E. Eshmatov

Publication date: 31 May 2010

Published in: The Journal of Supercomputing (Search for Journal in Brave)

zbMATH Keywords

Euler equationsUnstructured gridsMIMD computerspartitioning of grids

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Parallel numerical computation (65Y05) Numerical algorithms for specific classes of architectures (65Y10) Finite volume methods for initial value and initial-boundary value problems involving PDEs (65M08)

Related Items (5)

A computational study of graph partitioning ⋮ EVALUATION OF AUTOMATIC DOMAIN PARTITIONING ALGORITHMS FOR PARALLEL FINITE ELEMENT ANALYSIS ⋮ An efficient communications strategy for finite element methods on the Connection Machine CM-5 system ⋮ Recursive spectral algorithms for automatic domain partitioning in parallel finite element analysis ⋮ A survey of graph laplacians

Cites Work

• Partitioning Sparse Matrices with Eigenvectors of Graphs
• Cost Trade-offs in Graph Embeddings, with Applications
• Efficient massively parallel Euler solver for two-dimensional unstructured grids
• An Efficient Heuristic Procedure for Partitioning Graphs
• Unnamed Item

This page was built for publication: A MIMD implementation of a parallel Euler solver for unstructured grids