Optimal and near-optimal techniques for multiprocessor scheduling of multiple-rate algorithms on synchronous multiprocessor systems

Author

Gelabert, Pedro R. ; Barnwell, Thomas P., III

Author_Institution

Sch. of Electr. Eng., Georgia Inst. of Technol., Atlanta, GA, USA

Volume

5

fYear

1992

fDate

10-13 May 1992

Firstpage

2324

Abstract

The authors describe two multiprocessor compiler techniques that generate synchronous multiprocessor schedules for multiple-rate algorithms represented by fully specified flow graphs (FSFGs) which contain up-samplers and down-samplers. The first scheduling technique is based on a modified multi-cyclic multiprocessor compiler that finds globally optimal solutions. The second technique generates near-optimal solutions by trading global optimality for a lower scheduling complexity. These scheduling techniques are illustrated with examples

Keywords

multiprocessing systems; program compilers; scheduling; signal processing; DSP algorithms; down-samplers; fully specified flow graphs; multiple-rate algorithms; multiprocessor compiler techniques; multiprocessor scheduling; near-optimal techniques; nearoptimal techniques; optimal techniques; synchronous multiprocessor systems; up-samplers; Delay; Digital signal processing; Flow graphs; IIR filters; Multiprocessing systems; Parallel processing; Processor scheduling; Scheduling algorithm; Signal processing algorithms; Tiles;

fLanguage

English

Publisher

ieee

Conference_Titel

Circuits and Systems, 1992. ISCAS '92. Proceedings., 1992 IEEE International Symposium on

Conference_Location

San Diego, CA

Print_ISBN

0-7803-0593-0

Type

conf

DOI

10.1109/ISCAS.1992.230493

Filename

230493