IEEE Transactions on Signal Processing · 1995 · 11 citations · 6 references
ComputingComputer EngineeringComputer ScienceAlgorithmsOptimizationSchedulingDigital Signal ProcessingInteger ProgrammingInterprocess CommunicationResource-constrained SchedulingScheduling TheoryTask Scheduling0-1 Integer ProgrammingInteger Programming ModelsMultiprocessor SchedulingScheduling AlgorithmsScheduling In Multiprocessor SystemsScheduling ModelsScheduling ProblemsTask Scheduling Under Contention
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.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
6