Response-time analysis of limited-preemptive parallel DAG tasks under global scheduling

Most recurrent real-time applications can be modeled as a set of sequential code segments (or blocks) that must be (repeatedly) executed in a specific order. This paper provides a schedulability analysis for such systems modeled as a set of parallel DAG tasks executed under any limited-preemptive global job-level fixed priority scheduling...

Schedulability analysis of globally scheduled preemptive applications

For any real-time system, being predictable with respect to time is a basic necessity. The combination of a preemptive execution model and a multiprocessor platform poses a challenge when analysing the predictability of a system. In this thesis, we present a new type of framework for the worst-case response time analysis for preemptive tasks...