A new generalized approach to application-defined scheduling
-
Mario Aldea Rivas [1]
;
Michael González Harbour
[1]
-
[1] Universidad de Cantabria
Universidad de Cantabria
Santander, España
-
- Localización: VII Jornadas de Tiempo Real: Málaga, 5 y 6 de febrero 2004 / coord. por Alfons Crespo i Lorente , Manuel Díaz Rodríguez , Michael González Harbour , Margarita Marcos Muñoz , Juan Antonio de la Puente Alfaro , 2004
- Idioma: inglés
- Texto completo no disponible (Saber más ...)
-
Resumen
In previous papers we had presented an application program interface (API) that enabled applications touse application-defined scheduling algorithms in a waycompatible with the scheduling model defined in POSIX.This paper presents a new more general API with three mainenhancements. First, the application scheduler is describedas an abstract object that needs not be implemented as athread, thus potentially increasing efficiency in some operating system architectures. Second, we define an abstractnotion of urgency that is used by the kernel to order thethreads in the scheduling queue, freeing the applicationscheduler of the responsibility of keeping the desired ordering of threads, and thus simplifying it and reducing overhead. In third place, we also consider thread synchronization through mutexes by adding the Stack Resource Policyor the Priority Inheritance Policy adapted to the generalizedconcept of urgency, both of which can be used in a large variety of fixed and dynamic priority scheduling policies without explicit intervention of the application scheduler.
