Dynamic- and static-priority scheduling of recurring real-time tasks

被引：115

作者：

Baruah, SK ^{[1
]}

机构：

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

来源：

REAL-TIME SYSTEMS | 2003年 / 24卷 / 01期

基金：

美国国家科学基金会;

关键词：

hard-real-time scheduling; conditional code; dynamic priorities; static priorities; feasibility analysis;

D O I：

10.1023/A:1021711220939

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 [计算机软件与理论];

摘要：

The recurring real-time task model for hard-real-time task is studied from a feasibility-analysis perspective. This model generalizes earlier models such as the sporadic task model and the generalized multiframe task model. Algorithms are presented for the static-priority and dynamic-priority feasibility-analysis of systems of independent recurring real-time tasks in a preemptive uniprocessor environment.

引用

页码：93 / 128

页数：36

共 17 条

[1]

AUDSLEY N, 1993, P 5 EUR WORKSH REAL, P36

[2]

Audsley N.C., 1991, P 8 IEEE WORKSH REAL

[3]

Generalized multiframe tasks [J].

Baruah, S ;

Chen, DJ ;

Gorinsky, S ;

Mok, A .

REAL-TIME SYSTEMS, 1999, 17 (01) :5-22

[4]

Feasibility analysis of recurring branching tasks [J].

Baruah, SK .

10TH EUROMICRO WORKSHOP ON REAL-TIME SYSTEMS, PROCEEDINGS, 1998, :138-145

[5]

A general model for recurring real-time tasks [J].

Baruah, SK .

19TH IEEE REAL-TIME SYSTEMS SYMPOSIUM, PROCEEDINGS, 1998, :114-122

[6]

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

[7]

BURNS A, 1997, REAL TIME SYSTEMS PR

[8]

Buttazzo G., 1997, HARD REAL TIME COMPU

[9]

CARRE B, 1979, OXFORD APPL MATH COM

[10]

Dertouzos M. L., 1974, IFIP C, P807

← 1 2 →