Abstract
Previous studies focus on the classical mixed-criticality task model with preemptive dynamic priority scheduling in which all low-criticality (LO) tasks are dropped in the high-criticality mode (HI-mode). This paper focuses on the imprecise mixed-criticality (IMC) tasks model in which LO tasks reduce their execution budgets instead of being dropped. So far, the energy minimization problem of non-preemptive dynamic priority scheduling has received little attention. In this paper, we first develop schedulability tests of non-preemptive earliest deadline first with virtual deadline (NP-EDFVD) for IMC tasks, which is the first attempt for non-preemptive dynamic priority scheduling in single processor IMC systems. Subsequently, the uniform single speed (USS) algorithm based on the schedulability tests of NP-EDFVD is proposed to reduce energy consumption while protecting the IMC correctness. Finally, the experimental results show that the USS algorithm saves an average of 25.62% energy compared to NP-EDFVD.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
