Generalized multiframe tasks

被引：147

作者：

Baruah, S ^{[1
]}

Chen, DJ

Gorinsky, S

Mok, A

机构：

[1] Univ Vermont, Burlington, VT 05405 USA

[2] Univ Texas, Austin, TX 78712 USA

[3] New Jersey Inst Technol, Newark, NJ 07102 USA

来源：

REAL-TIME SYSTEMS | 1999年 / 17卷 / 01期

关键词：

recurring multiframe tasks; preemptive uniprocessor scheduling; hard deadlines; feasibility analysis;

D O I：

10.1023/A:1008030427220

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

A new model for sporadic task systems is introduced. This model-the generalized multiframe task model-further generalizes both the conventional sporadic-tasks model, and the more recent multiframe model of Mok and Chen. A framework for determining feasibility for a wide variety of task systems is established; this framework is applied to this task model to obtain a feasibility-testing algorithm that runs in time pseudo-polynomial in the size of the input for all systems of such tasks whose densities are bounded by a constant less than one.

引用

页码：5 / 22

页数：18

共 9 条

[1]

BARUAH S, 1993, THESIS U TEXAS AUSTI

[2]

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

[3]

Buttazzo G., 1997, HARD REAL TIME COMPU

[4]

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

[5]

JEFFAY K, 1991, PROCEEDING : TWELFTH REAL-TIME SYSTEMS SYMPOSIUM, P129, DOI 10.1109/REAL.1991.160366

[6]

JEFFAY K, 1993, REAL-TIME SYSTEMS SYMPOSIUM: PROCEEDINGS, P212, DOI 10.1109/REAL.1993.393497

[7] SCHEDULING ALGORITHMS FOR MULTIPROGRAMMING IN A HARD-REAL-TIME ENVIRONMENT [J].

LIU, CL ;

LAYLAND, JW .

JOURNAL OF THE ACM, 1973, 20 (01) :46-61

[8]

Mok A. K., 1996, P 17 REAL TIM SYST S

[9]

Mok A.K.-L., 1983, Fundamental Design Problems of Distributed Systems for the HardReal-Time Environment

← 1 →