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
相关论文
共 13 条
[1]   Multiprocessor EDF and deadline monotonic schedulability analysis [J].
Baker, TP .
RTSS 2003: 24TH IEEE INTERNATIONAL REAL-TIME SYSTEMS SYMPOSIUM, PROCEEDINGS, 2003, :120-129
[2]  
BAKER TP, 2006, INT C REAL TIM NETW, P119
[3]  
BAKER TP, 2006, P 27 IEEE REAL TIM S
[4]   Sustainable scheduling analysis [J].
Baruah, Sanjoy ;
Burns, Alan .
27TH IEEE INTERNATIONAL REAL-TIME SYSTEMS SYMPOSIUM, PROCEEDINGS, 2006, :159-+
[5]  
BARUAH SK, 1993, P ACM S THEOR COMP
[6]  
BERTOGNA M, 2005, P 17 EUR C REAL TIM
[7]  
Cho H., 2006, P 27 IEEE INT REAL T
[8]  
Cho S, 2002, IEICE T COMMUN, VE85B, P2859
[9]   Priority-driven scheduling of periodic task systems on multiprocessors [J].
Goossens, J ;
Funk, S ;
Baruah, S .
REAL-TIME SYSTEMS, 2003, 25 (2-3) :187-205
[10]  
HA R, 1994, INT CON DISTR COMP S, P162