QQ客服 官方微博 反馈留言

	Exploring optimal solution to hardware/software partitioning for synchronous model
	He, JF ; Hung, DV ; Pu, GG ; Qiu, ZY ; Yi, W
	2005
关键词	hardware/software partitioning timed automata reachability scheduling algorithm
英文摘要	Computer aided hardware/software partitioning is one of the key challenges in hardware/software co-design. This paper describes a new approach to hardware/software partitioning for a synchronous communication model including multiple hardware devices. We transform the partitioning into a reachability problem of timed automata. By means of an optimal reachability algorithm, the optimal solution can be obtained with limited resources in hardware. To relax the initial condition of the partitioning for optimization, two algorithms are designed to explore the dependency relations among processes in the sequential specification. Moreover, we propose a scheduling algorithm to improve the synchronous communication efficiency further after partitioning stage. Some experiments are conducted with the model checker UPPAAL to show our approach is both effective and efficient.; Computer Science, Software Engineering; SCI(E); EI; CPCI-S(ISTP); 0
语种	英语
出处	SCI ; EI
内容类型	其他
源URL	[http://hdl.handle.net/20.500.11897/253543]
专题	数学科学学院
推荐引用方式 GB/T 7714	He, JF,Hung, DV,Pu, GG,et al. Exploring optimal solution to hardware/software partitioning for synchronous model. 2005-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

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