Multiprocessor EDF and deadline monotonic schedulability analysis

被引：137

作者：

Baker, TP ^{[1
]}

机构：

[1] Florida State Univ, Dept Comp Sci, Tallahassee, FL 32306 USA

来源：

RTSS 2003: 24TH IEEE INTERNATIONAL REAL-TIME SYSTEMS SYMPOSIUM, PROCEEDINGS | 2003年

关键词：

D O I：

10.1109/REAL.2003.1253260

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Schedulability tests are presented for preemptive earliest-deadline-first and deadline-monotonic scheduling of periodic or sporadic real-time tasks on a single-queue m-server system, in which the deadline of a task may be less than or equal to the task period. These results sub-same and generalize several known utilization-based multiprocessor schedulability tests, and are derived via an independent proof.

引用

页码：120 / 129

页数：10

共 18 条

[1] ANDERSSON B, 2001, P IEEE REAL TIM SYST
[2] ANDERSSON B, 2000, P INT C REAL TIM COM
[3] STACK-BASED SCHEDULING OF REALTIME PROCESSES
BAKER, TP
[J]. REAL-TIME SYSTEMS, 1991, 3 (01) : 67 - 99
[4] BAKER TP, 2003, TR30301 FLOR STAT U
[5] BARUAH S, 2002, UNCCSTR02025
[6] DHALL SK, 1998, OPER RES, V26, P127
[7] *FLOR STAT U DEP C, 2003, TR030202 FLOR STAT U
[8] FUNK S, 2001, P IEEE REAL TIM SYST
[9] APERIODIC SERVERS IN A DEADLINE SCHEDULING ENVIRONMENT
GHAZALIE, TM
BAKER, TP
[J]. REAL-TIME SYSTEMS, 1995, 9 (01) : 31 - 67
[10] GOOSSENS J, IN PRESS REAL TIME S

← 1 2 →