Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/85848
Title: Efficient Schedulability Test for Dynamic-Priority Scheduling of Mixed-Criticality Real-Time Systems
Authors: Gu, Xiaozhe
Easwaran, Arvind
Keywords: Demand Bound Function
Mixed-Criticality System
Issue Date: 2017
Source: Gu, X., & Easwaran, A. (2017). Efficient Schedulability Test for Dynamic-Priority Scheduling of Mixed-Criticality Real-Time Systems. ACM Transactions on Embedded Computing Systems, 17(1), 24-.
Series/Report no.: ACM Transactions on Embedded Computing Systems
Abstract: Systems in many safety-critical application domains are subject to certification requirements. In such a system, there are typically different applications providing functionalities that have varying degrees of criticality. Consequently, the certification requirements for functionalities at these different criticality levels are also varying, with very high levels of assurance required for a highly critical functionality, whereas relatively low levels of assurance are required for a less critical functionality. Considering the timing assurance given to various applications in the form of guaranteed budgets within deadlines, a theory of real-time scheduling for such multi-criticality systems has been recently under development. In particular, an algorithm called Earliest Deadline First with Virtual Deadlines (EDF-VD) has shown a lot of promise for systems with two criticality levels, especially in terms of practical performance demonstrated through experiment results. In this article, we design a new schedulability test for EDF-VD that extends these performance benefits to multi-criticality systems. We propose a new test based on demand bound functions and also present a novel virtual deadline assignment strategy. Through extensive experiments, we show that the proposed technique significantly outperforms existing strategies for a variety of generic real-time systems.
URI: https://hdl.handle.net/10356/85848
http://hdl.handle.net/10220/44158
ISSN: 1539-9087
DOI: 10.1145/3105922
Schools: School of Computer Science and Engineering 
Rights: © 2017 Association for Computing Machinery (ACM). This is the author created version of a work that has been peer reviewed and accepted for publication by ACM Transactions on Embedded Computing Systems, Association for Computing Machinery (ACM). It incorporates referee’s comments but changes resulting from the publishing process, such as copyediting, structural formatting, may not be reflected in this document. The published version is available at: [https://doi.org/10.1145/3105922].
Fulltext Permission: open
Fulltext Availability: With Fulltext
Appears in Collections:SCSE Journal Articles

Files in This Item:
File Description SizeFormat 
journal_6.pdf1.16 MBAdobe PDFThumbnail
View/Open

SCOPUSTM   
Citations 50

5
Updated on Mar 18, 2024

Web of ScienceTM
Citations 50

1
Updated on Oct 30, 2023

Page view(s) 50

465
Updated on Mar 18, 2024

Download(s) 50

146
Updated on Mar 18, 2024

Google ScholarTM

Check

Altmetric


Plumx

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.