BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
X-LIC-LOCATION:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20240626T180033Z
LOCATION:Level 2 Lobby
DTSTART;TZID=America/Los_Angeles:20240626T180000
DTEND;TZID=America/Los_Angeles:20240626T190000
UID:dac_DAC 2024_sess237_RESEARCH962@linklings.com
SUMMARY:Worst Case Response Time Analysis for Completely Fair Scheduling i
 n Linux Systems
DESCRIPTION:Work-in-Progress Poster\n\nKyonghwan Yoon, EunJin Jeong, Woosu
 k Kang, Jonghyun Choe, and Soonhoi Ha (Seoul National University)\n\nMost 
 prior research in real-time schedulability analysis assumes real-time sche
 duling policies like fixed priority or Earliest Deadline First(EDF). Howev
 er, the Linux operating system, widely used in embedded systems, employs t
 he Completely Fair Scheduler(CFS) by default. To ensure the safe execution
  of real-time applications, it is crucial to check the satisfaction of rea
 l-time constraints. To our knowledge, for the first time, we propose a nov
 el analysis method to estimate the worst-case response time(WCRT) of tasks
  under the CFS, with formal proof of its reliability. To validate the prop
 osed method, a CFS simulator is developed to simulate the scheduling behav
 ior faithfully and efficiently. By comparison with the simulated results, 
 we confirm that the proposed WCRT analysis method is efficient, and the pe
 rcentage of false negatives resulting from overestimation is less than 7% 
 on average in our experimental setup.\n\nTopic: AI, Autonomous Systems, Cl
 oud, Design, EDA, Embedded Systems, IP, Security
END:VEVENT
END:VCALENDAR