Scheduling of Conditional Process Graphs for the Synthesis of Embedded Systems

We present an approach to process scheduling based on an abstract graph representation which captures both dataflow and the flow of control. Target architectures consist of several processors, ASICs and shared busses. 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.

• Type: Conference
• Year: 1998
• Where: DATE
• Authors: Petru Eles, Krzysztof Kuchcinski, Zebo Peng, Alexa Doboli, Paul Pop
• Keywords: Abstract Graph Representation, DATE 1998, Hardware, Target Architectures, Worst Case Delay