Two-stage m-way graph partitioning

doi:10.1016/0167-8191(93)90081-U

Parallel Computing

Volume 19, Issue 12, December 1993, Pages 1359-1373

https://doi.org/10.1016/0167-8191(93)90081-U Get rights and content

Abstract

This paper presents a group of multiple-way graph (with weighted nodes and edges) partitioning algorithms based on a 2-stage constructive-and-refinement mechanism. The graph partitions can be used to control allocation of program units to distributed processors in a way that minimizes the completion time and for design automation applications. In the constructive stage, 4 clustering algorithms are used to construct raw partitions, the second refinement step first adjusts the cluster number to the processor number and then iteratively improves the partitioning cost by employing a Kernighan-Lin based heuristic. This approach represents several extensions to the state-of-the-art methods. A performance comparison of the proposed algorithms is given, based on experiment results.

References (40)

I.G Angus et al.
J Baxter et al.
The LAST algorithm: A heuristic-based static task allocation algorithm
E.R Barnes
An algorithm for partitioning the nodes of a graph
SIAM J. Algeb. Discr. Math.
(Dec. 1982)
E.R Barnes et al.
A new heuristic for partitioning the nodes of a graph
SIAM J. Discrete Math.
(1988)
T Bui et al.
Graph bisection algorithms with good average case behavior
T Bui et al.
Improving the performance of the Kernighan-Lin and simulated annealing graph bisection algorithms
R.B Boppana
Eigenvalues and graph bisection: An average case analysis
S.H Bokhari
Assignment Problems in Parallel and Distributed Computing
(1987)
K.M Doty et al.
Task allocation in a distributed computer system
J.G Donnett et al.
Effective algorithms for partitioning distributed programs

K Efe

Heuristic models of task assignment scheduling in distributed systems

IEEE Comput.

(June 1982)

C.M Fiduccia et al.

A linear time heuristic for improving network partitions

M.R Garey et al.

Some simplified NP-complete graph problems

Theoret. Comput. Sci.

(1976)

J Garbers et al.

Finding clusters in VLSI circuits

M.K Goldberg et al.

Heuristic improvement technique for bisection of VLSI networks

V.B Gylys et al.

Optimal partitioning of workload for distributed systems

D.S Johnson et al.

Optimization by simulated annealing: An experimental evaluation (part I)

(1985)

B.W Kernighan et al.

An efficient heuristic procedure for partitioning graphs

Bell Syst. Tech. J.

(1970)

B Krishnamurthy

An improved min-cut algorithm for partitioning VLSI networks

IEEE Trans. Comput.

(1984)

B Kruatrachue et al.

Grain size determination for parallel processing

IEEE Software

(Jan. 1988)

Cited by (2)

The internet of things in the cloud: A middleware perspective
2012, The Internet of Things in the Cloud: A Middleware Perspective
An effective approach for distributed program allocation
1994, Parallel Algorithms and Applications

View full text

PaperTwo-stage m-way graph partitioning

Abstract

The LAST algorithm: A heuristic-based static task allocation algorithm

An algorithm for partitioning the nodes of a graph

SIAM J. Algeb. Discr. Math.

A new heuristic for partitioning the nodes of a graph

SIAM J. Discrete Math.

Graph bisection algorithms with good average case behavior

Improving the performance of the Kernighan-Lin and simulated annealing graph bisection algorithms

Eigenvalues and graph bisection: An average case analysis

Assignment Problems in Parallel and Distributed Computing

Task allocation in a distributed computer system

Effective algorithms for partitioning distributed programs