Presentation
Worst Case Response Time Analysis for Completely Fair Scheduling in Linux Systems
DescriptionMost prior research in real-time schedulability analysis assumes real-time scheduling policies like fixed priority or Earliest Deadline First(EDF). However, the Linux operating system, widely used in embedded systems, employs the Completely Fair Scheduler(CFS) by default. To ensure the safe execution of real-time applications, it is crucial to check the satisfaction of real-time constraints. To our knowledge, for the first time, we propose a novel analysis method to estimate the worst-case response time(WCRT) of tasks under the CFS, with formal proof of its reliability. To validate the proposed method, a CFS simulator is developed to simulate the scheduling behavior faithfully and efficiently. By comparison with the simulated results, we confirm that the proposed WCRT analysis method is efficient, and the percentage of false negatives resulting from overestimation is less than 7% on average in our experimental setup.
Event Type
Work-in-Progress Poster
TimeWednesday, June 265:00pm - 6:00pm PDT
LocationLevel 2 Lobby
AI
Autonomous Systems
Cloud
Design
EDA
Embedded Systems
IP
Security