Paper Info
Title
Work-in-Progress: Precise Scheduling of Mixed-Criticality Tasks by Varying Processor Speed
Abstract
The traditional mixed-criticality (MC) model does not allow less critical tasks to execute during an event of the error and exception. Recently, the imprecise MC (IMC) model has been proposed where, even for exceptional events, less critical tasks also receive some amount of (degraded) service, e.g., a task overruns its execution demand. In this work, we present our ongoing effort to extend the IMC model to the precise scheduling of tasks and integrate with the dynamic voltage and frequency scaling (DVFS) scheme to enable energy minimization. Precise scheduling of MC systems is highly challenging because of its requirement to simultaneously guarantee the timing correctness of all tasks under both pessimistic and less pessimistic assumptions. We propose an utilization-based schedulability test and sufficient schedulability conditions for such systems under earliest deadline first with virtual deadline (EDF-VD) scheduling policy. For this unified model, we present a quantitative study in the forms of speedup bound and approximation ratio. Finally, both theoretical and experimental analysis will be conducted to prove the correctness of our algorithm and to demonstrate its effectiveness.
Year
DOI
Venue
2018
10.1109/RTSS.2018.00033
2018 IEEE Real-Time Systems Symposium (RTSS)
Keywords
Field
DocType
Mixed-criticality scheduling, DVFS, Speedup bound, Approximation ratio
Approximation algorithm,Computer science,Scheduling (computing),Correctness,Mixed criticality,Frequency scaling,Earliest deadline first scheduling,Dynamic priority scheduling,Distributed computing,Speedup
Conference
ISSN
ISBN
Citations 
1052-8725
978-1-5386-7909-8
1
PageRank 
References 
Authors
0.35
0
3
Name
Order
Citations
PageRank
Sai Sruti121.03
Ashikahmed Bhuiyan2202.99
Zhishan Guo332934.04