Skip to main content
SpringerLink
Log in

Distributed Priority Assignment in Real-Time Systems

  • Chapter
  • First Online:
Embedded Systems Development

Part of the book series: Embedded Systems ((EMSY,volume 20))

Abstract

Recent advances in in-system performance analysis allow to determine feasibility of a system configuration within the system itself. Such methods have been successfully used to perform admission control for updates in distributed real-time systems. Parameter synthesis, which is necessary to complement the admission control with self-configuration capabilities, lags behind because current approaches cannot be distributed properly or due to necessary design-time preprocessing steps. In this chapter we present a distributed algorithm to find feasible execution priorities in distributed static-priority-preemptively (SPP) scheduled real-time systems under consideration of end-to-end path latencies. The presented algorithm builds on top of an existing distributed feasibility test, which is derived from compositional performance analysis [1]. With an extensive set of pseudo-randomly generated testcases we demonstrate the applicability of the approach and show that the proposed algorithm can even compete with state-of-the-art design time tools at a fraction of the run time. Thus, despite its application to admission control, the approach is generally applicable to the problem of scheduling priority assignment.

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

Access this chapter

Log in via an institution
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 EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 119.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. Stein, S., Hamann, A., Ernst, R.: Real-time property verification in organic computing systems. In: Second Int’l. Symp. on Leveraging Applications of Formal Methods, Verification and Validation (2006)

    Google Scholar 

  2. Neukirchner, M., Stein, S., Schrom, H., Ernst, R.: A software Update Service with Self-Protection Capabilities. In: Conf. on Design, Automation and Test in Europe (DATE) (2010)

    Google Scholar 

  3. Henia, R., Hamann, A., Jersak, M., Racu, R., Richter, K., Ernst, R.: System level performance analysis - the SymTA/S approach. Computers and Digital Techniques, IEE Proc. - 152, 148–166 (2005).doi:10.1049/ip-cdt:20045088

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

    Article  MathSciNet  MATH  Google Scholar 

  5. Leung, J.Y.T., Whitehead, J.: On the complexity of fixed-priority scheduling of periodic, real-time tasks. Perform. Eval. 2, 237–250 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  6. Audsley, N., Burns, A., Richardson, M.F., Wellings, A.J.: Hard real-time scheduling: The deadline-monotonic approach. In: proceeding IEEE Workshop on Real-Time Operating Systems and Software (1991)

    Google Scholar 

  7. Lehoczky, J., Ramos-Thuel, S.: An optimal algorithm for scheduling soft-aperiodic tasks in fixed-priority preemptive systems. Real-Time Systems Symposium (RTSS), pp. 110–123 (1992)

    Google Scholar 

  8. Davis, R., Burns, A.: Optimal priority assignment for aperiodic tasks with firm deadlines in fixed priority pre-emptive systems. Inf. Process. Lett. 53, 249–254 (1995)

    Article  MATH  Google Scholar 

  9. Bertogna, M., Cirinei, M., Lipari, G.: New schedulability tests for real-time task sets scheduled by deadline monotonic on multiprocessors. Principles of Distributed Systems. Springer, Heidelberg, (2006)

    Google Scholar 

  10. Andersson, B.: Global static-priority preemptive multiprocessor scheduling with utilization bound 38%. Principles of Distributed Systems. Springer, Heidelberg (2008)

    Google Scholar 

  11. Davis, R.I., Burns, A.: Priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems. In: Real-Time Systems Symposium (RTSS) (2009)

    Google Scholar 

  12. Hamann, A., Jersak, M., Richter, K., Ernst, R.: A framework for modular analysis and exploration of heterogeneous embedded systems. Real-Time Syst. 33, 101–137 (2006)

    Article  MATH  Google Scholar 

  13. Glaß, M., Lukasiewycz, M., Teich, J., Bordoloi, U., Chakraborty, S.: Designing heterogeneous ECU networks via compact architecture encoding and hybrid timing analysis. In: Proceedings of Design Automation Conference (DAC), pp. 43–46 (2009)

    Google Scholar 

  14. Palopoli, L., Abeni, L., Cucinotta, T., Lipari, G., Baruah, S.: Weighted feedback reclaiming for multimedia applications. In: Workshop on Embedded Systems for Real-Time Multimedia (ESTImedia) (2008). doi:10.1109/ESTMED.2008.4697009

  15. Cucinotta, T., Palopoli, L.: QoS control for pipelines of tasks using multiple resources. IEEE Trans. Comput. 59, 416–430 (2010)

    Article  MathSciNet  Google Scholar 

  16. Jonsson, J., Shin, K.G.: Robust adaptive metrics for deadline assignment in distributed hard real-time systems. Real-Time Syst. 23, 239–271 (2002)

    Article  MATH  Google Scholar 

  17. García, J.G., Harbour, M.G.: Optimized priority assignment for tasks and messages in distributed hard real-time systems. Workshop on Parallel and Distributed Real-Time Systems, (1995)

    Google Scholar 

  18. Natale, M.D., Stankovic, J.A.: Dynamic end-to-end guarantees in distributed real time systems. In: Real-Time Systems Symp. (RTSS) (1994)

    Google Scholar 

  19. Hong, S., Chantem, T., Hu, X.S.: Meeting end-to-end deadlines through distributed local deadline assignments. In: Real-Time Systems Symposium (RTSS) (2011)

    Google Scholar 

  20. Neukirchner, M., Stein, S., Ernst, R.: A lazy algorithm for distributed priority assignment in real-time systems. Workshop on Self-Organizing Real-Time Systems (SORT), (2011)

    Google Scholar 

  21. Richter, K.: Compositional scheduling analysis using standard event models. Ph.D. thesis, Technical University of Braunschweig, Department of Electrical Engineering and Information Technology (2004)

    Google Scholar 

  22. Thiele, L., Chakraborty, S., Naedele, M.: Real-time calculus for scheduling hard real-time systems. In: Symposium on Circuits and Systems (ISCAS) (2000). doi:10.1109/ISCAS.2000.858698

  23. Tindell, K.W.: An extendible approach for analysing fixed priority hard real-time systems. J. Real-Time Syst. 6, 133–152 (1994)

    Article  Google Scholar 

  24. Racu, R., Li, L., Henia, R., Hamann, A., Ernst, R.: Improved response time analysis of tasks scheduled under preemptive round-robin. Conference on Hardware-Software Codesign and System Synthesis, (2007)

    Google Scholar 

  25. Davis, R.I., Burns, A., Bril, R.J., Lukkien, J.J.: Controller area network (can) schedulability analysis: Refuted, revisited and revised. Real-Time Syst. 35, 239–272 (2007)

    Article  Google Scholar 

  26. Schliecker, S., Ernst, R.: A recursive approach to end-to-end path latency computation in heterogeneous multiprocessor systems. In: Conference on Hardware Software Codesign and System Synthesis (CODES-ISSS) (2009)

    Google Scholar 

  27. Stein, S., Neukirchner, M., Schrom, H., Ernst, R.: Consistency challenges in self-organizing distributed hard real-time systems. Workshop on Self-Organizing Real-Time Systems (SORT), (2010)

    Google Scholar 

  28. Neukirchner, M., Stein, S., Ernst, R.: SMFF: System Models for Free. In: 2nd Int’l. Workshop on Analysis Tools and Methodologies for Embedded and Real-time Systems (WATERS) (2011)

    Google Scholar 

  29. Neukirchner, M.: System models for free. http://smff.sourceforge.net (2011). http://smff.sourceforge.net

