Open problems in real-time scheduling

被引：16

作者：

Baruah, Sanjoy ^{[2
]}

Pruhs, Kirk ^{[1
]}

机构：

[1] Univ Pittsburgh, Dept Comp Sci, Pittsburgh, PA 15260 USA

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

来源：

JOURNAL OF SCHEDULING | 2010年 / 13卷 / 06期

基金：

美国国家科学基金会;

关键词：

Real-time scheduling; Open problems; ALGORITHMS; HARD;

D O I：

10.1007/s10951-009-0137-5

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

We state some of the most important open algorithmic problems in real-time scheduling, and survey progress made on these problems since the 2009 Dagstuhl scheduling seminar.

引用

页码：577 / 582

页数：6

共 12 条

[1] ALGORITHMS AND COMPLEXITY CONCERNING THE PREEMPTIVE SCHEDULING OF PERIODIC, REAL-TIME TASKS ON ONE PROCESSOR [J].

BARUAH, SK ;

ROSIER, LE ;

HOWELL, RR .

REAL-TIME SYSTEMS, 1990, 2 (04) :301-324

[2]

BARUAH SK, 1990, PROCEEDINGS : 11TH REAL-TIME SYSTEMS SYMPOSIUM, P182, DOI 10.1109/REAL.1990.128746

[3]

BONIFACI V, 2008, EUR S ALG, P210

[4]

BONIFACI V, 2010, AMC SIAM S DISCR ALG

[5]

Dertouzos M.L., 1974, 39 Proceedings of the IFIP Congress, P807

[6]

EISENBRAND F, 2008, INT C AUT LANG PROGR, P246

[7]

EISENBRAND F, 2010, ACM SIAM S ALG

[8] Static-priority Real-time Scheduling: Response Time Computation is NP-hard [J].

Eisenbrand, Friedrich ;

Rothvoss, Thomas .

RTSS: 2008 REAL-TIME SYSTEMS SYMPOSIUM, PROCEEDINGS, 2008, :397-406

[9]

George L, 1996, Research reportRR-2966

[10]

KARRENBAUER A, 2009, EUR S ALG

← 1 2 →