Please use this identifier to cite or link to this item:
|Title:||A Note on ?Task Allocation and Scheduling Models for Multiprocessor Digital Signal Processing?|
Louis Piriyakumar, D.A.
Ram Murthy, C.S.
|Keywords:||Algorithms; Graph theory; Integer programming; Mathematical models; Multiprocessing systems; Optimization; Scheduling; Telecommunication links; Contention; Schedules; Task allocation; Task scheduling; Digital signal processing|
|Citation:||IEEE Transactions on Signal Processing, 43(3), 802-805|
|Abstract:||Recently, 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. This algorithm does not consider the problem of contention in the communication links of a multiprocessor system and thus may produce unrealistic schedules. We present here a modified version of this algorithm that resolves the problem of contention, thereby producing realistic optimal schedules. ? 1995 IEEE|
|Appears in Collections:||Articles|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.