Abstract
Power efficiency is one of the major considerations in the current hardware/software co-designs. This paper models hardware/ software partitioning as an optimization problem with the objective of minimizing power consumption. An efficient heuristic algorithm running in O(n log n) is proposed by extending the idea of solving the 0-1 knapsack problem. Also, an exact algorithm based on dynamic programming is proposed to produce the optimal solution in \(O(n.\mathcal{A}.\mathcal{E})\) for n code fragments under the constraints: hardware area \(\mathcal{A}\) and execution time \(\mathcal{E}\). Computational results show that the approximate solution produced by the proposed heuristic algorithm is nearly optimal in comparison to the optimal solution produced by the proposed exact algorithm.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Niemann, R., Marwedel, P.: Hardware/software partitioning using integer programming. In: Proc. of IEEE/ACM European Design Automation Conference (EDAC), pp. 473–479 (1996)
Ernst, R., Henkel, J., Benner, T.: Hardware-Software Co-synthesis for Micro-controllers. IEEE Design and Test of Computer 10(4), 64–75 (1993)
Quan, G., Hu, X., Greenwood, G.W.: Preference-driven hierarchical hardware/softwarepartitioning. In: Proc. of IEEE Int. conf. on Computer Design, pp. 652–657 (1999)
Srinivasan, V., Radhakrishnan, S., Vemuri, R.: Hardware Software Partitioning with Integrated Hardware Design Space Exploration. In: Proc. of DATE 1998, Paris, France, pp. 28–35 (1998)
Niemann, R., Marwedel, P.: An Algorithm for Hardware/Software Partitioning Using Mixed Integer Linear Programming. Design Automation for Embedded Systems, special Issue: Partitioning Methods for Embedded Systems 2(2), 165–193 (1997)
Weinhardt, M.: Ingeger Programming for Partitioning in Software Oriented Codesign. In: Moore, W., Luk, W. (eds.) FPL 1995. LNCS, vol. 975, pp. 227–234. Springer, Heidelberg (1995)
Henkel, J., Ernst, R.: An approach to automated hardware/software partitioning using a flexible granularity that is driven by high-level estimation techniques. IEEE Trans. on VLSI Syst. 9(2), 273–289 (2001)
Ray, A., Jigang, W., Srikanthan, T.: Knapsack model and algorithm for HW/SW partitioning problem. In: Bubak, M., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds.) ICCS 2004. LNCS, vol. 3036, pp. 200–205. Springer, Heidelberg (2004)
Madsen, J., Grode, J., Knudsen, P.V., Petersen, M.E., Haxthausen, A.: LYCOS: The Lyngby co-synthesis system. Design Automation for Embedded Systems 2, 195–235 (1997)
Edwards, S.A., Lavagno, L., Lee, E.A., Sangiovanni-Vincentelli, A.: Design of Embedded Systems: Formal Models Validation, and Synthesis. Proceedings of the IEEE 85(3), 366–390 (1997)
Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. John Wiley & Sons, Chichester (1990)
Pisinger, D.: Algorithms for knapsack problems, Ph.D. Thesis, University of Copenhagen (1995)
Freville, A.: The multidimensional 0-1 knapsack problem: An overview. European Journal of Operational Research 155, 1–21 (2004)
Knuth, D.E.: The art of computer Programming, sorting and Searching, 2nd edn., vol. 3. Addison-Wesley, Reading (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wu, J., Srikanthan, T., Yan, C. (2005). Minimizing Power in Hardware/Software Partitioning. In: Srikanthan, T., Xue, J., Chang, CH. (eds) Advances in Computer Systems Architecture. ACSAC 2005. Lecture Notes in Computer Science, vol 3740. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11572961_47
Download citation
DOI: https://doi.org/10.1007/11572961_47
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29643-0
Online ISBN: 978-3-540-32108-8
eBook Packages: Computer ScienceComputer Science (R0)