A Scalability and Sensitivity Study of Parallel Geometric Algorithms for Graph Partitioning

Graph partitioning arises in many computational simulation workloads, including those that involve finite difference or finite element methods, where partitioning enables efficient parallel processing of the entire simulation. We focus on parallel geometric algorithms for partitioning large graphs w...

Celý popis

Podrobná bibliografia

Vydané v:	2018 30th International Symposium on Computer Architecture and High Performance Computing (SBAC PAD) s. 420 - 427
Hlavní autori:	Kirmani, Shad, Sun, Hongyang, Raghavan, Padma
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.09.2018
Predmet:	Computational modeling Force geometric mesh partitioning graph embedding Particle separators Partitioning algorithms Perturbation methods Program processors Recursive coordinate bisection Scalability
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!