Tunable Response Time Upper Bound for Fixed Priority Real-Time Systems
Q. Lu, A.M.K. Cheng and R.I. Davis
In exact response time analysis, determining the interference from higher priority tasks requires the ceiling operation, which is time-consuming. Enhanced Audsley's Algorithm (EAA) divides the set of tasks into two groups and uses different forms to indicate the time contribution, improves the efficiency. An important problem is how to separate the tasks. This paper presents a method to demarcate the tasks of higher priority. We first split these tasks by the approximation Fisher and Baruah have defined, which introduced a parameter k, and formalized the precision tunable exact response time algorithm. Furthermore, we develop this algorithm into a response time upper bound with precision-adjustability.
Download Not Available
BibTex Entry
@inproceedings{Lu2015,
author = {Q. Lu and A.M.K. Cheng and R.I. Davis},
booktitle = {Work-in-Progress, Real-Time and embedded technology and Applications Symposium (RTAS)},
month = {April},
pages = {23-24},
title = {Tunable Response Time Upper Bound for Fixed Priority Real-Time Systems},
year = {2015}
}