NDLI: FPZL Schedulability Analysis

Content Provider	IEEE Xplore Digital Library
Author	Davis, R.I. Burns, A.
Copyright Year	2011
Abstract	This paper presents the Fixed Priority until Zero Laxity (FPZL) scheduling algorithm for multiprocessor realtime systems. FPZL is similar to global fixed priority preemptive scheduling, however, whenever a task reaches a state of zero laxity it is given the highest priority. FPZL is a minimally dynamic algorithm, in that the priority of a job can change at most once during its execution, bounding the number of pre-emptions. Polynomial time and pseudopolynomial time sufficient schedulability tests are derived for FPZL. These tests are then improved by computing upper bounds on the amount of execution that each task can perform in the zero laxity state. An empirical evaluation shows that FPZL is highly effective, with a significantly larger number of task sets deemed schedulable by the tests derived in this paper, than by state-of-the-art schedulability tests for Earliest Deadline until Zero Laxity (EDZL) scheduling.
Starting Page	245
Ending Page	256
File Size	439171
Page Count	12
File Format	PDF
ISBN	9781612843261
ISSN	10801812
DOI	10.1109/RTAS.2011.31
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2011-04-11
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Multiprocessor Upper bound Heuristic algorithms Real-time Interference Fixed priority Polynomials Scheduling Time factors FPZL Zero laxity Scheduling algorithm
Content Type	Text
Resource Type	Article

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

FPSL, FPCL and FPZL Schedulability Analysis

Fpcl and fpzl schedulability analysis.

FPZL Schedulability Analysis (2010)

Schedulability Analysis and Priority Assignment for Global Job-Level Fixed-Priority Multiprocessor Scheduling

Improved Schedulability Tests for Global Fixed-Priority Scheduling

Techniques for Schedulability Analysis in Mode Change Systems under Fixed-Priority Scheduling

Parametric Utilization Bounds for Fixed-Priority Multiprocessor Scheduling

Bounding Carry-in Interference to Improve Fixed-Priority Global Multiprocessor Scheduling Analysis

Improving the response time analysis of global fixed-priority multiprocessor scheduling

FPZL Schedulability Analysis

Similar Documents

FPSL, FPCL and FPZL Schedulability Analysis

Fpcl and fpzl schedulability analysis.

FPZL Schedulability Analysis (2010)

Schedulability Analysis and Priority Assignment for Global Job-Level Fixed-Priority Multiprocessor Scheduling

Improved Schedulability Tests for Global Fixed-Priority Scheduling

Techniques for Schedulability Analysis in Mode Change Systems under Fixed-Priority Scheduling

Parametric Utilization Bounds for Fixed-Priority Multiprocessor Scheduling

Bounding Carry-in Interference to Improve Fixed-Priority Global Multiprocessor Scheduling Analysis

Improving the response time analysis of global fixed-priority multiprocessor scheduling

FPZL Schedulability Analysis