Advertisement

Formal Aspects of Computing

, Volume 17, Issue 4, pp 443–460 | Cite as

Exploring optimal solution to hardware/software partitioning for synchronous model

  • Jifeng He
  • Dang Van Hung
  • Geguang PuEmail author
  • Zongyan Qiu
  • Wang Yi
Article
  • 64 Downloads

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 a synchronous communication model including multiple hardware devices. We transform the partitioning into a reachability problem of timed automata. By means of an optimal reachability algorithm, the optimal solution can be obtained with limited resources in hardware. To relax the initial condition of the partitioning for optimization, two algorithms are designed to explore the dependency relations among processes in the sequential specification. Moreover, we propose a scheduling algorithm to improve the synchronous communication efficiency further after partitioning stage. Some experiments are conducted with the model checker UPPAAL to show our approach is both effective and efficient.

Keywords

Hardware/software partitioning Timed automata Reachability Scheduling algorithm 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© BCS 2005

Authors and Affiliations

  • Jifeng He
    • 1
  • Dang Van Hung
    • 1
  • Geguang Pu
    • 2
    • 4
    Email author
  • Zongyan Qiu
    • 2
  • Wang Yi
    • 3
  1. 1.International Institute for Software TechnologyUnited Nations UniversityMacauChina
  2. 2.LMAM and Department of Informatics, School of MathematicsPeking UniversityBeijingChina
  3. 3.Department of Computer SystemsUppsala UniversityUppsalaSweden
  4. 4.Software Engineering InstituteEast China Normal UniversityShanghaiChina

Personalised recommendations