Skip to main navigation Skip to search Skip to main content

Scheduling of conditional process graphs for the synthesis of embedded systems

  • Petru Eles
  • , Krzysztof Kuchcinski
  • , Zebo Peng
  • , Alexa Doboli
  • , Paul Pop
  • Linköping University
  • Politehnica University of Timisoara

Research output: Contribution to journalConference articlepeer-review

92 Scopus citations

Abstract

We present an approach to process scheduling based on an abstract graph representation which captures both data-flow and the flow of control. Target architectures consist of several processors, ASICs and shared buses. We have developed a heuristic which generates a schedule table so that the worst case delay is minimized. Several experiments demonstrate the efficiency of the approach.

Original languageEnglish
Article number655847
Pages (from-to)132-138
Number of pages7
JournalProceedings -Design, Automation and Test in Europe, DATE
DOIs
StatePublished - 1998
EventDesign, Automation and Test in Europe, DATE 1998 - Paris, France
Duration: Feb 23 1998Feb 26 1998

Fingerprint

Dive into the research topics of 'Scheduling of conditional process graphs for the synthesis of embedded systems'. Together they form a unique fingerprint.

Cite this