CORC  > 北京大学  > 数学科学学院
A hybrid heuristic algorithm for HW-SW partitioning within timed automata
Pu, Geguang ; Chong, Zhang ; Qiu, Zongyan ; Lin, Zuoquan ; He Jifeng
2006
关键词hardware/software partitioning timed automata GRASP tabu search scheduling algorithm SEARCH
英文摘要Hardware/Software (HW-SW) partitioning is a critical problem in co-design of embedded systems. This paper focuses on the synchronous system model, and formalizes the partitioning problem using timed automata (TA), which captures the key elements of the partitioning problem. Based on the TA model, we propose a hybrid heuristic algorithm to obtain near-optimal solutions effectively and efficiently. The experiments conducted show that our approach can deal with large applications with hundreds of nodes in task graph.; Computer Science, Artificial Intelligence; Computer Science, Interdisciplinary Applications; SCI(E); EI; CPCI-S(ISTP); 1
语种英语
出处SCI ; EI
内容类型其他
源URL[http://hdl.handle.net/20.500.11897/399071]  
专题数学科学学院
推荐引用方式
GB/T 7714
Pu, Geguang,Chong, Zhang,Qiu, Zongyan,et al. A hybrid heuristic algorithm for HW-SW partitioning within timed automata. 2006-01-01.
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

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


©版权所有 ©2017 CSpace - Powered by CSpace