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 条
[1]  
Aarts E., 1988, SIMULATED ANNEALING
[2]  
AGRAWAL G, 1991, IEEE WORKSHOP ARCH A
[3]   APPLYING NEW SCHEDULING THEORY TO STATIC PRIORITY PREEMPTIVE SCHEDULING [J].
AUDSLEY, N ;
BURNS, A ;
RICHARDSON, M ;
TINDELL, K ;
WELLINGS, AJ .
SOFTWARE ENGINEERING JOURNAL, 1993, 8 (05) :284-292
[4]  
AUDSLEY N, 1993, P EUR WORKSH REAL TI, P36, DOI DOI 10.1109/EMWRT.1993.639042
[5]  
Audsley N. C., 1993, Control Engineering Practice, V1, P71, DOI 10.1016/0967-0661(93)92105-D
[6]  
Audsley N.C., 1993, THESIS U YORK
[7]  
AUDSLEY NC, 1993, COMPUT SYST SCI ENG, V8, P80
[8]  
AUDSLEY NC, 1994, SOFTWARE PRACTICE EX
[9]  
AUDSLEY NC, 1991, 8TH P IEEE WORKSH RE, P127
[10]  
AUDSLEY NC, 1992, P 18 IFAC WORKSH REA, P55