Response-time analysis of DAG tasks under fixed priority scheduling with limited preemptions
Document typeConference report
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Rights accessOpen Access
European Commisision's projectP-SOCRATES - Parallel SOftware framework for time-CRitical mAny-core sysTEmS (EC-FP7-611016)
Limited preemptive (LP) scheduling has been demonstrated to effectively improve the schedulability of fully preemptive (FP) and fully non-preemptive (FNP) paradigms. On one side, LP reduces the preemption related overheads of FP; on the other side, it restricts the blocking effects of FNP. However, LP has been applied to multi-core scenarios only when completely sequential task systems are considered. This paper extends the current state-of-the-art response time analysis for global fixed priority scheduling with fixed preemption points by deriving a new response time analysis for DAG-based task-sets.
CitationSerrano, Maria A. [et al.]. Response-time analysis of DAG tasks under fixed priority scheduling with limited preemptions. A: Design, Automation & Test in Europe Conference & Exhibition (DATE), 14-18 March 2016, Dresden. "2016 Design, Automation & Test in Europe Conference & Exhibition (DATE)". Dresden: Institute of Electrical and Electronics Engineers (IEEE), 2016, p. 1066-1071.