par Goossens, Joël ;Richard, Pascal
Référence Real-Time Systems Scheduling 1: Fundamentals, wiley, page (105-147)
Publication Publié, 2014-11
Partie d'ouvrage collectif
Résumé : This chapter presents main results for partitioned and global scheduling of multiprocessor systems. It focuses on parallel architectures composed of several processors for the execution of real-time applications. The chapter presents periodic and sporadic task models to represent the real-time applications. A scheduler is the real-time kernel component that handles the allocation of computing resources to jobs generated by the tasks. The schedulers are classified by the nature of the priorities they assign to the tasks such as fixed-task priority (FTP), fixed-job priority (FJP) and dynamic priority (DP). Schedulers can be analyzed and compared using qualitative and quantitative criteria. The main qualitative and quantitative criteria of schedulers are comparability of algorithms, optimality and existence of online algorithms, predictability, sustainability and scheduling anomalies, utilization bounds and resource augmentation ratio.