An SSIMD compiler for the implementation of linear shift-invariant flow graphs

This paper describes the implementation of a multiprocessor compiler for signal flow graphs. The compiler takes as input an intrinsically non-parallel representation of a recursive or nonrecursive signal flow graph and generates as output the complete realization for a synchronous multiprocessor computer. Using this compiler, a programmer can generate processor-optimal (optimally efficient) and rate-optimal (optimally fast) implementations without explicitely considering the multiprocessor context or the parallelism.