A hybrid heuristic algorithm for HW-SW partitioning within timed automata

Authors:
Geguang Pu;Zhang Chong;Zongyan Qiu;Zuoquan Lin;He Jifeng
Affiliations:
Software Engineering Institute, East China Normal University, Shanghai, China;LMAM, Department of Informatics, School of Math., Peking University, Beijing, China;LMAM, Department of Informatics, School of Math., Peking University, Beijing, China;LMAM, Department of Informatics, School of Math., Peking University, Beijing, China;Software Engineering Institute, East China Normal University, Shanghai, China
Venue:
KES'06 Proceedings of the 10th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part I
Year:
2006

Citing 6
Cited 0

A theory of timed automata

Theoretical Computer Science
Variable neighborhood search

Computers and Operations Research
An Approach to the Specification and Verification of a Hardware Compilation Scheme

The Journal of Supercomputing
Preference-Driven Hierarchical Hardware/Software Partitioning

ICCD '99 Proceedings of the 1999 IEEE International Conference on Computer Design
Efficient search space exploration for HW-SW partitioning

Proceedings of the 2nd IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis
An Approach to Hardware/Software Partitioning for Multiple Hardware Devices Model

SEFM '04 Proceedings of the Software Engineering and Formal Methods, Second International Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.