The Community for Technology Leaders
Engineering of Complex Computer Systems, IEEE International Conference on (2006)
Stanford, California
Aug. 15, 2006 to Aug. 17, 2006
ISBN: 0-7695-2530-X
pp: 131-138
Geguang Pu , East China Normal University, Shanghai, P. R. China
Zhang Chong , Peking University, Beijing, P.R.China
Zongyan Qiu , Peking University, Beijing, P.R.China
Jifeng He , East China Normal University, Shanghai, P. R. China
Wang Yi , Uppsala University, Sweden
ABSTRACT
Hardware/software (HW-SW) partitioning is a key problem in codesign of embedded systems, studied extensively in the past. This paper describes a new approach to hardware/software partitioning for synchronous model. We formalize the partitioning problem using timed automata, which captures the key elements of the partitioning. Then the tabu algorithm is applied to timed automata model to search for the solution efficiently. An industrial experiment is conducted to show our approach can handle large applications with hundreds of nodes in task graph effectively.
INDEX TERMS
null
CITATION

J. He, W. Yi, Z. Chong, Z. Qiu and G. Pu, "Integrating Timed Automata into Tabu Algorithm for HW-SW Partitioning," 11th IEEE International Conference on Engineering of Complex Computer Systems(ICECCS), Stanford, CA, 2006, pp. 131-138.
doi:10.1109/ICECCS.2006.1690362
102 ms
(Ver 3.3 (11022016))