New Response Time Bounds for Fixed Priority Multiprocessor Scheduling

Download Now
Provided by: Uppror Media Group
Topic: Hardware
Format: PDF
Recently, there have been several promising techniques developed for schedulability analysis and response time analysis for multiprocessor systems based on over-approximation. This paper contains two contributions. First, to improve the analysis precision, the authors apply Baruah's window analysis framework to response time analysis for sporadic tasks on multiprocessor systems where the deadlines of tasks are within their periods. The crucial observation is that for global fixed priority scheduling, a response time bound of each task can be efficiently estimated by fixed-point computation without enumerating all the busy window sizes as in for schedulability analysis.
Download Now

Find By Topic