DYNAMIC PRIORITY SCHEDULING OF PERIODIC AND APERIODIC TASKS IN HARD REAL-TIME SYSTEMS

被引：7

作者：

HOMAYOUN, N

RAMANATHAN, P

机构：

[1] Department of Electrical and Computer Engineering, University of Wisconsin-Madison, Madison, 53706-1691, WI

来源：

REAL-TIME SYSTEMS | 1994年 / 6卷 / 02期

关键词：

EARLIEST DEADLINE 1ST SCHEDULING; DEFERRABLE SERVER; PREEMPTIVE SCHEDULING;

D O I：

10.1007/BF01088596

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

This paper addresses the problem of scheduling aperiodic tasks in real-time systems. The proposed scheme combines the Earliest-Deadline-First algorithm for scheduling periodic tasks with the Deferrable Server approach for servicing aperiodic tasks. Necessary and sufficient conditions are derived for guaranteeing feasibility of a given periodic task set when a deferrable server is present. An analytic model is proposed for selecting the best feasible period and computation time of the server to minimize the mean response time of aperiodic tasks. An evaluation of the proposed model using a simulator indicates that the server parameters selected by the model result in mean response times that are close to the best mean response time determined by the simulator.

引用

页码：207 / 232

页数：26

共 9 条

[1] DYNAMIC SCHEDULING OF REAL-TIME TASKS UNDER PRECEDENCE CONSTRAINTS [J].

CHETTO, H ;

SILLY, M ;

BOUCHENTOUF, T .

REAL-TIME SYSTEMS, 1990, 2 (03) :181-194

[2]

JEFFAY K, 1989, DEC P REAL TIM SYST, P295

[3]

Kleinrock L., 1975, QUEUEING SYST

[4]

Lehoczky J. P., 1987, Proceedings of the Real-Time Systems Symposium (Cat. No.87CH2475-2), P261

[5]

LEHOCZKY JP, 1992, DEC P REAL TIM SYST, P110

[6]

LIN TH, 1991, MAY P ACM SIGM C MEA, P31

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

MOLINI JJ, 1990, DEC P REAL TIM SYST, P214

[9]

[No title captured]

← 1 →