Skip to main content

The Specifications of the Weakly Hard Real-Time Systems: A Review

  • Conference paper
Software Engineering and Computer Systems (ICSECS 2011)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 180))

Included in the following conference series:

Abstract

A real-time system is one in which the temporal aspects of its behaviour are part of their specification. The problem with traditional real-time specification is no guarantees on when and how many deadlines may be missed can be given to the tasks because their specification is focused on met all the deadlines and cannot missed it, otherwise the tasks is totally failed. Thus, the weakly hard specification solve this problem with define a gradation on how the deadlines can be missed while still guaranteeing the tasks meets their deadlines. In this paper, a review has been made on the three specifications of real-time systems which is losses or missed of the deadlines can be permitted occasionally. Three criteria used in the evaluation are the process model, temporal specifications and predictability. These three criteria were chosen because the tasks in real-time systems are usually periodic in nature, have timing constraints like deadlines and the behaviour of the systems must be predictable. The three specifications we reviewed in this paper are the skip constraints known as skip factor s, (m,k)-firm deadlines and the weakly hard constraints. The objective of review is to find which specification is better in order to predict the behaviour of a task based on those three criteria. Based on our review, it is concluded that the weakly hard constraints outperforms the two conventional specifications of weakly hard real-time systems using that three criteria based on our evaluation by using a mobile robot case study due to its capability to specify in a clear of the distribution of deadlines met and missed.

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. Shin, K.G., Ramanathan, P.: Real-time computing: A new discipline of computer science and engineering. Proceedings of the IEEE 82(1) (1994)

    Google Scholar 

  2. Bernat, G., Burns, A.: Weakly hard real-time systems. IEEE Transactions on Computers 50(4), 308–321 (2001)

    Article  MathSciNet  Google Scholar 

  3. Koren, G., Shasha, D.: Skip-over: algorithms and complexity for overloaded systems that allow skips. In: Proceedings of the 16th IEEE Real-Time Systems Symposium, Pisa, Italy, pp. 110–117 (December 1995)

    Google Scholar 

  4. Hamdaoui, M., Ramanathan, P.: A dynamic priority assignment technique for streams with (m,k)-firm deadlines. IEEE Transactions on Computers 44(12), 1443–1451 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  5. Bernat, G.: Specification and analysis of weakly hard real-time systems. PhD Thesis, Department de les Ciències Matemàtiques i Informàtica. Universitat de les Illes Balears, Spain (January 1998)

    Google Scholar 

  6. Jawawi, D.N.A., Deris, S., Mamat, R.: Enhancement of PECOS embedded real-time component model for autonomous mobile robot application. In: IEEE International Conference on Computer Systems and Applications, pp. 882–889 (2006)

    Google Scholar 

  7. Li, J., Song, Y.-Q., Francoise, S.-L.: Providing real-time applications with graceful degradation of Qos and fault tolerance according to (m,k)-firm model. IEEE Transactions on Industrial Informatics 2(2), 112–119 (2006)

    Article  Google Scholar 

  8. Bernat, G., Cayssials, R.: Guaranteed on-line weakly hard real-time systems. In: 22nd IEEE Real-Time Systems Symposium (RTSS 2001), London, England, pp. 25–35 (December 2001)

    Google Scholar 

  9. Broster, I., Bernat, G., Burns, A.: Weakly hard real-time constraints on controller area network. In: 14th Euromicro Conference on Real-Time Systems (ECRTS 2002), Vienna, Austria, p. 134 (June 2002)

    Google Scholar 

  10. Silly-Chetto, M., Marchand, A.: Dynamic scheduling of skippable periodic tasks: issues and proposals. In: 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based (ECBS 2007), Tucson, Arizona, USA, pp. 171–177 (March 2007)

    Google Scholar 

  11. Wang, Z., Song, Y.-Q., Poggi, E.-M., Sun, Y.: Survey of weakly hard real-time schedule theory and its application. In: Proceedings International Symposium on Distributed Computing and Applications to Business, Engineering and Science (DCABES), pp. 429–437 (2002)

    Google Scholar 

  12. Wang, S.-H., Tsai, G.: Specification and timing analysis of real-time systems. Real-Time Systems 28(1), 69–90 (2004)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ismail, H., Jawawi, D.N.A. (2011). The Specifications of the Weakly Hard Real-Time Systems: A Review. In: Zain, J.M., Wan Mohd, W.M.b., El-Qawasmeh, E. (eds) Software Engineering and Computer Systems. ICSECS 2011. Communications in Computer and Information Science, vol 180. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22191-0_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22191-0_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22190-3

  • Online ISBN: 978-3-642-22191-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics