PAStime: Progress-Aware Scheduling for Time-Critical Computing

Soham Sinha, Richard West, Ahmad Golchin

Over-estimation of worst-case execution times (WCETs) of real-time tasks leads to poor resource utilization. In a mixed-criticality system (MCS), the over-provisioning of CPU time to accommodate the WCETs of highly critical tasks may lead to degraded service for less critical tasks. In this paper we present PAStime, a novel approach to monitor and adapt the runtime progress of highly time-critical applications, to allow for improved service to lower criticality tasks. In PAStime, CPU time is allocated to time-critical tasks according to the delays they experience as they progress through their control flow graphs. This ensures that as much time as possible is made available to improve the Quality-of-Service of less critical tasks, while high-criticality tasks are compensated after their delays. This paper describes the integration of PAStime with Adaptive Mixed-criticality (AMC) scheduling. The LO-mode budget of a high-criticality task is adjusted according to the delay observed at execution checkpoints. This is the first implementation of AMC in the scheduling framework of LITMUS^RT, which is extended with our PAStime runtime policy and tested with real-time Linux applications such as object classification and detection. We observe in our experimental evaluation that AMC-PAStime significantly improves the utilization of the low-criticality tasks while guaranteeing service to high-criticality tasks.

The paper will be presented in the session
Scheduling and worst-case analysis – Wednesday, July 8, 13:20 – 15:10 (CET)

https://drops.dagstuhl.de/opus/volltexte/2020/12366/pdf/LIPIcs-ECRTS-2020-3.pdf

Please note, all rights on the videos remain with the authors

The source code and a guideline to run PAStime is provided here.

Comments are closed.