Skip to main content
Springer Nature Link
Log in

A Probabilistic Framework for Schedulability Analysis

  • Conference paper
Embedded Software (EMSOFT 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2855))

Included in the following conference series:

Abstract

The limitations of the deterministic formulation of scheduling are outlined and a probabilistic approach is motivated. A number of models are reviewed with one being chosen as a basic framework. Response-time analysis is extended to incorporate a probabilistic characterisation of task arrivals and execution times. Copulas are used to represent dependencies.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Atlas, A.K., Bestavros, A.: Statistical rate monotonic scheduling. In: Proceedings of the 19th IEEE Real-Time Systems Symposium, Madrid, Spain, pp. 123–132. IEEE Computer Society Press, Los Alamitos (1998)

    Chapter  Google Scholar 

  2. Audsley, N.C., Burns, A., Richardson, M., Tindell, K., Wellings, A.J.: Applying new scheduling theory to static priority pre-emptive scheduling. Software Engineering Journal 8(5), 284–292 (1993)

    Article  Google Scholar 

  3. Bernat, G., Burns, A.: New results on fixed priority a periodic servers. In: 20th IEEE Real-Time Systems Symposium, Phoenix, USA (December 1999)

    Google Scholar 

  4. Bernat, G., Colin, A., Petters, S.M.: WCET analysis of probabilistic hard real–time systems. In: Proceedings of the 23rd Real-Time Systems Symposium RTSS 2002, Austin, Texas, USA, pp. 279–288 (2002)

    Google Scholar 

  5. Bernat, G., Newby, M.: Probabilistic WCETanalysis, an approach using copulas. Technical report, Department of Computer Science University of York, Technical Report (2003)

    Google Scholar 

  6. Broster, I., Burns, A., Rodríguez-Navas, G.: Probabilistic analysis of CAN with faults. In: Proceedings of the 23rd Real-time Systems Symposium (December 2002)

    Google Scholar 

  7. Burns, A., Davis, R.I., Punnekkat, S.: Feasibility analysis of fault-tolerant real-time task sets. In: Euromicro Real-Time Systems Workshop, June 1996, pp. 29–33 (1996)

    Google Scholar 

  8. Burns, A., Edgar, S.: Predicting computation time for advanced processor architectures. In: Proceedings 12th EUROMICRO conference on Real-time Systems (2000)

    Google Scholar 

  9. Burns, A., Punnekkat, S., Strigini, L., Wright, D.R.: 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, pp. 339–356 (1999)

    Google Scholar 

  10. Burns, A., Wellings, A.J.: Engineering a hard real-time system: From theory to practice. Software-Practice and Experience 25(7), 705–726 (1995)

    Article  Google Scholar 

  11. Burns, A., Wellings, A.J.: Real-Time Systems and Programming Languages, 3rd edn. Addison-Wesley Longman, Amsterdam (2001)

    Google Scholar 

  12. Campbell, A., McDonald, P., Ray, K.: Single event upset rates in space. IEEE Transactions on Nuclear Science 39(6), 1828–1835 (1992)

    Article  Google Scholar 

  13. Castillo, X., McConnel, S.P., Siewiorek, D.P.: Derivation and Calibration of a Transient Error Reliability Model. IEEE Transactions on Computers 31(7), 658–671 (1982)

    Article  Google Scholar 

  14. Cossette, H., Denuit, M., Marceau, E.: Distributional bounds for functions of dependent risks. Technical report, Bulletin suisse des actuaires (2001)

    Google Scholar 

  15. Diaz, J.L., García, D.F., Kim, K., Lee, C.-G., Bello, L.L., Lopez, J.M., Min, S.L., Mirabella, O.: Stochastic analysis of periodic real-time systems. In: 22nd IEEE Real-Time Systems Symposium, Austin, TX., USA (2002)

    Google Scholar 

  16. Edgar, S., Burns, A.: Statistical analysis of WCET for scheduling. In: Proceedings IEEE Real-Time Systems Symposium (2001)

    Google Scholar 

  17. Gardner, M.K.: Probabilstic Analysis and Scheduling of Critical Soft Real-time Systems. PhD thesis, University of Illinois, Computer Science, Urbana, Illinois (1999)

    Google Scholar 

  18. Gardner, M.K., Lui, J.W.: 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)

    Google Scholar 

  19. Hou, C.-J., Shin, K.G.: Allocation of periodic task modules with precedence and deadline constraints in distributed real-time systems. IEEE Transactions on Computers 46(12), 1338–1356 (1997)

    Article  MathSciNet  Google Scholar 

  20. Joseph, M., Pandya, P.: Finding response times in a real-time system. BCS Computer Journal 29(5), 390–395 (1986)

    Article  MathSciNet  Google Scholar 

  21. Katcher, D.I., Arakawa, H., Strosnider, J.K.: Engineering and analysis of fixed priority schedulers. IEEE Trans. Softw. Eng. 19 (1993)

    Google Scholar 

  22. Kim, H., White, A.L., Shin, K.G.: Reliability modeling of hard real-time systems. In: Proceedings 28th Int. Symp. on Fault-Tolerant Computing (FTCS-28), pp. 304–313. IEEE Computer Society Press, Los Alamitos (1998)

    Google Scholar 

  23. Klein, M.H., Ralya, T.A., Pollak, B., Obenza, R., Harbour, M.G.: A Practitioner’s Handbook for Real-Time Analysis: A Guide to Rate Monotonic Analysis for Real-Time Systems. Kluwer Academic Publishers, Dordrecht (1993)

    Google Scholar 

  24. Lehoczky, J.P., Sha, L., Ding, V.: The rate monotonic scheduling algorithm: Exact characterization and average case behavior. Tech report, Department of Statistics, Carnegie-Mellon (1987)

    Google Scholar 

  25. Leulseged, A., Nissanke, N.: Stochastic analysis of periodic real-time systems. In: 9th Intl. Conf. on Real-Time and Embeded Computing Systems and applications (RTCSA 2003), Taiwan (2003)

    Google Scholar 

  26. Leung, J.Y.T., Whitehead, J.: On the complexity of fixed-priority scheduling of periodic, real-time tasks. Performance Evaluation (Netherlands) 2(4), 237–250 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  27. Lima, G., Burns, A.: An optimal fixed-priority assignment algorithm for supporting faulttolerant hard real-time systems. IEEE Transactions on Computer Systems (2003) (to appear)

    Google Scholar 

  28. Liu, C.L., Layland, J.W.: Scheduling algorithms for multiprogramming in a hard real-time environment. JACM 20(1), 46–61 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  29. Makarov, G.D.: 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)

    Article  Google Scholar 

  30. Manolache, S., Eles, P., Peng, Z.: Memory and time efficient schedulability analysis of task sets with stochastic execution time. In: Proceedings 13th EUROMICRO conference on Real-time Systems (2001)

    Google Scholar 

  31. Navet, N., Song, Y.-Q., Simonot, F.: Worst-case deadline failure probability in real-time applications distributed over controller area network. Journal of Systems Architecture 46(1), 607–617 (2000)

    Article  Google Scholar 

  32. Nelsen, R.B.: An introduction to Copulas. Springer, Heidelberg (1998)

    Google Scholar 

  33. Punnekkat, S.: Schedulability Analysis for Fault Tolerant Real-time Systems. PhD thesis, Dept. Computer Science, University ofYork (1997)

    Google Scholar 

  34. Punnekkat, S., Davis, R., Burns, A.: Sensitivity analysis of real-time task sets. In: Shyamasundar, R.K. (ed.) ASIAN 1997. LNCS, vol. 1345, pp. 72–82. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  35. Ramos-Thuel, S., Lehoczky, J.P.: On-line scheduling of hard deadline aperiodic tasks in fixed-priority systems. In: Proceedings of 14th IEEE Real-Time Systems Symposium, December 1993, pp. 160–171 (1993)

    Google Scholar 

  36. Shin, K.G., Krishna, M., Lee, Y.H.: A unified method for evaluating real-time computer controllers its application. IEEE Transactions on Automatic Control 30, 357–366 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  37. Silly, M., Chetto, H., Elyounsi, N.: An optimal algorithm for guaranteeing sporadic tasks in hard real-time systems. In: Proceedings 2nd IEEE Symposium on Parallel and Distributed Systems, pp. 578–585 (1990)

    Google Scholar 

  38. Tia, T.S., Deng, Z., Shankar, M., Storch, M., Sun, J., Wu, L.C., Liu, J.S.: Probabilisitc performance guenrantee for real-time tasks with varying computation times. In: Proceedings of the Real-Time Technology and Applications Symposium, pp. 164–173 (1995)

    Google Scholar 

  39. Vestal, S.: Fixed Priority Sensitivity Analysis for Linear Compute Time Models. IEEE Transactions on Software Engineering 20(4), 308–317 (1994)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Real-Time Systems Research Group, Department of Computer Science, University of York, UK

    Alan Burns, Guillem Bernat & Ian Broster

Authors
  1. Alan Burns
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Guillem Bernat
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ian Broster
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Pennsylvania,  

    Rajeev Alur

  2. School of Engineering and Applied Science, Department of Computer and Information Science, University of Pennsylvania, Levine Hall, Room 602, 3330 Walnut Street, PA 19104-6389, Philadelphia, USA

    Insup Lee

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Burns, A., Bernat, G., Broster, I. (2003). A Probabilistic Framework for Schedulability Analysis. In: Alur, R., Lee, I. (eds) Embedded Software. EMSOFT 2003. Lecture Notes in Computer Science, vol 2855. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45212-6_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45212-6_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20223-3

  • Online ISBN: 978-3-540-45212-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics