An extendible approach for analyzing fixed priority hard real-time tasks

作者: K. W. Tindell , A. Burns , A. J. Wellings

DOI: 10.1007/BF01088593

关键词:

摘要: … which finds the optimal priority ordering for any task set. Many static priority pre-emptive … Fixed priority scheduling of periodic task sets with arbitrary deadlines. Proceedings llth IEEE …

参考文章(14)
R. Rajkumar, L. Sha, J.P. Lehoczky, Real-time synchronization protocols for multiprocessors real-time systems symposium. pp. 259- 269 ,(1988) , 10.1109/REAL.1988.51121
C.D. Locke, D.R. Vogel, T.J. Mesler, Building a predictable avionics platform in Ada: a case study real-time systems symposium. pp. 181- 189 ,(1991) , 10.1109/REAL.1991.160372
N. Audsley, A. Burns, M. Richardson, K. Tindell, A.J. Wellings, Applying new scheduling theory to static priority pre-emptive scheduling Software Engineering Journal. ,vol. 8, pp. 284- 292 ,(1993) , 10.1049/SEJ.1993.0034
Joseph Y.-T. Leung, Jennifer Whitehead, On the complexity of fixed-priority scheduling of periodic, real-time tasks Performance Evaluation. ,vol. 2, pp. 237- 250 ,(1982) , 10.1016/0166-5316(82)90024-4
K. W. Tindell, A. Burns, A. J. Wellings, Allocating hard real-time tasks: an NP-hard problem made easy Real-time Systems. ,vol. 4, pp. 145- 165 ,(1992) , 10.1007/BF00365407
Mathai Joseph, Paritosh Pandya, Finding Response Times in a Real-Time System The Computer Journal. ,vol. 29, pp. 390- 395 ,(1986) , 10.1093/COMJNL/29.5.390
T. P. Baker, Stack-based scheduling for realtime processes Real-time Systems. ,vol. 3, pp. 67- 99 ,(1991) , 10.1007/BF00365393
C. L. Liu, James W. Layland, Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment Journal of the ACM. ,vol. 20, pp. 46- 61 ,(1973) , 10.1145/321738.321743
J.P. Lehoczky, Fixed priority scheduling of periodic task sets with arbitrary deadlines real-time systems symposium. pp. 201- 209 ,(1990) , 10.1109/REAL.1990.128748