NDLI: Feasibility analysis under fixed priority scheduling with limited preemptions

Content Provider	Springer Nature Link
Author	Yao, Gang Buttazzo, Giorgio Bertogna, Marko
Copyright Year	2011
Abstract	Preemptive scheduling often generates a significant runtime overhead that may increase task worst-case execution times up to 40%, with respect to a fully non-preemptive execution. In small embedded systems, such an extra cost results in longer and more variable response times that can significantly affect the overall energy consumption, as well as the system predictability. Limiting preemptions is often possible without jeopardizing schedulability. Although several authors addressed schedulability analysis under different forms of limited preemptive scheduling, current results exhibit two major deficiencies: (i) The maximum lengths of the non-preemptive regions for each task are still unknown under fixed priorities; (i) The exact response time analysis for tasks with fixed preemption points is too complex.This paper presents the schedulability analysis of real-time tasks with non-preemptive regions, under fixed priority assignments. In particular, two different preemption models are considered: the floating and the fixed preemption point model. Under each model, the feasibility analysis is addressed by deriving simple and effective schedulability tests, as well as an algorithm for computing the maximum length of the non-preemptive regions for each task. Finally, simulation experiments are presented to compare the two models in terms of schedulability.
Starting Page	198
Ending Page	223
Page Count	26
File Format	PDF
ISSN	09226443
Journal	Real-Time Systems
Volume Number	47
Issue Number	3
e-ISSN	15731383
Language	English
Publisher	Springer US
Publisher Date	2011-01-14
Publisher Place	Boston
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Limited preemption scheduling Schedulability analysis Fixed priority Performance and Reliability Special Purpose and Application-Based Systems Computer Systems Organization and Communication Networks Control , Robotics, Mechatronics Communications Engineering, Networks
Content Type	Text
Resource Type	Article
Subject	Control and Optimization Computer Networks and Communications Control and Systems Engineering Electrical and Electronic Engineering Computer Science Applications Modeling and Simulation

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Interference-aware fixed-priority schedulability analysis on multiprocessors

On-line schedulability tests for adaptive reservations in fixed priority scheduling

Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems

Response time analysis for fixed priority real-time systems with energy-harvesting

The limited-preemptive feasibility of real-time tasks on uniprocessors

FPSL, FPCL and FPZL schedulability analysis

Worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption

On the compatibility of exact schedulability tests for global fixed priority pre-emptive scheduling with Audsley’s optimal priority assignment algorithm

Non-migratory feasibility and migratory schedulability analysis of multiprocessor real-time systems

Feasibility analysis under fixed priority scheduling with limited preemptions

Similar Documents

Interference-aware fixed-priority schedulability analysis on multiprocessors

On-line schedulability tests for adaptive reservations in fixed priority scheduling

Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems

Response time analysis for fixed priority real-time systems with energy-harvesting

The limited-preemptive feasibility of real-time tasks on uniprocessors

FPSL, FPCL and FPZL schedulability analysis

Worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption

On the compatibility of exact schedulability tests for global fixed priority pre-emptive scheduling with Audsley’s optimal priority assignment algorithm

Non-migratory feasibility and migratory schedulability analysis of multiprocessor real-time systems

Feasibility analysis under fixed priority scheduling with limited preemptions