HW/ SW Partitioning Algorithms for Multi-objective Optimization in Embedded Systems

Abstract

One of the most crucial steps in the design of modern Embedded Systems (ES) is the partitioning the system’s functionalities between the hardware (HW) blocks and the software (SW) blocks. The process of hardware software partitioning (HSP) is driven by several non functional requirements factors. Several works studied the influence of the execution time and the hardware area (cost) factors while dealing with the HSP problem; other works included also the power consumption factor. This article gives a study the HSP problem while considering several factors (ES metrics) and presents two approaches to solve the problem. The first approach has the objective of optimizing simultaneously a number of metrics while respecting a constraint on the global hardware area (cost metric), this approach is implemented using 0-1 Knapsack Problem (KP) algorithm; experimental results show that the algorithm is very fast and gives more reliable solutions comparing to well-known algorithms such as the Genetic Algorithm (GA) and the Simulated Annealing (SA) algorithm. The second approach aims to optimize the hardware cost while respecting given constraints on the other metrics; the proposed approach is based on Balas method.
Published
Jan 19, 2019
How to Cite
IGUIDER, Adil et al. HW/ SW Partitioning Algorithms for Multi-objective Optimization in Embedded Systems. International Journal of Information Science and Technology, [S.l.], v. 2, n. 2, p. 19 - 28, jan. 2019. ISSN 2550-5114. Available at: <https://innove.org/ijist/index.php/ijist/article/view/41>. Date accessed: 20 apr. 2024. doi: http://dx.doi.org/10.57675/IMIST.PRSM/ijist-v2i2.41.
Section
Special issue : Emerging Technologies and Smart Applications