FPZL Schedulability Analysis
R.I. Davis and A. Burns
This paper presents the FPZL scheduling algorithm 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. FPZL is a minimally dynamic algorithm, in that the priority of a job can change at most once during its execution. Polynomial time and pseudo-polynomial 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 tasksets deemed schedulable by the tests derived in this paper, than by stateof- the-art schedulability tests for EDZL scheduling.
BibTex Entry
@techreport{Davis2010a,
author = {R.I. Davis and A. Burns},
institution = {University of York, Department of Computer Science},
month = {April},
number = {YCS-2010-452},
title = {FPZL Schedulability Analysis},
year = {2010}
}