Skip to main content
SpringerLink
Log in

Defining New Non-preemptive Dispatching and Locking Policies for Ada

  • Conference paper
  • First Online:
Reliable SoftwareTechnologies — Ada-Europe 2001 (Ada-Europe 2001)

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

Included in the following conference series:

Abstract

In many high-integrity applications, non-preemptive execution is preferred. This paper motivates and defines such a dispatching policy for Ada. It also describes an associated locking policy for protected objects. To deliver non-preemptive execution a new processing resource is introduced – the execution token. In addition to defining these new policies the paper also reviews how non-preemptive tasking systems can be analysed for their schedulability.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. A. Burns. Non-preemptive dispatching and locking policies. In M.G. Harbour, editor, Proceedings of the 10th International Real-Time Ada Workshop. ACM Ada Letters, 2001.

    Google Scholar 

  2. L. Asplund, B. Johnson, and K. Lundqvist. Session summary: The Ravenscar pro_le and implementation issues. In A. Burns, editor, Proceedings of the 9th International Real-Time Ada Workshop, volume XIX(2), pages 12–14. ACM Ada Letters, June 1999.

    Google Scholar 

  3. 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.

    Article  Google Scholar 

  4. T. Baker and T. Vardanega. Session summary: Tasking profiles. In A.J. Wellings, editor, Proceedings of the 8th International Real-Time Ada Workshop, pages 5–7. ACM Ada Letters, 1997.

    Google Scholar 

  5. A. Burns and A.J. Welling. Restricted tasking models. In A.J. Wellings, editor, Proceedings of the 8th International Real-Time Ada Workshop, pages 27–32. ACM Ada Letters, 1997.

    Google Scholar 

  6. A. Burns and A. J. Wellings. Real-Time Systems and Programming Languages. Addison Wesley Longman, 3rd edition, 2001.

    Google Scholar 

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

    Article  MathSciNet  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

Authors
  1. Alan Burns
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Offis nv/sa - Aubay Group, Offis & K.U. Leuven, Weiveldlaan 41/32, 1930, Zaventem, Belgium

    Dirk Craeynest

  2. EPFL-DI-LGL, Swiss Federal Institute of Technology Lausanne (EPFL), 1015, Lausanne EPFL, Switzerland

    Alfred Strohmeier

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Burns, A. (2001). Defining New Non-preemptive Dispatching and Locking Policies for Ada. In: Craeynest, D., Strohmeier, A. (eds) Reliable SoftwareTechnologies — Ada-Europe 2001. Ada-Europe 2001. Lecture Notes in Computer Science, vol 2043. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45136-6_26

Download citation

  • DOI: https://doi.org/10.1007/3-540-45136-6_26

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42123-8

  • Online ISBN: 978-3-540-45136-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation