By Topic

Scalable libraries for graph partitioning

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
R. Bhargava ; Sch. of Comput. Sci., Syracuse Univ., NY, USA ; G. Fox ; Chao-Wei Ou ; S. Ranka
more authors

The key problem in efficiently executing irregular and unstructured data parallel applications is partitioning the data to minimize communication while balancing the load. Partitioning such applications can be posed as a graph-partitioning problem based on the computational graph. The partitioning problem is in the class of NP-complete problems; hence exact solutions are computationally intractable for large problems. However, good suboptimal solutions are sufficient for effective parallelization of a large class of these applications. We are currently developing a library of partitioners based on physical optimization and related methods. In this paper, we describe an outline of the different methods and current status of our library

Published in:

Scalable Parallel Libraries Conference, 1993., Proceedings of the

Date of Conference:

6-8 Oct 1993