The non-preemptive scheduling of periodic tasks upon multiprocessors

被引：72

作者：

Baruah, SK ^{[1
]}

机构：

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

来源：

REAL-TIME SYSTEMS | 2006年 / 32卷 / 1-2期

基金：

美国国家科学基金会;

关键词：

non-preemptive scheduling; periodic tasks; multiprocessor systems; earliest-deadline first; feasibility analysis;

D O I：

10.1007/s11241-006-4961-9

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

The non-preemptive scheduling of periodic task systems upon processing platforms comprised of several identical processors is considered. The exact problem has previously been proven intractable even upon single processors; sufficient conditions are presented here for determining whether a given periodic task system will meet all deadlines if scheduled non-preemptively upon a multiprocessor platform using the earliest-deadline first scheduling algorithm.

引用

页码：9 / 20

页数：12

共 15 条

[1] ABDELZAHER T, 2002, P 8 IEEE REAL TIM EM
[2] ANDERSON J, 2001, P EUR C REAL TIM SYS
[3] ANDERSON J, 2002, P INT C REAL TIM COM
[4] ANDERSON J, 2002, P EUR C REAL TIM SYS, P35
[5] [Anonymous], J ACM
[6] BARUAH S, 1998, IEEE T COMPUTERS, V47
[7] Baruah SK, 1996, ALGORITHMICA, V15, P600, DOI 10.1007/BF01940883
[8] Nonpreemptive scheduling of periodic tasks in uni- and multiprocessor systems
Cai, Y
Kong, MC
[J]. ALGORITHMICA, 1996, 15 (06) : 572 - 599
[9] Davari S., 1986, Proceedings of the Real-Time Systems Symposium (Cat. No.86CH2351-5), P194
[10] Priority-driven scheduling of periodic task systems on multiprocessors
Goossens, J
Funk, S
Baruah, S
[J]. REAL-TIME SYSTEMS, 2003, 25 (2-3) : 187 - 205

← 1 2 →