EDZL Scheduling Analysis

Author

Cirinei, Michele ; Baker, Theodore P.

Author_Institution

Scuola Superiore Sant´´Anna, Sant´´Anna

fYear

2007

fDate

4-6 July 2007

Firstpage

9

Lastpage

18

Abstract

A schedulability test is derived for the global earliest deadline zero laxity (EDZL) scheduling algorithm on a platform with multiple identical processors. The test is sufficient, but not necessary, to guarantee that a system of independent sporadic tasks with arbitrary deadlines will be successfully scheduled, with no missed deadlines, by the multiprocessor EDZL algorithm. Global EDZL is known to be at least as effective as global earliest-deadline-first (EDF) in scheduling task sets to meet deadlines. It is shown, by testing on large numbers of pseudo-randomly generated task sets, that the combination of EDZL and the new schedulability test is able to guarantee that far more task sets meet deadlines than the combination of EDF and known EDF schedulability tests.

Keywords

processor scheduling; EDZL scheduling analysis; earliest deadline zero laxity scheduling algorithm; global EDZL; multiple identical processors; multiprocessor EDZL algorithm; pseudo-randomly generated task sets; schedulability test; Algorithm design and analysis; Computer science; Delay; Hybrid power systems; Optimal scheduling; Processor scheduling; Real time systems; Scheduling algorithm; Switches; System testing;

fLanguage

English

Publisher

ieee

Conference_Titel

Real-Time Systems, 2007. ECRTS '07. 19th Euromicro Conference on

Conference_Location

Pisa

ISSN

1068-3070

Print_ISBN

0-7695-2914-3

Type

conf

DOI

10.1109/ECRTS.2007.14

Filename

4271676