Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Integrating optional software components into hard real-time systems

Integrating optional software components into hard real-time systems

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
Software Engineering Journal — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

© The Institution of Electrical Engineers
Published

The incorporation of optional components (i.e. software modules that cannot be analysed to produce realistic worst case execution times) into hard real-time applications has been recognised as a key issue for the next generation of real-time systems. A system model is presented that caters for the three main approaches to integrating optional components: milestone methods, sieve functions and multiple versions. The formal language TAM is used to describe this model. Further, an approach to ensuring that the mandatory components of this model are guaranteed to meet their deadlines is described, and the optional components are admitted for scheduling such that the utility of the system is maximised.

References

    1. 1)
      • Tindell, K.W.: `Adding time-offsets to schedulability analysis', Technical report, 1994.
    2. 2)
      • Locke, C.D.: `Best-effort decision making for real-time scheduling', Technical report, 10 may 1986.
    3. 3)
      • J.W.S. Liu , K.J. Lin , W.K. Shih , A.C.S. Yu , J.Y. Chung , W. Zhao . Algorithms for scheduling imprecise computations. IEEE Computer , 58 - 68
    4. 4)
      • Audsley, N.C., Burns, A., Wellings, A.J.: `Unbounded algorithms, predictable real-time systems and Ada 9x', Proc. IEEE Workshop on Imprecise and Approximate Computation, 1 December 1992, p. 11–15.
    5. 5)
      • M. Joseph , P. Pandya . Finding response times in a real-time system. Computer J. , 5 , 390 - 395
    6. 6)
      • Audsley, N.C., Burns, A., Richardson, M.F., Wellings, A.J.: `Hard real-time scheduling: The dead line monotonic approach', Proc. 8th IEEE Workshop on Real-Time Operating Systems and Software, 15–17 May 1991.
    7. 7)
      • Scholefield, D.J., Zedan, H.S.M., He, J.: `A predicative semantics for the refinement of real-time systems', Proc. MFPS IX, 1993, New Orleans.
    8. 8)
      • D.J. Scholefield , H.S.M. Zedan , J. He . A specification oriented semantics for the refinement of real-time systems. Theoret. Computer Sci.
    9. 9)
      • J.A. Stankovic , K. Ramamritham . What is predictability for real-time systems?. Real-Time Syst. , 4 , 247 - 254
    10. 10)
      • Liu, J.W.S., Lin, K.J., Natarajan, S.: `Scheduling real-time, periodic jobs using imprecise results', Proc. 8th IEEE Real-Time Systems Symp., 1–3 December 1987, p. 252–260, (Imprecise scheduling periodic uniprocessor spare-capacity RTSS).
    11. 11)
      • Cheng, S.C., Stankovic, J.A., Ramamritham, K.: `Dynamic scheduling of groups of tasks with precedence constraints in distributed hard real-time systems', Technical report, November 1987.
    12. 12)
      • L. Sha , R. Rajkumar , J.P. Lehoczky . Priority inheritance protocols: An approach to real-time synchronisation. IEEE Trans. , 9 , 1175 - 1185
    13. 13)
      • Scholefield, D.J.: `A refinement calculus for real-time systems', 1992, PhD Thesis, University of York.
    14. 14)
      • Scholefield, D.J., Zedan, H.S.M., He, J.: `Real-time refinement: Semantics and application', Proc. MFCS 93, October 1993, Gdansk.
    15. 15)
      • A. Burns , A.J. Wellings . Criticality and utility in the next generation. Real-Time Syst. , 4 , 351 - 354
    16. 16)
      • Lehoczky, J., Sha, L., Ding, Y.: `The rate-monotonic scheduling algorithm: Exact characterization and average case behaviour', Proc. IEEE Real-Time Systems Symp., 5–7 December 1989, p. 166–171, (RTSS RATEMONO uniprocessor rate-monotonic).
    17. 17)
      • Lizza, C.S., Banks, S.B., Whelan, M.A.: `Pilot's associate: evolution of a functional prototype', AGARD Conf. Proc. 499, 1991, Machine Intelligence for Aerospace Electronic Systems, p. 16.1–16.12.
http://iet.metastore.ingenta.com/content/journals/10.1049/sej.1996.0019
Loading

Related content

content/journals/10.1049/sej.1996.0019
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
Print this page
This is a required field
Please enter a valid email address