Download references

Author information

Authors and Affiliations

  1. Institute of Computer and Network Engineering, Technische Universität Braunschweig, Braunschweig, Germany

    Moritz Neukirchner, Steffen Stein & Rolf Ernst

Authors
  1. Moritz Neukirchner
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Steffen Stein
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Rolf Ernst
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Moritz Neukirchner .

Editor information

Editors and Affiliations

  1. Dept. Electrical Engineering &, Computer Science (EECS), University of California, Berkeley, 253 Cory Hall MC# 1770, Berkeley, 94720-1770, California, USA

    Alberto Sangiovanni-Vincentelli

  2. , Department of ECE, McGill University, University Street 3480, Montreal, H3A 2A7, Canada

    Haibo Zeng

  3. Scuola Superiore Sant'Anna, via Moruzzi 1, Pisa, 56124, Italy

    Marco Di Natale

  4. Embedded Systems Group, TU Dortmund University, Otto-Hahn-Str. 16, Dortmund, 44221, Germany

    Peter Marwedel

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer Science+Business Media New York

About this chapter

Cite this chapter

Neukirchner, M., Stein, S., Ernst, R. (2014). Distributed Priority Assignment in Real-Time Systems. In: Sangiovanni-Vincentelli, A., Zeng, H., Di Natale, M., Marwedel, P. (eds) Embedded Systems Development. Embedded Systems, vol 20. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-3879-3_10

Download citation

  • DOI: https://doi.org/10.1007/978-1-4614-3879-3_10

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4614-3878-6

  • Online ISBN: 978-1-4614-3879-3

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation