Un Algoritmo para la Diagramación de Tareas No-Duras mediante el Cálculo del Slack Time Disponible en cada Instante

The execution of a non saturated Real-Rime System leaves idle or empty time-slots called slack. They can be used to execute tasks not belonging to the system but sharing the processor with it. Very often, the quality of service, provided to those tasks can be improved if the slack is reshuffled in such a way that the empty slots are advanced without jeopardizing the real-time tasks. The purpose of this paper is to present a redistributing algorithm for calculating the slack available at every instant. The theoretical foundation is formally proved, the algorithm is described and exemplified and, finally, a comparative evaluation against similar methods proposed by other authors to solve the same problem is carried out.