Optimal Selection of Preemption Points to Minimize Preemption Overhead

Bertogna, Marko; Xhani, Orges; Marinoni, Mauro; Esposito, Francesco; Buttazzo, Giorgio

doi:10.1109/ecrts.2011.28

Cited by 66 publications

(71 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…3.4. We have therefore generated system configurations so that (i) the results for FPTS ignoring inter-task CRPD match those in Bertogna et al (2011bBertogna et al ( , 2012 and (ii) the results for FPPS with CRPD match…”

Section: Discussionmentioning

confidence: 99%

“…In particular, fixed-priority scheduling with deferred pre-emption (FPDS) (Burns 1994;Bril et al 2009;Davis and Bertogna 2012), also called cooperative scheduling, and fixed-priority scheduling with pre-emption thresholds (FPTS) (Wang and Saksena 1999;Saksena and Wang 2000;Regehr 2002;Keskin et al 2010) are considered viable alternatives between the extremes of fully pre-emptive and non-pre-emptive scheduling. Compared to fully pre-emptive scheduling, limited preemptive schemes can (i) reduce memory requirements (Saksena and Wang 2000;Gai et al 2001;Davis et al 2000) and (ii) reduce the cost of arbitrary pre-emptions (Burns 1994;Bril et al 2009;Bertogna et al 2011b). In addition, compared to both FPPS and non-pre-emptive scheduling, these schemes may significantly improve the schedulability of a task set (Bril et al 2009;Saksena and Wang 2000;Bertogna et al 2011a;Davis and Bertogna 2012).…”

Section: Limited Pre-emptive Schedulingmentioning

confidence: 99%

“…Bertogna et al (2011b) presented a model based on constant pre-emption costs in order to place pre-emption points in the tasks' code appropriately. Recently, Cavicchio et al (2015) have further extended this work by placing pre-emption points after computing and optimizing the CRPDs of a task.…”

Section: Limited Pre-emptive Schedulingmentioning

confidence: 99%

See 2 more Smart Citations

Fixed priority scheduling with pre-emption thresholds and cache-related pre-emption delays: integrated analysis and evaluation

et al. 2017

View full text Add to dashboard Cite

Commercial off-the-shelf programmable platforms for real-time systems typically contain a cache to bridge the gap between the processor speed and main memory speed. Because cache-related pre-emption delays (CRPD) can have a significant influence on the computation times of tasks, CRPD have been integrated in the response time analysis for fixed-priority pre-emptive scheduling (FPPS). This paper presents CRPD aware response-time analysis of sporadic tasks with arbitrary deadlines for fixed-priority pre-emption threshold scheduling (FPTS), generalizing earlier work. The analysis is complemented by an optimal (pre-emption) threshold assignment algorithm, assuming the priorities of tasks are given. We further improve upon these results by presenting an algorithm that searches for a layout of tasks in memory that makes a task set schedulable. The paper includes an extensive comparative evaluation of the schedulability ratios of FPPS and FPTS, taking CRPD into account. The practical relevance of our work stems from FPTS support in AUTOSAR, a standardized development model for the automotive industry. Keywords Fixed-priority pre-emptive scheduling · Fixed-priority scheduling with pre-emption thresholds · Cache-related pre-emption delay · Response-time analysis B Reinder J. Bril

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Limited Pre-emptive Schedulingmentioning

confidence: 99%

See 1 more Smart Citation

Fixed priority scheduling with pre-emption thresholds and cache-related pre-emption delays: integrated analysis and evaluation

et al. 2017

View full text Add to dashboard Cite

show abstract

“…We refer to [13] for a complete survey on the existing approaches based on limited preemptive scheduling. Optimized preemption point placement techniques [17], [18] have also been proposed in the literature to reduce the cost of preemption related overheads incurred by a task.…”

Section: Related Workmentioning

confidence: 99%

Response-Time Analysis of DAG Tasks under Fixed Priority Scheduling with Limited Preemptions

Serrano

Melani

Bertogna

et al. 2016

Proceedings of the 2016 Design, Automation &Amp; Test in Europe Conference &Amp; Exhibition (DATE)

Self Cite

View full text Add to dashboard Cite

Abstract-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.

show abstract

“…Subsequently, Bertogna et al integrated pre-emption costs and cache related pre-emption delays (CRPD) into analysis of the fixed model, considering both fixed [14] and variable [15] pre-emption costs. In 2011, Bertogna et al [16] derived a method for computing the optimal FNR length of each task in order to maximize schedulability assuming a given priority assignment.…”

Section: A Deferred Pre-emptionmentioning

confidence: 99%

Global fixed priority scheduling with deferred pre-emption

Davis

Burns

Marinho

et al. 2013

2013 IEEE 19th International Conference on Embedded and Real-Time Computing Systems and Applications

View full text Add to dashboard Cite

Abstract-This paper introduces schedulability analysis for global fixed priority scheduling with deferred pre-emption (gFPDS) for homogeneous multiprocessor systems. gFPDS is a superset of global fixed priority pre-emptive scheduling (gFPPS) and global fixed priority non-pre-emptive scheduling (gFPNS). We show how schedulability can be improved via appropriate choice of priority assignment and final non-pre-emptive region lengths, and we provide algorithms which optimize schedulability in this way. An experimental evaluation shows that gFPDS significantly outperforms both gFPPS and gFPNS. I.INTRODUCTION A common misconception with regard to fixed priority scheduling of sporadic tasks is that fully pre-emptive scheduling is more effective in terms of schedulability than non-pre-emptive scheduling. The two are however incomparable; there are tasksets that are schedulable under fixed priority non-pre-emptive scheduling that are not schedulable under fixed priority pre-emptive scheduling and vice-versa. This is the case for uniprocessor scheduling [27] and also the case for global multiprocessor scheduling [30], which is the focus of this paper.While the blocking effect, due to long non-pre-emptive regions of low priority tasks degrades schedulability for single processor systems that have a wide range of task execution times and periods (as illustrated by Figure 7 in [27]), Guan et al. [30] showed that the same is not necessarily true for multiprocessor systems. With m processors rather than one, long non-pre-emptive regions can be accommodated without necessarily compromising the schedulability of higher priority tasks. However, this advantage only extends so far; with m processors then m long non-pre-emptive regions are enough to significantly compromise schedulability. In this context, limited non-preemptive execution has the advantage of reducing the number of pre-emptions, and potentially improving the worst-case response time of tasks, while also keeping blocking effects on higher priority tasks within tolerable limits.In the literature, the term fixed priority scheduling with deferred pre-emption has been used to refer to a variety of different techniques by which pre-emptions may be deferred for some interval of time after a higher priority task becomes ready. These are described in a survey by Buttazzo et al. [21] and briefly discussed in Section II. In this paper, we assume a simple form of fixed priority scheduling with deferred preemption where each task has a single non-pre-emptive region at the end of its execution. If this region is of the minimum possible length for all tasks, then we have fully pre-emptive scheduling, whereas if it constitutes all of the task's execution time then we have non-pre-emptive scheduling.In this paper, we introduce sufficient schedulability tests for global fixed priority scheduling with deferred pre-

show abstract

Optimal Selection of Preemption Points to Minimize Preemption Overhead

Cited by 66 publications

References 30 publications

Fixed priority scheduling with pre-emption thresholds and cache-related pre-emption delays: integrated analysis and evaluation

Fixed priority scheduling with pre-emption thresholds and cache-related pre-emption delays: integrated analysis and evaluation

Response-Time Analysis of DAG Tasks under Fixed Priority Scheduling with Limited Preemptions

Global fixed priority scheduling with deferred pre-emption

Contact Info

Product

Resources

About