EDZL scheduling analysis

被引：36

作者：

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 条

[31] AUTOMATION OF THE SCHEDULING ANALYSIS PROCESS [J].

SPENCER, GR ;

RAHBAR, FF .

33RD ANNUAL MEETING OF THE AMERICAN ASSOCIATION OF COST ENGINEERS, 1989, :113-117

[32] Probabilistic analysis for scheduling with conflicts [J].

Irani, Sandy ;

Leung, Vitus .

THEORETICAL COMPUTER SCIENCE, 2008, 396 (1-3) :158-179

[33] ON A SCHEDULING PROBLEM IN SEQUENTIAL ANALYSIS [J].

EHRENFELD, S .

ANNALS OF MATHEMATICAL STATISTICS, 1970, 41 (04) :1206-+

[34] Grid Scheduling for Interactive Analysis [J].

Germain-Renaud, Cecile ;

Texier, Romain ;

Osorio, Angel ;

Loomis, Charles .

CHALLENGES AND OPPORTUNITIES OF HEALTHGRIDS, 2006, 120 :25-+

[35] SCHEDULING AND ANALYSIS OF PROCESS EVENTS [J].

HIRSCH, GB ;

BLUMENTHAL, MM .

JOURNAL OF THE AMERICAN OIL CHEMISTS SOCIETY, 1985, 62 (04) :616-616

[36] Sensitivity analysis for scheduling problems [J].

Hall, NG ;

Posner, ME .

JOURNAL OF SCHEDULING, 2004, 7 (01) :49-83

[37] Probabilistic analysis for scheduling with conflicts [J].

Irani, S ;

Leung, V .

PROCEEDINGS OF THE EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1997, :286-295

[38] SCHEDULING ANALYSIS, MODELING AND PRICING [J].

GIAMBALVO, F ;

VIGNAZIA, D .

ELECTRICAL COMMUNICATION, 1986, 60 (3-4) :308-313

[39] Analysis of Linux scheduling with VAMPIR [J].

Kluge, Michael ;

Nagel, Wolfgang E. .

COMPUTATIONAL SCIENCE - ICCS 2007, PT 2, PROCEEDINGS, 2007, 4488 :823-+

[40] NETWORK ANALYSIS FOR PLANNING AND SCHEDULING [J].

LAW, CE .

OPERATIONS RESEARCH, 1966, 14 (03) :543-&

← 1 2 3 4 5 →