Integrating timed automata into tabu algorithm for HW-SW partitioning

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

[1]  Wang Yi,et al.  An Optimal Approach to Hardware/Software Partitioning for Synchronous Model , 2004, IFM.

[2]  Wang Yi,et al.  An approach to hardware/software partitioning for multiple hardware devices model , 2004, Proceedings of the Second International Conference on Software Engineering and Formal Methods, 2004. SEFM 2004..

[3]  Zuoquan Lin,et al.  Variable Neighborhood Search with Permutation Distance for QAP , 2005, KES.

[4]  Kim G. Larsen,et al.  Guided Synthesis of Control Programs Using UPPAAL , 2000, Nord. J. Comput..

[5]  Rajesh Gupta,et al.  Hardware Software Co-Design of Embedded Systems , 1996, VLSI Design.

[6]  He Jifeng,et al.  An algebraic approach to hardware/software partitioning , 2000, ICECS 2000. 7th IEEE International Conference on Electronics, Circuits and Systems (Cat. No.00EX445).

[7]  Rajesh K. Gupta,et al.  Data-flow assisted behavioral partitioning for embedded systems , 1997, DAC.

[8]  Jifeng He,et al.  An Approach to the Specification and Verification of a Hardware Compilation Scheme , 2001, The Journal of Supercomputing.

[9]  Frank Vahid,et al.  Modeling with SpecCharts , 1990 .

[10]  Nikil D. Dutt,et al.  Efficient search space exploration for HW-SW partitioning , 2004, International Conference on Hardware/Software Codesign and System Synthesis, 2004. CODES + ISSS 2004..

[11]  Theerayod Wiangtong,et al.  Comparing Three Heuristic Search Methods for Functional Partitioning in Hardware–Software Codesign , 2002, Des. Autom. Embed. Syst..

[12]  Ansgar Fehnker.  Bounding and heuristics in forward reachability algorithms , 2000 .

[13]  Kim G. Larsen,et al.  Minimum-Cost Reachability for Priced Timed Automata , 2001, HSCC.

[14]  Gerd Behrmann,et al.  Efficient Guiding Towards Cost-Optimality in UPPAAL , 2001, TACAS.

[15]  Peter Marwedel,et al.  An Algorithm for Hardware/Software Partitioning Using Mixed Integer Linear Programming , 1997, Des. Autom. Embed. Syst..

[16]  Giovanni De Micheli,et al.  Co-Synthesis of Hardware and Software for Digital Embedded Systems , 2008 .

[17]  Augusto Sampaio,et al.  ParTS: A Partitioning Transformation System , 1999, World Congress on Formal Methods.

[18]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[19]  Fred W. Glover,et al.  Tabu Search , 1997, Handbook of Heuristics.

[20]  Wolfgang Rosenstiel,et al.  A method for partitioning UNITY language in hardware and software , 1994, EURO-DAC '94.

[21]  Garrison W. Greenwood,et al.  Preference-driven hierarchical hardware/software partitioning , 1999, Proceedings 1999 IEEE International Conference on Computer Design: VLSI in Computers and Processors (Cat. No.99CB37040).

[22]  Krzysztof Kuchcinski,et al.  An algorithm for partitioning of application specific systems , 1993, 1993 European Conference on Design Automation with the European Event in ASIC Design.