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...

Full description

Bibliographic Details

Published in:	2016 45th International Conference on Parallel Processing (ICPP) pp. 236 - 241
Main Authors:	LaSalle, Dominique, Karypis, George
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.08.2016
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!