Task allocation and scheduling models for multiprocessor digital signal processing

Task allocation and scheduling models for distributed digital signal processing are presented. The notions of block-type and stream-type tasks in signal processing application are introduced, and models for sequential and parallel I/O are presented. By extending the traditional models, more accurate schedules can be obtained. Those models can be further enhanced by allowing additional restrictions on the number of parallel I/O ports and the amount of parallelism on memory access. The deterministic nature of digital signal processing algorithms allows for more computationally intensive and accurate task allocation techniques to be performed at compile time. By applying a branch and bound algorithm, the task allocation problem can easily be solved for a variety of scheduling models and various system restrictions.<
>