Planificadores de tareas en tiempo real concurrentes: Una clasificación basada en funciones y teoría de conjuntos

Real-Time Operating Systems must provide support for concurrency; to achieve this, task schedulers are necessary. Schedulers operate on a set of concurrent real-time tasks in which its instances are to complete their execution within their respective deadlines; a scheduler receives a set of arrival times and maps it to a set of start times for the instances to begin their execution. In this context, a scheduler is considered to be a function that performs mapping between two sets which evolve in time, with respect to this we present a classification of schedulers, based on functions and set theory, into such categories as critical, non-critical, static, adaptive, predictive, preemptive, and optimal. Our proposed classification is novel because the state of the art classifications are only verbal and non-formal and they do not support elements which assist in analysis, modeling and/or characterization of schedulers. As an additional result, this classification can be used for future qualitative studies of optimality, stability, controllability, efficiency, convergence, and predictability from the computational point of view. The paper concludes with two examples of schedulers: RM (Rate Monotonic) and EDF (Earliest Deadline First).