
Research on Real-time Scheduling Algorithm of Partition Operating System in Single Core Environment
Author(s) -
Yongchao Tao,
Qilong Song,
Songhao Piao
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1732/1/012079
Subject(s) - computer science , fair share scheduling , rate monotonic scheduling , earliest deadline first scheduling , dynamic priority scheduling , scheduling (production processes) , partition (number theory) , two level scheduling , real time operating system , distributed computing , fixed priority pre emptive scheduling , round robin scheduling , real time computing , algorithm , embedded system , operating system , mathematical optimization , mathematics , schedule , combinatorics
In an embedded environment, applications have a strong demand for real-time scheduling, but it is difficult to ensure the real-time scheduling performance under a partitioned operating system, mainly because in a multi-operating system environment. It is difficult to determine the real-time schedulability within and between partitions. The research of this paper will focus on the real-time scheduling algorithm of partition operating system with simple task model in single-core environment.