Parallel processor scheduling for digital signal processing

The authors study a method for deriving MIMD (multiple-instruction-stream, multiple-data-stream) multiprocessor scheduling with the shortest sampling duration, including processor communication time, for general signal processing algorithms. The method makes use of the repetitive nature of digital signal processing, which reduces the computational complexity of searching for the optimal assignment of operations to processors. The examples show that the proposed algorithm obtains the nearly optimum solution in most cases and works very efficiently.<
>