Institutional Repository
| Algorithmic aspects for bi-objective multiple-choice hardware/software partitioning | |
| Shi, Wenjun (1); Wu, Jigang (1); Lam, Siew-Kei (3); Srikanthan, Thambipillai (3); Wu, Jigang | |
| 2014 | |
| Conference Name | 6th International Symposium on Parallel Architectures, Algorithms, and Programming, PAAP 2014 |
| Pages | 7-12 |
| Conference Date | July 13, 2014 - July 15, 2014 |
| Conference Place | Beijing, China |
| Indexed Type | EI |
| Publish Place | IEEE Computer Society |
| ISSN | 21683034 |
| ISBN | 9781479938445 |
| Department | (1) School of Computer Science and Software Engineering, Tianjin Polytechnic University, Tianjin, China; (2) Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, China; (3) School of Computer Engineering, Nanyang Technological University, Singapore, Singapore |
| English Abstract | Designing embedded systems has become a challengingprocess due to the increasing complexity of the applications. In addition, there is a need to meet multiple conflicting constraints such as speed, power and cost. These factors have led to an explosion in the design space as each task in the application can have various implementation options (software and a range of hardware customizations), where each implementation option is associated with different speed, power and cost. In this paper, we propose hardware-software (HW/SW) partitioning algorithms that are capable of managing the large design space by taking into account the multiple implementation choices. In particular, we focus on multiple-choice HW/SW partitioning with the following objectives: minimizing execution time and power consumption, while meeting the area constraint. Two algorithms will be presented: 1) a heuristic method that is based on the bi-objective knapsack problem to rapidly generate an approximate solution, 2) a dynamic programming algorithm to calculate the exact solution. Simulation results show that the heuristic method produces results that are very close to the exact ones.; Designing embedded systems has become a challengingprocess due to the increasing complexity of the applications. In addition, there is a need to meet multiple conflicting constraints such as speed, power and cost. These factors have led to an explosion in the design space as each task in the application can have various implementation options (software and a range of hardware customizations), where each implementation option is associated with different speed, power and cost. In this paper, we propose hardware-software (HW/SW) partitioning algorithms that are capable of managing the large design space by taking into account the multiple implementation choices. In particular, we focus on multiple-choice HW/SW partitioning with the following objectives: minimizing execution time and power consumption, while meeting the area constraint. Two algorithms will be presented: 1) a heuristic method that is based on the bi-objective knapsack problem to rapidly generate an approximate solution, 2) a dynamic programming algorithm to calculate the exact solution. Simulation results show that the heuristic method produces results that are very close to the exact ones. |
| Language | 英语 |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/16576 |
| Collection | 中国科学院软件研究所 |
| Corresponding Author | Wu, Jigang |
| Recommended Citation GB/T 7714 | Shi, Wenjun ,Wu, Jigang ,Lam, Siew-Kei ,et al. Algorithmic aspects for bi-objective multiple-choice hardware/software partitioning[C]. IEEE Computer Society,2014:7-12. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment