Skip to main content

Probabilistic Analysis of Multi-processor Scheduling of Tasks with Uncertain Parameters

  • Conference paper
Real-Time and Embedded Computing Systems and Applications (RTCSA 2003)

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

Abstract

A new approach is proposed for the probabilistic assessment of schedulability of periodic tasks with uncertain characteristics in dynamic multi–processor scheduling. It is aimed at non–critical real–time applications such as multimedia, which allow some leeway with respect to compliance with timing requirements, provided that certain minimum Quality of Service (QoS) requirements are met. Uncertainties are taken into account through random variables at the task arrival times and by characterising subsequent task characteristics in probabilistic terms. By examining each pair of possible computation time and deadline of a given task at each time unit in relation to the same of other tasks, an execution pattern is derived. This forms the basis for computing various QoS attributes such as probability of successful execution, latency in response time, jitter, etc. Illustrative examples address, amongst others, the performance of two particular algorithms, EDF and LLF, in the presence of uncertainties in task characteristics.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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.

References

  1. Atlas, A., Bestavros, A.: Statistical rate monotonic scheduling. In: 19th IEEE Real-Time Systems Symposium, pp. 123–132 (1998)

    Google Scholar 

  2. Atlas, A., Bestavros, A.: Design and Implementation of Statistical Rate Monotonic Scheduling in KURT Linux. In: Proceeding of IEEE Real-Time Systems Symposium, pp. 272–276 (1999)

    Google Scholar 

  3. Chung, J.-Y., Liu, J.W.S., Lin, K.-J.: Scheduling periodic jobs that allow imprecise results. IEEE Transactions on Computers 39(9), 1156–1174 (1990)

    Article  Google Scholar 

  4. David, L., Cottet, F., Nissanke, N.: Jitter Control in On-line Scheduling of Dependent Real-time Tasks. In: 22nd IEEE Real-Time Systems Symposium, London, UK (2001)

    Google Scholar 

  5. Dertouzos, M.L., Mok, A.K.: Multi-processor on-line scheduling of hard realtime systems. IEEE Trans. on Software Engineering 15(12) (December 1989)

    Google Scholar 

  6. Edgar, S., Burns, A.: Statistical Analysis of wcet for Scheduling. In: 22nd IEEE Real-Time Systems Symposium, London, UK, pp. 215–224 (2001)

    Google Scholar 

  7. Hamann, C.-J., Löser, J., Reuther, L., Schönberg, S., Wolter, J., Härtig, H.: Quality-Assuring Scheduling Using Stochastic Behaviour to Improve Resource Utilisation. In: 22nd IEEE Real-Time Systems Symposium, London, UK, pp. 119–128 (2001)

    Google Scholar 

  8. Inverson, M.A., Ozguner, F., Potter, L.: Statistical prediction of Task Execution Times through Analytic Benchmarking for Scheduling in a Heterogeneous Environment. IEEE Transactions on Computers 48(12) (1999)

    Google Scholar 

  9. Manolache, S., Eles, P., Peng, Z.: Menory and Time-efficient Schedulability Analysis of Task Sets with Stochastic Execution Time. In: 13th Euromicro Conference on Real–Time Systems, pp. 19–26 (2001)

    Google Scholar 

  10. Nissanke, N., Leulseged, A., Chillara, S.: Probabilistic Performance Analysis in Multiprocessor Scheduling. Conputing and Control Engineering Jounal 13(4), 171–179 (2002)

    Article  Google Scholar 

  11. Shaw, C.: Reasoning about Time in Higher-Level Language Software. IEEE Trans. on Software Engineering 15(7) (1989)

    Google Scholar 

  12. Zhou, L., Shin, K.G., Rundensteiner, E.A.: Rate-monotonic scheduling in the presence of timing unpredictability. In: IEEE Real-Time Technology and Applications Symposium, pp. 22–27 (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Leulseged, A., Nissanke, N. (2004). Probabilistic Analysis of Multi-processor Scheduling of Tasks with Uncertain Parameters. In: Chen, J., Hong, S. (eds) Real-Time and Embedded Computing Systems and Applications. RTCSA 2003. Lecture Notes in Computer Science, vol 2968. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24686-2_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24686-2_7

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-24686-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics