QQ客服 官方微博 反馈留言

	Algorithmic aspects for bi-objective multiple-choice hardware/software partitioning
	Shi, Wenjun (1) ; Wu, Jigang (1) ; Lam, Siew-Kei (3) ; Srikanthan, Thambipillai (3)
	2014
会议名称	6th International Symposium on Parallel Architectures, Algorithms, and Programming, PAAP 2014
会议日期	July 13, 2014 - July 15, 2014
会议地点	Beijing, China
页码	7-12
通讯作者	Wu, Jigang
中文摘要	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.
收录类别	EI
会议录出版地	IEEE Computer Society
语种	英语
ISSN号	21683034
ISBN号	9781479938445
内容类型	会议论文
源URL	[http://ir.iscas.ac.cn/handle/311060/16576]
专题	软件研究所_软件所图书馆_会议论文
推荐引用方式 GB/T 7714	Shi, Wenjun ,Wu, Jigang ,Lam, Siew-Kei ,et al. Algorithmic aspects for bi-objective multiple-choice hardware/software partitioning[C]. 见:6th International Symposium on Parallel Architectures, Algorithms, and Programming, PAAP 2014. Beijing, China. July 13, 2014 - July 15, 2014.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。