Non-migratory feasibility and migratory schedulability analysis of multiprocessor real-time systems

被引：4

作者：

Baruah, Sanjoy ^{[1
]}

Fisher, Nathan ^{[1
]}

机构：

[1] Univ N Carolina, Dept Comp Sci, Chapel Hill, NC 27599 USA

来源：

REAL-TIME SYSTEMS | 2008年 / 39卷 / 1-3期

基金：

美国国家科学基金会;

关键词：

multiprocessor platforms; feasibility analysis; schedulability analysis; sufficient conditions; fixed-priority scheduling; recurrent tasks;

D O I：

10.1007/s11241-006-9009-7

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

The multiprocessor scheduling of collections of real-time jobs is considered. Sufficient tests are derived for feasibility analysis of a collection of sporadic jobs where job migration between processors is forbidden. The fixed-priority scheduling of real-time jobs with job migration is analyzed, and sufficient tests of schedulability are obtained for the deadline-monotonic (DM) and the earliest-deadline-first (EDF) scheduling algorithms. The feasibility and schedulability tests of this paper may be applied even when the collection of jobs is incompletely specified. The applicability of these tests to the scheduling of collections of jobs that are generated by systems of recurrent real-time tasks is discussed. In particular, sufficient conditions for the DM scheduling of sporadic task systems are derived and compared to previously-known tests.

引用

页码：97 / 122

页数：26

共 24 条

[1] A utilization bound for aperiodic tasks and priority driven scheduling
Abdelzaher, TF
Sharma, V
Lu, CY
[J]. IEEE TRANSACTIONS ON COMPUTERS, 2004, 53 (03) : 334 - 350
[2] An event stream driven approximation for the analysis of real-time systems
Albers, K
Slomka, F
[J]. 16TH EUROMICRO CONFERENCE ON REAL-TIME SYSTEMS, PROCEEDINGS, 2004, : 187 - 195
[3] Baker T., 2003, TR030201 FLOR STAT U
[4] An analysis of fixed-priority schedulability on a multiprocessor
Baker, TP
[J]. REAL-TIME SYSTEMS, 2006, 32 (1-2) : 49 - 71
[5] Generalized multiframe tasks
Baruah, S
Chen, DJ
Gorinsky, S
Mok, A
[J]. REAL-TIME SYSTEMS, 1999, 17 (01) : 5 - 22
[6] BARUAH S, 2005, P WORKSH COMP RUNT T
[7] ALGORITHMS AND COMPLEXITY CONCERNING THE PREEMPTIVE SCHEDULING OF PERIODIC, REAL-TIME TASKS ON ONE PROCESSOR
BARUAH, SK
ROSIER, LE
HOWELL, RR
[J]. REAL-TIME SYSTEMS, 1990, 2 (04) : 301 - 324
[8] Dynamic- and static-priority scheduling of recurring real-time tasks
Baruah, SK
[J]. REAL-TIME SYSTEMS, 2003, 24 (01) : 93 - 128
[9] BARUAH SK, 1990, PROCEEDINGS : 11TH REAL-TIME SYSTEMS SYMPOSIUM, P182, DOI 10.1109/REAL.1990.128746
[10] BERTOGNA M, 2005, P 9 INT C PRINC DIST

← 1 2 3 →