Paper Info
Title
Parametric Utilization Bounds For Implicit-Deadline Periodic Tasks In Automotive Systems
Abstract
Fixed-priority scheduling has been widely used in safety critical applications. This paper explores the parametric utilization bounds for implicit-deadline periodic tasks in automotive uniprocessor systems, where the period of a task is either 1, 2, 5, 10, 20, 50, 100, 200, or 1000 milliseconds. We prove a parametric utilization bound of 90% + z for such automotive task systems under rate-monotonic preemptive scheduling (RM-P), where z is a parameter defined by the input task set with 0 < z < 10%. Moreover, we explain how to perform an exact schedulability test for an automotive task set under RM-P by validating only three conditions. Furthermore, we extend our analyses to rate-monotonic non-preemptive scheduling (RM-NP). We show that very reasonable utilization values can still be achieved under RM-NP if the execution time of all tasks is below 1 millisecond. The analyses presented here are compatible with angle-synchronous tasks by applying the related arrival curves. It is shown in the evaluations that scheduling those angle-synchronous tasks according to their minimum inter-arrival time instead of assigning them to the highest priority can drastically increase the acceptance ratio in some settings.
Year
DOI
Venue
2017
10.1145/3139258.3139273
PROCEEDINGS OF THE 25TH INTERNATIONAL CONFERENCE ON REAL-TIME NETWORKS AND SYSTEMS (RTNS 2017)
Field
DocType
Citations 
Metrical task system,Uniprocessor system,Preemption,Mathematical optimization,Computer science,Scheduling (computing),Real-time computing,Millisecond,Parametric statistics,Periodic graph (geometry),Automotive industry
Conference
2
PageRank 
References 
Authors
0.35
23
4
Name
Order
Citations
PageRank
Georg von der Bruggen1335.82
Niklas Ueter2135.58
Jian-Jia Chen32007129.20
Matthias Freier482.51