Abstract
Hardware software partitioning is one of the most significant problem in embedded system design. The size of the total solution space for this problem is typically quite large. This problem has been investigated extensively. This paper is the first work to model the problem into a knapsack problem. We present a way to split the problem into standard 0-1 knapsack problems, so that most of the classical approaches for 0-1 knapsack problems can be directly applied. We use tight lower bound and tight upper bound on each of these knapsack problems to eliminate sub-problems, which are guaranteed not to give optimal results.
Chapter PDF
Similar content being viewed by others
References
Pisinger, D.: A minimal algorithm for the 0-1 knapsack problem. Operations Research, 758–767 (1997)
Pisinger, D.: Algorithms for knapsack problems, Ph.D. Thesis, pp. 1–200 (1995)
Ernst, R., Henkel, J., Benner, T.: Hardware-Software Cosynthesis for Microcontrollers. IEEE Design and Test of Computers, 64–75 (1993)
Vahid, F., Gajski, D.D., Jong, J.: A binary-constraint search algorithm for minimizing hardware during hardware/software partitioning. IEEE/ACM Proceedings European Conference on Design Automation(EuroDAC), 214–219 (1994)
Gupta, R.K., Micheli, G.D.: System-level synthesis using reprogrammable components. In: Proceedings. [3rd] European Conference on Design Automation, pp. 2–7 (1992)
Niemann, R., Marwedel, P.: Hardware/software partitioning using integer programming. In: Proceedings European Design and Test Conference, 1996. ED&TC 1996, pp. 473–479 (1996)
Chatha, K.S., Vemuri, R.: Hardware-software partitioning and pipelined scheduling of transformative applications. IEEE Transactions on Very Large Scale Integration (VLSI) Systems 10(3), 193–208 (2002)
Rakhmatov, D.N., Vrudhula, S.B.K.: Hardware-software bipartitioning for dynamically reconfigurable systems. In: Proceedings of the Tenth International Symposium on Hardware/Software Codesign, CODES 2002, pp. 145–150 (2002)
Henkel, J., Ernst, R.: An approach to automated hardware/software partitioning using a flexible granularity that is driven by high-level estimation technique. IEEE Transactions on Very Large Scale Integration (VLSI) Systems 9(2), 273–289 (2001)
Jigang, W., Yunfei, L., Schroeder, H.: A minimal reduction approach for the collapsing knapsack problem. Computing and Informatics 20, 359–369 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ray, A., Jigang, W., Thambipillai, S. (2004). Knapsack Model and Algorithm for HW/SW Partitioning Problem. In: Bubak, M., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds) Computational Science - ICCS 2004. ICCS 2004. Lecture Notes in Computer Science, vol 3036. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24685-5_25
Download citation
DOI: https://doi.org/10.1007/978-3-540-24685-5_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22114-2
Online ISBN: 978-3-540-24685-5
eBook Packages: Springer Book Archive