A probabilistic framework for schedulability analysis

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2855, Issue , 2003, Pages 1-15

  Burns, Alan ^a   Bernat, Guillem ^a   Broster, Ian ^a  

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTERS;

PROBABILISTIC APPROACHES; PROBABILISTIC FRAMEWORK; RESPONSE-TIME ANALYSIS; SCHEDULABILITY ANALYSIS;

ARTIFICIAL INTELLIGENCE;

EID: 0142156702     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45212-6_1     Document Type: Article

References (39)

1. A.K. Atlas and A. Bestavros. Statistical rate monotonic scheduling. In Proceedings of the 19th IEEE Real-Time Systems Symposium, Madrid, Spain, pages 123-132. IEEE Computer Society Press, 1998.
2. N. C. Audsley, A. Burns, M. Richardson, K. Tindell, and A. J. Wellings. Applying new scheduling theory to static priority pre-emptive scheduling. Software Engineering Journal, 8(5):284-292, 1993.
3. G. Bernat and A. Bums. New results on fixed priority aperiodic servers. In 20th IEEE Real-Time Systems Symposium, Phoenix. USA, December 1999.
4. G. Bernat, A. Colin, and S. M. Petters. WCET analysis of probabilistic hard real-time systems. In Proceedings of the 23rd Real-Time Systems Symposium RTSS 2002, pages 279-288, Austin, Texas, USA, 2002.
5. G. Bernat and M. Newby. Probabilistic WCET analysis, an approach using copulas. Technical report, Department of Computer Science University of York, Technical Report, 2003.
6. I. Broster, A. Burns, and G. Rodríguez-Navas. Probabilistic analysis of CAN with faults. In Proceedings of the 23rd Real-time Systems Symposium, Dec 2002.
7. A. Burns, R. I. Davis, and S. Punnekkat. Feasibility analysis of fault-tolerant real-time task sets. Euromicro Real-Time Systems Workshop, pages 29-33, June 1996.
8. A. Burns and S. Edgar. Predicting computation time for advanced processor architectures. In Proceedings 12th EUROMICRO conference on Real-time Systems, 2000.
9. A. Burns, S. Punnekkat, L. Strigini, and D.R. Wright. Probabilistic scheduling guarantees for fault-tolerant real-time systems. In Proceedings of the 7th International Working Conference on Dependable Computing for Critical Applications. San Jose, California, pages 339-356, 1999.
10. A. Burns and A. J. Wellings. Engineering a hard real-time system: From theory to practice. Software-Practice and Experience, 25(7):705-26, 1995.
11. A. Burns and A. J. Wellings. Real-Time Systems and Programming Languages. Addison Wesley Longman, 3rd edition, 2001.
12. A. Campbell, P. McDonald, and K. Ray. Single event upset rates in space. IEEE Transactions on Nuclear Science, 39(6): 1828-1835, December 1992.
13. X. Castillo, S.P. McConnel, and D.P. Siewiorek. Derivation and Calibration of a Transient Error Reliability Model. IEEE Transactions on Computers, 31(7):658-671, July 1982.
14. H. Cossette, M. Denuit, and E. Marceau. Distributional bounds for functions of dependent risks. Technical report, Bulletin suisse des actuaires., 2001.
15. J.L. Diaz, D.F. García, K. Kim, C.-G. Lee, L.L. Bello, J.M. Lopez, S.L. Min, and O. Mirabella. Stochastic analysis of periodic real-time systems. In 22nd IEEE Real-Time Systems Symposium., Austin, TX. USA, 2002.
16. S. Edgar and A. Burns. Statistical analysis of WCET for scheduling. In Proceedings IEEE Real-Time Systems Symposium, 2001.
17. M. K. Gardner. Probabilstic Analysis and Scheduling of Critical Soft Real-time Systems. PhD thesis, University of Illinois, Computer Science, Urbana, Illinois, 1999.
18. M. K. Gardner and J.W. Lui. Analysing stochastic fixed-priority real-time systems. In Proceedings of the 5th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, 1999.
19. C.-J. Hou and K. G. Shin. Allocation of periodic task modules with precedence and deadline constraints in distributed real-time systems. IEEE Transactions on Computers, 46(12): 1338-1356, 1997.
20. M. Joseph and P. Pandya. Finding response times in a real-time system. BCS Computer Journal, 29(5):390-395, 1986.
21. D.I. Katcher, H. Arakawa, and J.K. Strosnider. Engineering and analysis of fixed priority schedulers. IEEE Trans. Softw. Eng., 19, 1993.
22. H. Kim, A.L. White, and K. G.Shin. Reliability modeling of hard real-time systems. In Proceedings 28th Int. Symp. on Fault-Tolerant Computing (FTCS-28), pages 304-313. IEEE Computer Society Press, 1998.
23. M. H. Klein, T. A. Ralya, B. Pollak, R. Obenza, and M. G. Harbour. A Practitioner's Handbook for Real-Time Analysis: A Guide to Rate Monotonic Analysis for Real-Time Systems. Kluwer Academic Publishers, 1993.
24. J.P. Lehoczky, L. Sha, and V. Ding. The rate monotonic scheduling algorithm: Exact characterization and average case behavior. Tech report. Department of Statistics, Carnegie-Mellon, 1987.
25. A. Leulseged and N. Nissanke. Stochastic analysis of periodic real-time systems. In 9th Intl. Conf. on Real-Time and Embeded Computing Systems and applications (RTCSA 2003), Taiwan, 2003.
26. J.Y.T. Leung and J. Whitehead. On the complexity of fixed-priority scheduling of periodic, real-time tasks. Performance Evaluation (Netherlands), 2(4):237-250, 1982.
27. G. Lima and A. Burns. An optimal fixed-priority assignment algorithm for supporting fault-tolerant hard real-time systems. IEEE Transactions on Computer Systems (to appear), 2003.
28. C.L. Liu and J.W. Layland. Scheduling algorithms for multiprogramming in a hard real-time environment. JACM, 20(1):46-61, 1973.
29. G.D. Makarov. Estimates for the distribution function of a sum of two random variales when the marginal distributions are fixed. Theory Probab. Appli, 26:803-806, 1981.
30. S. Manolache, P. Eles, and Z. Peng. Memory and time efficient schedulability analysis of task sets with stochastic execution time. In Proceedings 13th EUROMICRO conference on Real-time Systems, 2001.
31. N. Navet, Y.-Q. Song, and F. Simonot. Worst-case deadline failure probability in real-time applications distributed over controller area network. Journal of Systems Architecture, 46(1):607-617, 2000.
32. R.B. Nelsen. An introduction to Copulas. Springer, 1998.
33. S. Punnekkat. Schedulability Analysis for Fault Tolerant Real-time Systems. PhD thesis, Dept. Computer Science, University of York, 1997.
34. S. Punnekkat, R. Davis, and A. Burns. Sensitivity analysis of real-time task sets. In Proceedings of the Conference of Advances in Computing Science - ASIAN '97, pages 72-82. Springer, 1997.
35. S. Ramos-Thuel and J.P. Lehoczky. On-line scheduling of hard deadline aperiodic tasks in fixed-priority systems. In Proceedings of 14th IEEE Real-Time Systems Symposium, pages 160-171, December 1993.
36. K. G. Shin, M. Krishna, and Y. H. Lee. A unified method for evaluating real-time computer controllers its application. IEEE Transactions on Automatic Control, 30:357-366, 1985.
37. M. Silly, H. Chetto, and N. Elyounsi. An optimal algorithm for guaranteeing sporadic tasks in hard real-time systems. In Proceedings 2nd IEEE Symposium on Parallel and Distributed Systems, pages 578-585, 1990.
38. T.S. Tia, Z. Deng, M. Shankar, M. Storch, J. Sun, L.C. Wu, and J.S. Liu. Probabilisitc performance guenrantee for real-time tasks with varying computation times. In Proceedings of the Real-Time Technology and Applications Symposium, pages 164-173, 1995.
39. S. Vestal. Fixed Priority Sensitivity Analysis for Linear Compute Time Models. IEEE Transactions on Software Engineering, 20(4):308-317, April 1994.