期刊名称：Journal of Theoretical and Applied Information Technology
印刷版ISSN：1992-8645
电子版ISSN：1817-3195
出版年度：2014
卷号：66
期号：2
出版社：Journal of Theoretical and Applied
摘要：Since the first results published in 1973 by Liu and Layland on the Rate Monotonic (RM) and Earliest Deadline First (EDF) algorithms, a lot of progress has been made in the schedulability analysis of periodic task sets. Priority based real time scheduling algorithms such as RM and EDF have been analyzed extensively in this literature to achieve optimized results in real rime operations. In the paper, RM and EDF scheduling techniques have been used, analyzed and compared based on different parameters in real time environment and these traditional priority scheduling algorithms are analyzed by addressing the following metrics: Best case response time, Worst case response time, response time jitter and latency. Past work has been extended in this direction by characterizing the behavior of the scheduling algorithms in detail using theoretical analysis as well as experimental evaluation. The results of this analysis can be used to control design choices for real time systems. Various issues have been presented on which there is still a need to work.
