A software development tool for scheduling signal processing algorithms on multiprocessors with arbitrary interconnectivity

A multiprocessor scheduler has been developed for scheduling signal processing and other algorithms on programmable digital signal processors that can be connected in a common-bus or hypercube topology. The scheduler requires an acyclic precedence graph of the algorithm and the cost of all interprocessor communications. The software tool permits the user to select from among three different scheduling algorithms. The first is a heuristic method, the second uses dynamic programming, and the third uses integer linear programming. Schedules for six practical signal processing algorithms are obtained, and throughput rates are compared to those obtained with uniprocessor implementation.<<ETX>>

[1]  C. V. Ramamoorthy,et al.  Optimal Scheduling Strategies in a Multiprocessor System , 1972, IEEE Transactions on Computers.

[2]  S. S. Skrzypkowiak,et al.  TMS 320C25 based enhanced 32 kbps ADPCM transcoder , 1988, ICASSP-88., International Conference on Acoustics, Speech, and Signal Processing.

[3]  G. Mirchandani,et al.  Experiments in partitioning and scheduling signal processing algorithms for parallel processing , 1988, ICASSP-88., International Conference on Acoustics, Speech, and Signal Processing.

[4]  T. C. Hu Parallel Sequencing and Assembly Line Problems , 1961 .