Scheduling algorithms for parallel real-time systems
The potential speedup of applications has motivated the widespread use of multiprocessors in recent years. Future real-time systems are likely to be built on multiprocessor architectures. Efficient scheduling algorithms for multiprocessors are needed so that tasks will have predictable behaviors. In this paper, recent results on multiprocessor real-time scheduling algorithms are reviewed. The review takes the form of an analysis of the problems presented by different application requirements and characteristics. A scheduling algorithm for real-time systems to be implemented on multiprocessors is proposed. This algorithm is appropriate for real-time tasks with precedence constraints.