By Topic

A distributed algorithm for k-way 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
$31 $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

1 Author(s)
Koranne, S. ; Electron. Design & Tools, Philips Res. Lab., Eindhoven, Netherlands

Graph partitioning is one of the most important problems in solving many large-scale scientific computations. It forms the basis of many wide ranging problems in VLSI CAD ranging from high-level applications like hardware-software partitioning on one hand, to physical design methods like min-cut, on the other. In this paper we describe a novel method of using distributed computing in the form of loosely coupled independent processors on a network to solve the k-way graph partitioning problem. We have implemented this system on a network of workstations using PVM (Parallel Virtual Machine). We have tested the method with benchmarks designs of the Partitioning '93 suite with encouraging results

Published in:

EUROMICRO Conference, 1999. Proceedings. 25th  (Volume:2 )

Date of Conference: