Towards a parallel framework of grid-based numerical algorithms on DAGs

Authors:
Zeyao Mo;Aiqing Zhang;Xiaolin Cao
Affiliations:
Institute of Applied Physics and Computational Mathematics, Beijing;Institute of Applied Physics and Computational Mathematics, Beijing;Institute of Applied Physics and Computational Mathematics, Beijing
Venue:
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Year:
2006

Citing 12
Cited 0

Data flow graph partitioning to reduce communication cost

MICRO 19 Proceedings of the 19th annual workshop on Microprogramming
A bridging model for parallel computation

Communications of the ACM
Downwind numbering: robust multigrid for convection—diffusion problems

Applied Numerical Mathematics - Special issue on multilevel methods
On the feedback vertex set problem for a planar graph

Computing
Using MPI (2nd ed.): portable parallel programming with the message-passing interface

Using MPI (2nd ed.): portable parallel programming with the message-passing interface
A Crosswind Block Iterative Method for Convection-Dominated Problems

SIAM Journal on Scientific Computing
Parallel algorithms for radiation transport on unstructured grids

Proceedings of the 2000 ACM/IEEE conference on Supercomputing
Numerical Modeling in Applied Physics and Astrophysics

Numerical Modeling in Applied Physics and Astrophysics
Sourcebook of parallel computing

Sourcebook of parallel computing
Graph partitioning for high-performance scientific simulations

Sourcebook of parallel computing
Parallel Flux Sweep Algorithm for Neutron Transport on Unstructured Grid

The Journal of Supercomputing
Concatenation algorithms for parallel numerical simulation of radiation hydrodynamics coupled with neutron transport

International Journal of Parallel Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a parallel framework of grid-based numerical algorithms where data dependencies between grid zones can be modeled by a directed acyclic graph (DAG). It consists of three parts on how to partition, order and calculate the vertices of digraph. Numerical results using hundreds of processors on two parallel machines show the efficiencies and moderate scalability of this framework.