Multiprocessor implementation of real-time DSP algorithms

摘要

In this paper, we consider multiprocessor implementation ofnreal-time recursive digital signal processing algorithms. The objectivenis to devise a periodic schedule, and a fully static task assignmentnscheme to meet the desired throughput rate while minimizing the numbernof processors. Toward this goal, we propose a notion called cutoff time.nWe prove that the minimum-processor schedule can be found within anfinite time interval bounded by the cutoff time. As such the complexitynof the scheduling algorithm and the allocation algorithm can bensignificantly reduced. Next, taking advantage of the cutoff time, wenderive efficient heuristic algorithms which promise better performancenand less computation complexity compared to other existing algorithms.nExtensive benchmark examples are tested which yield most encouragingnresults