A multiframe model for real-time tasks

被引:117
作者
Mok, AK
Chen, DJ
机构
[1] Department of Computer Sciences, University of Texas at Austin, Austin
关键词
real-time; task model; scheduling; utilization bound;
D O I
10.1109/32.637146
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
The well-known periodic task model of Liu and Layland [10] assumes a worst-case execution time bound for every task and may be too pessimistic if the worst-case execution time of a task is much longer than the average. In this paper, we give a multiframe real-time task model which allows the execution time of a task to vary from one instance to another by specifying the execution time of a task in terms of a sequence of numbers. We investigate the schedulability problem for this model for the preemptive fixed priority scheduling policy. We show that a significant improvement in the utilization bound can be established in our model.
引用
收藏
页码:635 / 645
页数:11
相关论文
共 16 条
[1]  
[Anonymous], J REAL TIME SYSTEMS
[2]  
BARUAH SK, 1997, IN PRESS GEN MULTIFR
[3]   NEW STRATEGIES FOR ASSIGNING REAL-TIME TASKS TO MULTIPROCESSOR SYSTEMS [J].
BURCHARD, A ;
LIEBEHERR, J ;
OH, YF ;
SON, SH .
IEEE TRANSACTIONS ON COMPUTERS, 1995, 44 (12) :1429-1442
[4]  
BURNS A, 1993, 5 EUR WORKSH REAL TI, P48
[5]  
CHUNG JY, 1990, IEEE T COMPUTER, V39
[6]  
GALL DL, 1991, COMMUN ACM, V34, P46
[7]  
GHAZALIE TM, 1995, REAL TIME SYSTEMS, V9
[8]   TIMING ANALYSIS FOR FIXED-PRIORITY SCHEDULING OF HARD REAL-TIME SYSTEMS [J].
HARBOUR, MG ;
KLEIN, MH ;
LEHOCZKY, JP .
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1994, 20 (01) :13-28
[9]  
KUO TW, 1991, IEEE REAL TIM SYST S
[10]  
LEHOCZKY J, 1989, IEEE REAL TIM SYST S