An optimal approach to hardware/software partitioning for synchronous model

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

6 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 synchronous communication model. We transform the partitioning into a reachability problem of timed automata. By means of an optimal reachability algorithm, an optimal solution can be obtained in terms of 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 model checker UPPAAL to show our approach is both effective and efficient.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsEerke A. Boiten, John Derrick, Graeme Smith
PublisherSpringer Verlag
Pages363-381
Number of pages19
ISBN (Print)9783540247562
DOIs
StatePublished - 2004

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2999
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Keywords

  • Hardware/software partitioning
  • Reachability
  • Scheduling algorithm
  • Timed automata

Fingerprint

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

Cite this