Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
A binary-constraint search algorithm for minimizing hardware during hardware/software partitioning
EURO-DAC '94 Proceedings of the conference on European design automation
Clustering for improved system-level functional partitioning
ISSS '95 Proceedings of the 8th international symposium on System synthesis
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Hardware/Software CO-Design: Principles and Practice
Hardware/Software CO-Design: Principles and Practice
Tabu Search
Hardware-Software partitioning and pipelined scheduling of transformative applications
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Hardware-Software Cosynthesis for Microcontrollers
IEEE Design & Test
Integer Programming for Partitioning in Software Oriented Codesign
FPL '95 Proceedings of the 5th International Workshop on Field-Programmable Logic and Applications
Hardware/Software Partitioning using Integer Programming
EDTC '96 Proceedings of the 1996 European conference on Design and Test
Preference-Driven Hierarchical Hardware/Software Partitioning
ICCD '99 Proceedings of the 1999 IEEE International Conference on Computer Design
Algorithmic aspects of hardware/software partitioning
ACM Transactions on Design Automation of Electronic Systems (TODAES)
MiBench: A free, commercially representative embedded benchmark suite
WWC '01 Proceedings of the Workload Characterization, 2001. WWC-4. 2001 IEEE International Workshop
A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints
Networks - Special Issue In Memory of Stefano Pallottino
Algorithmic aspects for power-efficient hardware/software partitioning
Mathematics and Computers in Simulation
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Hardware/software partitioning and pipelined scheduling on runtime reconfigurable FPGAs
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Low-complex dynamic programming algorithm for hardware/software partitioning
Information Processing Letters
Algorithmic Aspects of Hardware/Software Partitioning: 1D Search Algorithms
IEEE Transactions on Computers
An effective multilevel tabu search approach for balanced graph partitioning
Computers and Operations Research
Efficient heuristic algorithms for path-based hardware/software partitioning
Mathematical and Computer Modelling: An International Journal
| Hi-index | 0.00 |
Hardware/software (HW/SW) partitioning is a crucial step in HW/SW codesign that determines which components of the system are implemented on hardware and which ones on software. It has been proved that the HW/SW partitioning problem is NP-hard. In this paper, we present two approaches for HW/SW partitioning that aims to minimize the hardware cost while taking into account software and communication constraints. The first is a heuristic approach that treats the HW/SW partitioning problem as an extended 0---1 knapsack problem. In the second approach, tabu search is used to further improve the solution obtained from the proposed heuristic algorithm. Experimental results show that the proposed algorithms outperform a recently reported work by up to 28 %.