.png){kind=icon}
Return
Execution allowance based fixed priority scheduling for probabilistic real-time systems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jss.2019.03.001.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Real-time systems tend to be probabilistic in nature because of the performance variations of complex chips. We present an execution allowance based fixed priority scheduling scheme for probabilistic real-time systems. This scheme consists of a probabilistic Worst Case Execution Time reshaping algorithm and a fixed priority scheduling strategy. It assigns a specific execution allowance to each task and schedules tasks under the Rate Monotonic policy. We present a schedulability analysis and show how to determine an appropriate execution allowance for each task. Evaluation shows that our proposed scheme can significantly outperform the existing approaches. (C) 2019 Elsevier Inc. All rights reserved.
Keywords:
Probabilistic
Fixed priority scheduling
Real-time systems
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.1
Papers:
5.4K
Citations:
8.4K
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSave
View more