Abstract—This paper presents a discussion of methods to solve partitioning problems and advocates the use of multi-way partitioning algorithms. The paper gives an implementation of a multi-way partitioning algorithm based on partitioning without size constraint and iterative improvement. A top-down clustering technique is employed to deal with the local minima problems faced in common heuristics and a primal-dual approach is used to enhance the iterative improvement. The Fiduccia-Mattheyses (FM) algorithm has been taken as the core algorithm which has been subjected to iterations, clustering and primal-dual iterations. The algorithm has been implemented in a way that it gives netlist files for each partitioned block. These netlists can further be used to implement actual hardware or detailed analysis. The results obtained were compared to the results obtained from the traditional FM algorithm. The results show good improvements.

Index Terms—Benchmarks, Cells, Clustering, Hypergraph,Net, Netlist, Nodes, Pads, Partitioning, Primal-Dual.

Kulpreet S. Sikand and Sandeep S. Gill are with the Guru Nanak DevEngg. College, Ludhiana, Punjab, India (e-mail: kpsikand@gmail.com,ssg@gndec.ac.in).
R. Chandel and A. Chandel are with the NIT Hamirpur, Hamirpur, India(e-mail: rchandel@yahoo.com, ashwani@nithm.ac.in).

Cite: Kulpreet S. Sikand, Sandeep S. Gill, R. Chandel, and A. Chandel, "Implementation of Multi-Way Partitioning Algorithm," International Journal of Computer and Communication Engineering vol. 2, no. 1, pp. 28-32 , 2013.