Issue No.12 - December (1989 vol.38)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.40851
A study is made of the performance of a real-time system in which jobs all have deadlines for either the beginning or the end of service. In the first case the authors analyze the minimum laxity (ML) scheduling policy when there are c processors, and in the latter case they analyze the preemptive-resume earliest deadline (ED) scheduling policy when there is one server. In both cases, the analys
performance analysis; minimum laxity; deadline scheduling; performance; real-time system; scheduling policy; Poisson arrival process; exponential service times; performance evaluation; real-time systems; scheduling.
J. Hong, X. Tan, D. Towsley, "A Performance Analysis of Minimum Laxity and Earliest Deadline Scheduling in a Real-Time System", IEEE Transactions on Computers, vol.38, no. 12, pp. 1736-1744, December 1989, doi:10.1109/12.40851