Graph Partitioning for High Performance Scientific Simulations
2000-03-14
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
Graph Partitioning for High Performance Scientific Simulations
Published Date
2000-03-14
Publisher
Type
Report
Abstract
Algorithms that find good partitionings of unstructured and irregular graphs are critical for the efficient execution of scientific simulations on high performance parallel computers. This paper presents an overview of graph partitioning algorithms. Recent developments in graph partitioning for adaptive and dynamic simulations, as well as partitioning algorithms for sophisticated simulations such as multi-phase, multi-physics, and multi-mesh computations are also discussed.
Keywords
Description
Related to
Replaces
License
Series/Report Number
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Suggested citation
Schloegel, Kirk; Karypis, George; Kumar, Vipin. (2000). Graph Partitioning for High Performance Scientific Simulations. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/215407.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.