A Hybrid Heuristic Algorithm for HW-SW Partitioning Within Timed Automata.

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. Keywords: hardware/software partitioning, timed automata, GRASP, tabu search, scheduling algorithm. [ABSTRACT FROM AUTHOR]