Scheduling algorithms for multiprocessor real-time systems

Real-time systems are subject to fundamental user requirements, such as correctness of the systems, taking into account timeliness and simultaneity, a high degree of predictability. This means that the scheduling algorithm is an important component of these systems. A scheduling algorithm is used to determine a schedule for a set of tasks so that the task´s deadlines and resource requirements are satisfied. The potential speedup of applications has motivated the widespread use of multiprocessors in recent years. 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 the precedence constraints