Distributed-Memory Parallel Algorithms for Matching and Coloring

Authors:
Umit V. Catalyurek;Florin Dobrian;Assefaw Gebremedhin;Mahantesh Halappanavar;Alex Pothen
Affiliations:
-;-;-;-;-
Venue:
IPDPSW '11 Proceedings of the 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and PhD Forum
Year:
2011

Citing 0
Cited 3

A multithreaded algorithm for network alignment via approximate matching

SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
An auction-based weighted matching implementation on massively parallel architectures

Parallel Computing
The Zoltan and Isorropia parallel toolkits for combinatorial scientific computing: Partitioning, ordering and coloring

Scientific Programming - A New Overview of the Trilinos Project --Part 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

We discuss the design and implementation of new highly-scalable distributed-memory parallel algorithms for two prototypical graph problems, edge-weighted matching and distance-1 vertex coloring. Graph algorithms in general have low concurrency, poor data locality, and high ratio of data access to computation costs, making it challenging to achieve scalability on massively parallel machines. We overcome this challenge by employing a variety of techniques, including speculation and iteration, optimized communication, and randomization. We present preliminary results on weak and strong scalability studies conducted on an IBM Blue Gene/P machine employing up to tens of thousands of processors. The results show that the algorithms hold strong potential for computing at petascale.