Title: Recent algorithmic and software improvements for partitioning and ordering

Speaker: Cedric Chevalier, CSRI Post Doctoral Researcher Seminar, Sandia National Laboratories,
Scalable Algorithms Department

Date/Time: February 9, 2010, 10:00 am - 11:00 am         

Location: CSRI/90

Brief Abstract: Partitioning is used to distribute data for parallel computations. Graph or hypergraph partitioning are NP-Hard problems which are usually solved by using heuristics. Most of the best tools available use a multi-level algorithm, but all of them use a strict aggregation scheme (the most popular being Heavy Edge Matching). With Ilya Safro (ANL, CSCAPES institute), we have shown that a weighted aggregation scheme (kind of techniques used in multi-grid solvers) can produce better results and may be also more scalable.

I will also present some of my work about the software development of Zoltan and Isorropia like the support of Scotch software, the new ordering interface for advanced users or the work in progress to implement HUND, a new unsymmetric sparse matrix ordering algorithm.

CSRI POC: Scott Collis, (505) 284-1123