Title :
Quasi-static scheduling for multiprocessor DSP
Author :
Ha, Soonhoi ; Lee, Edward A.
Author_Institution :
Dept. of Electr. Eng. & Comput. Sci., California Univ., Berkeley, CA, USA
Abstract :
Scheduling strategies for a multiprocessor DSP (digital signal processor) are classified into four types: fully dynamic, static-assignment, self-timed, and fully static. The concept of static scheduling (self-timed or fully static) is extended to handle nondeterministic actors in the proposed quasi-static scheduling. Quasi-static scheduling minimizes run-time overhead with increased compilation complexity, and is thus adequate for signal processing applications. The proposed scheme is applicable to the dynamic (static-assignment) scheduling strategy as well as to static (self-timed) scheduling
Keywords :
computerised signal processing; multiprocessing systems; scheduling; compilation complexity; digital signal processor; dynamic scheduling; multiprocessor DSP; nondeterministic actors; quasi-static scheduling; run-time overhead; signal processing applications; static assignment scheduling; static scheduling; Costs; Digital signal processing; Dynamic scheduling; Fires; Hardware; Partitioning algorithms; Processor scheduling; Runtime; Signal processing; Signal processing algorithms;
Conference_Titel :
Circuits and Systems, 1991., IEEE International Sympoisum on
Print_ISBN :
0-7803-0050-5
DOI :
10.1109/ISCAS.1991.176346