Abstract
We now describe a refinement to the basic [BCL] procedure that was proposed by Lee and Shin, that uses response-times of tasks to further reduce potentially the size of the interval of interest that must be considered. Since these response-times are of course not known prior to performing schedulability analysis, the procedure takes on an iterative flavor—maximum (or minimum) values are estimated for response times of all tasks, and these estimated values are then used to iteratively decrease (or increase) the estimations. The details are described in Sect. 17.1 below. This test, which aggregates clever ideas from many prior tests into an integrated framework, appears to perform the best in schedulability experiments upon randomly generated workloads.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
A similar relation can be derived for systems without an integer time-domain, using a slightly more complex condition.
Author information
Authors and Affiliations
Corresponding author
Sources
Sources
The response-time analysis for global work-conserving schedulers and \(EDF\) has been presented in [58]. The reduction of the carry-in instances to consider, presented in Sect. 17.1.4, is from [123].
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Baruah, S., Bertogna, M., Buttazzo, G. (2015). Response Time Analysis: The [RTA] Test. In: Multiprocessor Scheduling for Real-Time Systems. Embedded Systems. Springer, Cham. https://doi.org/10.1007/978-3-319-08696-5_17
Download citation
DOI: https://doi.org/10.1007/978-3-319-08696-5_17
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-08695-8
Online ISBN: 978-3-319-08696-5
eBook Packages: EngineeringEngineering (R0)