FEASIBILITY PROBLEMS FOR RECURRING TASKS ON ONE PROCESSOR

被引：44

作者：

BARUAH, SK

HOWELL, RR

ROSIER, LE

机构：

[1] KANSAS STATE UNIV AGR & APPL SCI,DEPT COMP & INFORMAT SCI,MANHATTAN,KS 66506

[2] UNIV VERMONT,DEPT ELECT ENGN & COMP SCI,BURLINGTON,VT 05405

[3] UNIV TEXAS,DEPT COMP SCI,AUSTIN,TX 78712

来源：

THEORETICAL COMPUTER SCIENCE | 1993年 / 118卷 / 01期

基金：

美国国家科学基金会;

关键词：

D O I：

10.1016/0304-3975(93)90360-6

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We give a comprehensive summary of our recent research on the feasibility problems for various types of hard-real-time preemptive task systems on one processor. We include results on periodic, sporadic, and hybrid task systems. While many of the results herein have appeared elsewhere, this is the first paper presenting a holistic view of the entire problem.

引用

页码：3 / 20

页数：18

共 19 条

[1]

[Anonymous], 1971, STOC 71, DOI DOI 10.1145/800157.805047

[2]

Baruah S. K., 1990, 11TH P REAL TIM SYST, P182

[3] 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

[4]

Dertouzos Michael, 1974, P IFIP C, P807

[5]

Garey M.R., 1979, COMPUTERS INTRACTABI, V174

[6]

Hong K. S., 1988, Proceedings. Real-Time Systems Symposium (IEEE Cat. No.88CH2618-7), P244, DOI 10.1109/REAL.1988.51119

[7]

JEFFAY K, 1991, 12 IEEE S REAL TIM S, P129, DOI DOI 10.1109/REAL.1991.160366

[8]

Karp R.M., 1972, COMPLEXITY COMPUTER, P85

[9]

Knuth D.E., 1981, ART COMPUTER PROGRAM, V2

[10]

Labetoulle J., 1974, Computer Architectures and Networks, P285

← 1 2 →