Optimal task scheduling algorithm for cyclic synchronous tasks in general multiprocessor networks
Journal of Parallel and Distributed Computing
Parallel image processing with the block data parallel architecture
IBM Journal of Research and Development
| Hi-index | 35.68 |
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