You are required to read and agree to the below before accessing a full-text version of an article in the IDE article repository.
The full-text document you are about to access is subject to national and international copyright laws. In most cases (but not necessarily all) the consequence is that personal use is allowed given that the copyright owner is duly acknowledged and respected. All other use (typically) require an explicit permission (often in writing) by the copyright owner.
For the reports in this repository we specifically note that
By accepting I agree to acknowledge and respect the rights of the copyright owner of the document I am about to access.
If you are in doubt, feel free to contact email@example.com
Limited pre-emptive scheduling has gained a lot of interest in the real-time community during the past years, motivated by their relative strength compared to existing fully-preemptive and non-pre-emptive schemes. As examples, compared to a fully pre-emptive scheme, limited pre-emptive schemes (i) reduce memory requirements and (ii) reduce the cost of arbitrary pre-emptions. Compared to both fully pre-emptive and non-preemptive schemes, these schemes may significantly improve the feasibility of a task set, even when pre-emption costs are ignored. This presentation reviews approaches for fixed-priority scheduling with limited pre-emptions and presents some recent advances.