The partitioned dynamic-priority scheduling of sporadic task systems

被引:29
作者
Baruah, Sanjoy K. [1 ]
Fisher, Nathan Wayne [1 ]
机构
[1] Univ N Carolina, Dept Comp Sci, Chapel Hill, NC 27599 USA
关键词
sporadic tasks; partitioned scheduling; multiprocessors;
D O I
10.1007/s11241-007-9022-5
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
A polynomial-time algorithm is presented for partitioning a collection of sporadic tasks among the processors of an identical multiprocessor platform. Since the partitioning problem is NP-hard in the strong sense, this algorithm is unlikely to be optimal. A quantitative characterization of its worst-case performance is provided in terms of resource augmentation.
引用
收藏
页码:199 / 226
页数:28
相关论文
共 22 条
[1]   An event stream driven approximation for the analysis of real-time systems [J].
Albers, K ;
Slomka, F .
16TH EUROMICRO CONFERENCE ON REAL-TIME SYSTEMS, PROCEEDINGS, 2004, :187-195
[2]  
[Anonymous], 2005, TR050601 FLOR STAT U
[3]  
[Anonymous], 1973, THESIS MIT
[4]  
Audsley N. C., 1993, Control Engineering Practice, V1, P71, DOI 10.1016/0967-0661(93)92105-D
[5]   Analysis of EDF schedulability on a multiprocessor [J].
Baker, TP .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2005, 16 (08) :760-768
[6]   Multiprocessor EDF and deadline monotonic schedulability analysis [J].
Baker, TP .
RTSS 2003: 24TH IEEE INTERNATIONAL REAL-TIME SYSTEMS SYMPOSIUM, PROCEEDINGS, 2003, :120-129
[7]  
BAKER TP, 2006, P INT C REAL TIME NE
[8]  
BARUAH S, 1990, P 11 REAL TIME SYSTE
[9]   Improved schedulability analysis of EDF on multiprocessor platforms [J].
Bertogna, M ;
Cirinei, M ;
Lipari, G .
17TH EUROMICRO CONFERENCE ON REAL-TIME SYSTEMS, PROCEEDINGS, 2005, :209-218
[10]  
BERTOGNA M, 2005, P 9 INT C PRINC DIST