Reducción del Costo Computacional en Algoritmos de Evaluación de Planificabilidad (Computational Cost Reduction for Real-Time Schedulability Tests Algorithms)

José M. Urriza (josemurriza@unp.edu.ar)1, Francisco E. Páez (fpaez@unpata.edu.ar)1, Javier D. Orozco (jorozco@uns.edu.ar)2, Ricardo Casyssials (rcayssials@frbb.utn.edu.ar)3


1Universidad Nacional de la Patagonia San Juan Bosco
2Universidad Nacional del Sur
3Universidad Nacional del Sur / Universidad Tecnológica Nacional FRBB

This paper appears in: Revista IEEE América Latina

Publication Date: Dec. 2015
Volume: 13,   Issue: 12 
ISSN: 1548-0992


Abstract:
This paper focuses on reducing the computational cost of iterative algorithms used to evaluate the schedulability of Real-Time Systems. These algorithms calculate the worst case response time of each task. Through simulations it is found that the proposed new algorithm produces a significant reduction in the average temporal cost, reaching in some cases a reduction of O(n2) to O(n.log(n)), with respect to classical response time evaluation algorithms.

Index Terms:
Real-Time Systems, Rate Monotonic, Deadline Monotonic, Response Time Analysis   


Documents that cite this document
This function is not implemented yet.


[PDF Full-Text (1176)]