A Parallel Hill-Climbing Refinement Algorithm for Graph Partitioning

Graph partitioning is important in distributing workloads on parallel compute systems, computing sparse matrix re-orderings, and designing VLSI circuits. Refinement algorithms are used to improve existing partitionings, and are essential for obtaining high-quality partitionings. Existing parallel re...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	2016 45th International Conference on Parallel Processing (ICPP) S. 236 - 241
Hauptverfasser:	LaSalle, Dominique, Karypis, George
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	IEEE 01.08.2016
Schlagworte:	Algorithm design and analysis Approximation algorithms Clustering algorithms Frequency modulation Graph partitioning Joining processes local minima multithreading Parallel processing Partitioning algorithms
ISSN:	2332-5690
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!