Abstract
AbstractAn important development trend of modern real-time systems and embedded systems is Mixed criticality real-time Systems, Which is integrating functions with different level of importance into a sharing hardware platform. The biggest research focus of mixed criticality real-time Systems is scheduling problem. At present, the definition and connotation of Mixed criticality real-time system are generally accepted, but there is no unified task model. In this study, according to the research requirements of Mixed criticality real-time system, we first give a task model of mixed criticality real-time system, and define the schedulability of the system. Then it introduces two scheduling strategies based on time and priority, analyzes their advantages and disadvantages, and leads to the classic algorithm EDF in dynamic priority strategy. Finally, the paper focuses on the EDF-VD scheduling algorithm. Based on the task model of Mixed criticality real-time system, an example is given to analyze the EDF-VD algorithm in the Mixed criticality real-time system.KeywordsMixed criticality real-time systemsScheduling algorithm and analysisEDF-VD (Earliest Deadline First-Virtual Deadlines) algorithm
Published Version
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 call