Scheduling of conditional process graphs for the synthesis of embedded systems
Petru Eles, Krzysztof Kuchciński, Zebo Peng, Alex Doboli, Paul Pop · 1998
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. 1.