Design, Automation & Test in Europe Conference & Exhibition
Download PDF

Abstract

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.
Like what you’re reading?
Already a member?
Get this article FREE with a new membership!