An approach to hardware/software partitioning for multiple hardware devices model

Pu Geguang*, Zhao Xiangpeng, Wang Shuling, Qiu Zongyan, He Jifeng, Wang Yi

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

Computer aided hardware/software partitioning is one of the key challenges in hardware/software co-design. This paper describes a new approach to hardware/software partitioning for multiple hardware-devices model. The partitioning is transformed into a reachability problem of timed automata, and the optimal solution can be obtained by means of an optimal reachibility algorithm. To relax the initial condition of partitioning for optimization, two algorithms are designed to explore the dependency relations among processes in the sequential specification. Some experiments are conducted with model checker UPPAAL to show our approach is both effective and efficient.

Original languageEnglish
Title of host publicationProceedings of the Second International Conference on Software Engineering and Formal Methods. SEFM 2004
EditorsJ.R. Cuellar, Z. Liu
Pages376-385
Number of pages10
StatePublished - 2004
EventProceedings of the Second International Conference on Software Engineering and Formal Methods. SEFM 2004 - Beijing, China
Duration: 28 Sep 200430 Sep 2004

Publication series

NameProceedings of the Second International Conference on Software Engineering and Formal Methods. SEFM 2004

Conference

ConferenceProceedings of the Second International Conference on Software Engineering and Formal Methods. SEFM 2004
Country/TerritoryChina
CityBeijing
Period28/09/0430/09/04

Fingerprint

Dive into the research topics of 'An approach to hardware/software partitioning for multiple hardware devices model'. Together they form a unique fingerprint.

Cite this