Partitioning Signal Flow Graphs for Execution on Heterogeneous Signal Processing Architectures

We present a technique for partitioning signal processing algorithms represented as signal flow graphs for execution on a hierarchically structured, heterogeneous multiprocessor architecture. We propose the use of an optimization algorithm with an uduptive seurch schedule to find good partitions. We find that such an approach consistently determines optimal partitions for several example signal flow graphs. The paper discusses the present form of the algorithm, and results of an experimental evaluation.