Scalable heuristic algorithms for the parallel execution of data flow acyclic digraphs

Zeyao Mo*, Aiqing Zhang, Gabriel Wittum

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

4 Scopus citations

Abstract

Data flow acyclic directed graphs (digraphs) can be applied to accurately describe the data dependency for a wide range of grid-based scientific computing applications ranging from numerical algebra to realistic applications of radiation or neutron transport. The parallel computing of these applications is equivalent to the parallel execution of digraphs. This paper presents a framework of scalable heuristic algorithms for the parallel execution of digraphs. This framework consists of three components: the heuristic partitioning method of a digraph, the parallel sweeping algorithm for a partitioned digraph, and the heuristic strategy for vertex scheduling and vertex packing. Evaluation rules of heuristic algorithms are presented for better theoretical understanding and performance optimization. Parallel benchmarks for the multigroup neutron or radiation Sn transport using processors from 100 to 2048 on two massively parallel machines show that these heuristic algorithms scale well.

Original languageEnglish (US)
Pages (from-to)3626-3642
Number of pages17
JournalSIAM Journal on Scientific Computing
Volume31
Issue number5
DOIs
StatePublished - Dec 1 2009

Keywords

  • Acyclic digraph
  • Grid-based scientific computing
  • Parallel algorithm
  • Sn transport

ASJC Scopus subject areas

  • Computational Mathematics
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Scalable heuristic algorithms for the parallel execution of data flow acyclic digraphs'. Together they form a unique fingerprint.

Cite this