Parallel detection and elimination of strongly connected components for radiation transport sweeps /
Discrete ordinate 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 f...
| Main Author: | |
|---|---|
| Format: | Thesis eBook |
| Language: | English |
| Published: |
[Place of publication not identified] :
[publisher not identified] ;
2001.
|
| Subjects: | |
| Online Access: | Link to OAKTrust copy |
| Summary: | Discrete ordinate 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. We describe a parallel algorithm to detect and break these cycles present in the directed dependence graphs of these grids as well as an implementation and experimental results on shared and distributed memory machines. |
|---|---|
| Item Description: | "Major subject: Computer Science". Vita. |
| Physical Description: | vii, 38 leaves : illustrations ; 28 cm. Also available online. Issued also on microfiche from Lange Micrographics. |
| Bibliography: | Includes bibliographical references (leaves 36-37). |