Design Tool for Multiprocessor Scheduling and Evaluation of Iterative Dataflow Algorithms
Iii Robert L. Jones · NASA Technical Reports Server (NASA) · 1995
A graph-theoretic design process and software tool is defined for selecting a multiprocessing scheduling solution for a class of computational problems. The problems of interest are those that can be described with a dataflow graph and are intended to be executed repetitively on a set of identical processors. Typical applications include signal processing and control law problems. Graph-search algorithms and analysis techniques are introduced and shown to effectively determine performance bounds, scheduling constraints, and resource requirements. The software tool applies the design process to a given problem and includes performance optimization through the inclusion of additional precedence constraints among the schedulable tasks. model; Graph-search algorithms; Dataflow paradigm; Petri net; Performance metrics; Computer-aided design; Digital signal processing; Control law