A dataflow analysis tool for parallel processing of algorithms
Robert L. Jones · NASA Technical Reports Server (NASA) · 1993
A graph-theoretic design process and software tool is presented for selecting a multiprocessing scheduling solution for a class of computational problems. The problems of interest are those that can be described using a dataflow graph and are intended to be executed repetitively on a set of identical parallel processors. Typical applications include signal processing and control law problems. Graph analysis techniques are introduced and shown to effectively determine performance bounds, scheduling constraints, and resource requirements. design process to a given problem. The software tool is shown to facilitate the application of the