Paper Info

Title | ||
---|---|---|

Finding strongly connected components in parallel in particle transport sweeps |

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. |

Year | DOI | Venue |
---|---|---|

2001 | 10.1145/378580.378751 | SPAA |

Keywords | Field | DocType |

computation proceed,parallel algorithm,discrete ordinates method,grid cell,sweeping method,memory machine,unstructured grid,particle transport sweep,dependence graph,connected components,particular cell,particle transport sweeps,strongly connected component | Ordinate,Computer science,Parallel algorithm,Parallel computing,Deadlock,Distributed memory,Flux,Strongly connected component,Grid,Distributed computing,Computation | Conference |

ISBN | Citations | PageRank |

1-58113-409-6 | 5 | 0.59 |

References | Authors | |

8 | 4 |

Authors (4 rows)

Cited by (5 rows)

References (8 rows)

Name | Order | Citations | PageRank |
---|---|---|---|

William McLendon, III | 1 | 5 | 0.92 |

Bruce Hendrickson | 2 | 1669 | 214.08 |

Steve Plimpton | 3 | 160 | 37.89 |

Lawrence Rauchwerger | 4 | 1458 | 101.57 |