FIXED PRIORITY PREEMPTIVE SCHEDULING - AN HISTORICAL-PERSPECTIVE

被引:142
作者
AUDSLEY, NC
BURNS, A
DAVIS, RI
TINDELL, KW
WELLINGS, AJ
机构
[1] Department of Computer Science, University of York
关键词
D O I
10.1007/BF01094342
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
From its roots in job-shop scheduling, research into fixed priority pre-emptive scheduling theory has progressed from the artificial constraints and simplistic assumptions used in early work to a sufficient level of maturity that it is being increasingly used in the implementation of real-time systems. It is therefore appropriate that within this special issue we provide an historical perspective on the development of fixed priority pre-emptive scheduling.
引用
收藏
页码:173 / 198
页数:26
相关论文
共 111 条
[11]  
BAILEY CM, 1993, REAL-TIME SYSTEMS SYMPOSIUM: PROCEEDINGS, P253, DOI 10.1109/REAL.1993.393492
[12]  
BAKER TP, 1990, PROCEEDINGS : 11TH REAL-TIME SYSTEMS SYMPOSIUM, P191, DOI 10.1109/REAL.1990.128747
[13]  
BLAZEWICZ J., 1976, F CONTROL ENG, V1, P203
[14]   SCHEDULING HARD REAL-TIME SYSTEMS - A REVIEW [J].
BURNS, A .
SOFTWARE ENGINEERING JOURNAL, 1991, 6 (03) :116-128
[15]  
BURNS A, 1987, REV ADA TASKING
[16]  
BURNS A, 1993, FIXED PRIORITY SCHED, P212
[17]  
BURNS A, 1993, 12TH P ADA EUR C, P240
[18]  
BURNS A, 1990, REAL TIME SYSTEMS TH
[19]  
CLEMENTS PC, 1993, REAL-TIME SYSTEMS SYMPOSIUM: PROCEEDINGS, P12, DOI 10.1109/REAL.1993.393519
[20]  
Coffman E.G., 1976, COMPUTER JOB SHOP SC