Have a personal or library account? Click to login
Evaluating the Kernighan-Lin Heuristic for Hardware/Software Partitioning Cover

Evaluating the Kernighan-Lin Heuristic for Hardware/Software Partitioning

Open Access
|Jul 2007

Abstract

In recent years, several heuristics have been proposed for the hardware/software partitioning problem. One of the most promising directions is the adaptation of the Kernighan-Lin algorithm. The Kernighan-Lin heuristic was originally developed for circuit partitioning, but it has been adapted to other domains as well. Moreover, numerous improvements have been suggested so that now several variants of the original algorithm exist. The aim of this paper is to systematically evaluate the possibilities of applying the Kernighan-Lin heuristic to hardware/software partitioning. It is investigated in detail which versions of the heuristic work well in this context. Since hardware/software partitioning also has several formulations, it is also discussed how the problem formulation affects the applicability of this heuristic. Furthermore, possibilities of efficient implementations of the algorithm—by using appropriate data structures—are also presented. These investigations are accompanied by numerous empirical test results.

DOI: https://doi.org/10.2478/v10006-007-0022-3 | Journal eISSN: 2083-8492 | Journal ISSN: 1641-876X
Language: English
Page range: 249 - 267
Published on: Jul 17, 2007
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year

© 2007 Zoltán Mann, András Orbán, Viktor Farkas, published by University of Zielona Góra
This work is licensed under the Creative Commons License.

Volume 17 (2007): Issue 2 (June 2007)