Finding strongly connected components in parallel in particle transport sweeps Conference Paper uri icon

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.

name of conference

  • Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures

published proceedings

  • Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures

author list (cited authors)

  • Mclendon, W., Hendrickson, B., Plimpton, S., & Rauchwerger, L.

citation count

  • 7

complete list of authors

  • Mclendon, William||Hendrickson, Bruce||Plimpton, Steve||Rauchwerger, Lawrence

editor list (cited editors)

  • Rosenberg, A. L.

publication date

  • January 2001