A note on “task allocation and scheduling models for multiprocessor digital signal processing”

Author

Krishnan, C.S.R. ; Piriyakumar, D. Antony Louis ; Murthy, C. Siva Ram

Author_Institution

Dept. of Comput. Sci. & Eng., Indian Inst. of Technol., Madras, India

Volume

43

Issue

3

fYear

1995

fDate

3/1/1995 12:00:00 AM

Firstpage

802

Lastpage

805

Abstract

Previously, a branch and bound algorithm for task allocation or task scheduling in multiprocessor digital signal processing based on 0-1 integer programming was proposed by Konstantinides et al. (1990). This algorithm does not consider the problem of contention in the communication links of a multiprocessor system and thus may produce unrealistic schedules. The present authors present a modified version of this algorithm that resolves the problem of contention, thereby producing realistic optimal schedules

Keywords

integer programming; parallel algorithms; processor scheduling; scheduling; signal processing; tree searching; 0-1 integer programming; branch and bound algorithm; communication links; contention; multiprocessor digital signal processing; optimal schedules; scheduling models; task allocation; Delay; Digital signal processing; Frequency estimation; Linear programming; Multiple signal classification; Multiprocessing systems; Optimal scheduling; Processor scheduling; Scheduling algorithm; Signal processing algorithms;

fLanguage

English

Journal_Title

Signal Processing, IEEE Transactions on

Publisher

ieee

ISSN

1053-587X

Type

jour

DOI

10.1109/78.370642

Filename

370642