NDLI: FPSL, FPCL and FPZL schedulability analysis

Content Provider	Springer Nature Link
Author	Davis, Robert I. Kato, Shinpei
Copyright Year	2012
Abstract	This paper presents the Fixed Priority until Static Laxity (FPSL), Fixed Priority until Critical Laxity (FPCL) and Fixed Priority until Zero Laxity (FPZL) scheduling algorithms for multiprocessor real-time systems. FPZL is similar to global fixed priority pre-emptive scheduling; however, whenever a task reaches a state of zero laxity it is given the highest priority. FPSL and FPCL are variants of FPZL that introduce no additional scheduling points beyond those present with fixed priority scheduling. FPSL, FPCL and FPZL are minimally dynamic algorithms, in that the priority of a job can change at most once during its execution, bounding the number of pre-emptions.Polynomial time and pseudo-polynomial time sufficient schedulability tests are derived for these algorithms. The tests are then improved by computing upper bounds on the amount of execution that each task can perform at the highest priority. An empirical evaluation shows that FPSL, FPCL, and FPZL are highly effective, with a significantly larger number of tasksets deemed schedulable by the tests derived in this paper, than by state-of-the-art schedulability tests for EDZL scheduling.
Starting Page	750
Ending Page	788
Page Count	39
File Format	PDF
ISSN	09226443
Journal	Real-Time Systems
Volume Number	48
Issue Number	6
e-ISSN	15731383
Language	English
Publisher	Springer US
Publisher Date	2012-03-24
Publisher Place	Boston
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Real-time Schedulability analysis Fixed priority Zero laxity Critical laxity FPSL FPCL FPZL Global scheduling Multiprocessor Performance and Reliability Control, Robotics, Mechatronics Special Purpose and Application-Based Systems Communications Engineering, Networks Computer Systems Organization and Communication 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

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

Laxity dynamics and LLF schedulability analysis on multiprocessor platforms

Feasibility analysis under fixed priority scheduling with limited preemptions

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

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

A pre-order relation for exact schedulability test of sporadic tasks on multiprocessor Global Fixed-Priority scheduling

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

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

FPSL, FPCL and FPZL schedulability analysis

Similar Documents

Interference-aware fixed-priority schedulability analysis on multiprocessors

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

Laxity dynamics and LLF schedulability analysis on multiprocessor platforms

Feasibility analysis under fixed priority scheduling with limited preemptions

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

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

A pre-order relation for exact schedulability test of sporadic tasks on multiprocessor Global Fixed-Priority scheduling

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

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

FPSL, FPCL and FPZL schedulability analysis