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.
Zielona Góra: Uniwersytet Zielonogórski
AMCS, volume 17, number 2 (2007) ; kliknij tutaj, żeby przejść
Biblioteka Uniwersytetu Zielonogórskiego
2024-04-02
2024-04-02
22
https://zbc.uz.zgora.pl/publication/88406
Nazwa wydania | Data |
---|---|
Evaluating the Kernighan-Lin heuristic for hardware/software partitioning | 2024-04-02 |
Mann, Zoltán Ádám Korbicz, Józef - red. Uciński, Dariusz - red.
Mann, Zoltán Ádám Szép, Tamás Korbicz, Józef - red. Uciński, Dariusz - red.