Parallel algorithms for dynamically partitioning unstructured grids
Conference
·
OSTI ID:10189870
- University of California, Santa Barbara (United States). Dept. of Computer Science
- Sandia National Labs., Albuquerque, NM (United States)
Grid partitioning is the method of choice for decomposing a wide variety of computational problems into naturally parallel pieces. In problems where computational load on the grid or the grid itself changes as the simulation progresses, the ability to repartition dynamically and in parallel is attractive for achieving higher performance. We describe three algorithms suitable for parallel dynamic load-balancing which attempt to partition unstructured grids so that computational load is balanced and communication is minimized. The execution time of algorithms and the quality of the partitions they generate are compared to results from serial partitioners for two large grids. The integration of the algorithms into a parallel particle simulation is also briefly discussed.
- Research Organization:
- Sandia National Labs., Albuquerque, NM (United States)
- Sponsoring Organization:
- USDOE, Washington, DC (United States)
- DOE Contract Number:
- AC04-94AL85000
- OSTI ID:
- 10189870
- Report Number(s):
- SAND--94-2444C; CONF-950212--2; ON: DE95001616; BR: GB0103012
- Country of Publication:
- United States
- Language:
- English
Similar Records
Automated partitioning of simulations for parallel execution
Parallel unstructured mesh generation
Applying graph partitioning methods in measurement-based dynamic load balancing
Thesis/Dissertation
·
Mon Dec 31 23:00:00 EST 1984
·
OSTI ID:6891505
Parallel unstructured mesh generation
Conference
·
Mon Dec 30 23:00:00 EST 1996
·
OSTI ID:416594
Applying graph partitioning methods in measurement-based dynamic load balancing
Technical Report
·
Mon Sep 26 00:00:00 EDT 2011
·
OSTI ID:1114706