Skip to main content

University of Minnesota / Driven to DiscoverUniversity of Minnesota

Libraries

View Item 
Graph Partitioning for High Performance Scientific Simulations
Schloegel, Kirk; Karypis, George; Kumar, Vipin (2000)
Thumbnail
View/Download file
Persistent link to this item
http://hdl.handle.net/11299/215407
Services
Title
Graph Partitioning for High Performance Scientific Simulations
Authors
Issue Date
2000-03-14
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.
Appears in collections
Computer Science & Engineering (CS&E) Technical Reports [747]
Series/Report Number
Technical Report; 00-018
Suggested Citation
Schloegel, Kirk; Karypis, George; Kumar, Vipin. (2000). Graph Partitioning for High Performance Scientific Simulations. Retrieved from the University of Minnesota Digital Conservancy, http://hdl.handle.net/11299/215407.
Content distributed via the University of Minnesota's Digital Conservancy may be subject to additional license and use restrictions applied by the depositor.