EDZL scheduling analysis

被引：35
作者：
Cirinei, Michele [1 ]
Baker, Theodore P. [2 ]
机构：
[1] Scuola Super Sant Anna, Pisa, Italy
[2] Florida State Univ, Dept Comp Sci, Tallahassee, FL 32306 USA
来源：
19TH EUROMICRO CONFERENCE ON REAL-TIME SYSTEMS, PROCEEDINGS | 2007年
基金：
美国国家科学基金会;
关键词：
D O I：
10.1109/ECRTS.2007.14
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
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.
引用
收藏
页码：9 / +
页数：2
相关论文
共 50 条
[21]   MODELING OF SUPERSCALAR INSTRUCTION SCHEDULING AND ANALYSIS OF A HEURISTIC SCHEDULING ALGORITHM [J].
CHOU, HC ;
CHUNG, CP .
BIT, 1993, 33 (03) :354-371
[22]   Statistical analysis of WCET for scheduling [J].
Edgar, S ;
Burns, A .
22ND IEEE REAL-TIME SYSTEMS SYMPOSIUM, PROCEEDINGS, 2001, :215-224
[23]   An Analysis of Totally Clairvoyant Scheduling [J].
K. Subramani .
Journal of Scheduling, 2005, 8 :113-133
[24]   ANALYSIS OF SCHEDULING RULES FOR AN FMS [J].
MONTAZERI, M ;
VANWASSENHOVE, LN .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1990, 28 (04) :785-802
[25]   Sensitivity analysis of scheduling algorithms [J].
Penz, B ;
Rapine, C ;
Trystram, D .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2001, 134 (03) :606-615
[26]   An analysis of totally clairvoyant scheduling [J].
Subramani, K .
JOURNAL OF SCHEDULING, 2005, 8 (02) :113-133
[27]   ON A SCHEDULING PROBLEM IN SEQUENTIAL ANALYSIS [J].
EHREFELD, S .
ANNALS OF MATHEMATICAL STATISTICS, 1968, 39 (04) :1368-&
[28]   NETWORK ANALYSIS FOR PLANNING AND SCHEDULING [J].
FINE, B .
TRANSACTIONS OF THE INSTITUTION OF CHEMICAL ENGINEERS AND THE CHEMICAL ENGINEER, 1965, 43 (01) :CE31-&
[29]   Probabilistic analysis for scheduling with conflicts [J].
Irani, Sandy ;
Leung, Vitus .
THEORETICAL COMPUTER SCIENCE, 2008, 396 (1-3) :158-179
[30]   ON A SCHEDULING PROBLEM IN SEQUENTIAL ANALYSIS [J].
EHRENFELD, S .
ANNALS OF MATHEMATICAL STATISTICS, 1970, 41 (04) :1206-+
12345