Finding strongly connected components in parallel in particle transport sweeps

Authors:
William Mclendon, III;Bruce Hendrickson;Steve Plimpton;Lawrence Rauchwerger
Affiliations:
Deptartment of Computer Science, Texas A&M University, College Station, TX;Sandia National Labs, Albuquerque, NM;Sandia National Labs, Albuquerque, NM;Deptartment of Computer Science, Texas A&M University, College Station, TX
Venue:
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Year:
2001

Citing 4
Cited 2

Introduction to algorithms

Introduction to algorithms
Parallel algorithms for shared-memory machines

Handbook of theoretical computer science (vol. A)
On Identifying Strongly Connected Components in Parallel

IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Finding Strongly Connected Components in Parallel in Particle Transport Sweeps

Finding Strongly Connected Components in Parallel in Particle Transport Sweeps

ARMI: an adaptive, platform independent communication library

Proceedings of the ninth ACM SIGPLAN symposium on Principles and practice of parallel programming
Finding strongly connected components in parallel using O(log2n) reachability queries

Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures

Quantified Score

Hi-index	0.00

Visualization

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.