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 条
[81]  
RAMAMRITHAM K, 1990, 10TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS, P108
[82]  
ROSEMAN T, 1992, P ACM TRIADA, V1, P355
[83]  
SERLIN O, 1972, SPR P JOINT COMP C, P925
[84]  
Sha L., 1986, Proceedings of the Real-Time Systems Symposium (Cat. No.86CH2351-5), P181
[85]   PRIORITY INHERITANCE PROTOCOLS - AN APPROACH TO REAL-TIME SYNCHRONIZATION [J].
SHA, L ;
RAJKUMAR, R ;
LEHOCZKY, JP .
IEEE TRANSACTIONS ON COMPUTERS, 1990, 39 (09) :1175-1185
[86]  
SHA L, 1989, REAL-TIME SYST, V1, P27
[87]  
SHA L, 1987, PRIORITY INHERITANCE
[88]  
Sha Lui, 1987, ADA LETT, VVII, P30
[89]  
SIMPSON H, 1990, IEEE P E
[90]  
SMITH WE, 1956, NAVAL RES LOGISTICS, V3