Finding strongly connected components in parallel in particle transport sweeps

W. McLendon, B. Hendrickson, S. Plimpton, L. Rauchwerger

Research output: Contribution to conferencePaperpeer-review

Abstract

Discrete ordinates methods are commonly used to simulate radiation transport for fire or weapons modeling. The computation proceeds by sweeping the flux across a grid. A particular cell cannot be computed until all the cells immediately upwind of it are finished. If the directed dependence graph for the grid cells contains a cycle then sweeping methods will deadlock. This can happen in unstructured grids and time stepped problems where the grid is allowed to deform. In this paper we present a parallel algorithm to detect cycles in the dependence graphs present in these grids as well as an implementation and experimental results on shared and distributed memory machines.

Original languageEnglish (US)
Pages328-329
Number of pages2
StatePublished - Jan 1 2001
Externally publishedYes
Event13th Annual Symposium on Parallel Algorithms and Architectures (SPAA 2001) - Crete Island, Greece
Duration: Jul 3 2001Jul 6 2001

Conference

Conference13th Annual Symposium on Parallel Algorithms and Architectures (SPAA 2001)
Country/TerritoryGreece
CityCrete Island
Period7/3/017/6/01

ASJC Scopus subject areas

  • Software
  • Safety, Risk, Reliability and Quality

Fingerprint

Dive into the research topics of 'Finding strongly connected components in parallel in particle transport sweeps'. Together they form a unique fingerprint.

Cite this