RATE MONOTONIC SCHEDULING IN HARD REAL-TIME SYSTEMS

被引：13
作者：
SANTOS, J
OROZCO, J
机构：
[1] Departamento de Ingenieria Eléctrica, Universidad Nacional del Sur, 8000 Bahía Blanca
来源：
INFORMATION PROCESSING LETTERS | 1993年 / 48卷 / 01期
关键词：
REAL-TIME SYSTEMS; RATE MONOTONIC SCHEDULING;
D O I：
10.1016/0020-0190(93)90266-C
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We present a systematic method that improves previous results to determine if a Real-Time Multiple Tasks-Single Processor or any other isomorphic system can be Rate Monotonic (RM) scheduled, even with a coarse granularity of priority levels.
引用
收藏
页码：39 / 45
页数：7
相关论文
共 15 条
[1]  
BURNS A, 1990, SOFTWARE ENG J, V6, P116
[2]   OPTIMIZATION BY SIMULATED ANNEALING [J].
KIRKPATRICK, S ;
GELATT, CD ;
VECCHI, MP .
SCIENCE, 1983, 220 (4598) :671-680
[3]  
LAPLANTE PA, 1992, REAL TIME SYSTEMS DE
[4]  
Lehoczky J, 1989, P REAL TIME SYSTEMS, DOI 10.1109AL.1989.63567
[5]  
LEHOCZKY JP, 1986, ACM PERFORMANCE EVAL, V14, P44
[6]   ON THE COMPLEXITY OF FIXED-PRIORITY SCHEDULING OF PERIODIC, REAL-TIME TASKS [J].
LEUNG, JYT ;
WHITEHEAD, J .
PERFORMANCE EVALUATION, 1982, 2 (04) :237-250
[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]   PRIORITIES AND PROTOCOLS IN HARD REAL-TIME LANS - IMPLEMENTING A CRISIS-FREE SYSTEM [J].
SANTOS, J ;
GASTAMINZA, ML ;
OROZCO, J ;
PICARDI, D ;
ALIMENTI, O .
COMPUTER COMMUNICATIONS, 1991, 14 (09) :507-514
[9]  
SHA L, 1991, IEEE MICRO, V11, P30
[10]  
SHA L, 1991, IEEE MICRO, V11, P95
12