Reducing Tardiness under Global Scheduling by Splitting Jobs

Jeremy P. Erickson, James H. Anderson
2013 2013 25th Euromicro Conference on Real-Time Systems  
Under current analysis, tardiness bounds applicable to global earliest-deadline-first scheduling and related policies depend on per-task worst-case execution times. By splitting job budgets to create subjobs with shorter periods and worst-case execution times, such bounds can be reduced to near zero for implicit-deadline sporadic task systems. However, doing so will result in more preemptions and could create problems for synchronization protocols. This paper analyzes this tradeoff between
more » ... y and practice by presenting an overhead-aware schedulability study pertaining to job splitting. In this study, real overhead data from a scheduler implementation in LITMUS RT was factored into schedulability analysis. This study shows that despite practical issues affecting job splitting, it can still yield substantial reductions in tardiness bounds.
doi:10.1109/ecrts.2013.13 dblp:conf/ecrts/EricksonA13 fatcat:zozujxdkwbekfd3hr5tnxpc2oe