Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Dependable Software Engineering: Theories, Tools, and Applications

SETTA 2017: Dependable Software Engineering. Theories, Tools, and Applications pp 94–109Cite as

Multi-core Cyclic Executives for Safety-Critical Systems

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 10606))

Abstract

In a cyclic executive, a series of pre-determined frames are executed in sequence; once the series is complete the sequence is repeated. Within each frame individual units of computation are executed, again in a pre-specified sequence. The implementation of cyclic executives upon multi-core platforms is considered. A Linear Programming (LP) based formulation is presented of the problem of constructing cyclic executives upon multiprocessors for a particular kind of recurrent real-time workload – collections of implicit-deadline periodic tasks. Techniques are described for solving the LP formulation under different kinds of restrictions in order to obtain preemptive and non-preemptive cyclic executives.

This is a preview of subscription content, 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 EPUB and 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

Learn about institutional subscriptions

Notes

  1. 1.

    Multiple major schedules may be defined for a single system, specifying the desired system behavior for different modes of system operation; switching between modes is accomplished by swapping the major schedule used. If a major cycle is of not too large a duration, then switches between modes may be restricted to only occur at the end of major cycles.

  2. 2.

    We highlight that these are periodic, not sporadic, tasks: \(\tau _i\) generates jobs at time-instants \(k\times T_i\), for all \(k\in \mathbb {N}\).

  3. 3.

    Recall from Sect. 4.1 above that a basic solution to an LP is an optimal solution that is a vertex point of the feasible region defined by the constraints of the LP.

References

  1. Baker, T.P., Shaw, A.: The cyclic executive model and Ada. In: Proceedings of the IEEE Real-Time Systems Symposium, pp. 120–129 (1988)

    Google Scholar 

  2. Bini, E., Buttazzo, G.: Measuring the performance of schedulability tests. Real-Time Syst. 30(1–2), 129–154 (2005)

    Article  MATH  Google Scholar 

  3. Burns, A., Fleming, T., Baruah, S.: Cyclic executives, multi-core platforms and mixed criticality applications. In: Proceedings of the 2015 27th EuroMicro Conference on Real-Time Systems, ECRTS 2015. IEEE Computer Society Press, Lund (Sweden) (2015)

    Google Scholar 

  4. Epstein, L., Levin, A.: Scheduling with processing set restrictions: PTAS results for several variants. Int. J. Prod. Econ. 133(2), 586–595 (2011)

    Article  Google Scholar 

  5. Fleming, T., Burns, A.: Extending mixed criticality scheduling. In: Proceedings of the International Workshop on Mixed Criticality Systems (WMC), December 2013

    Google Scholar 

  6. Gurobi Optimization Inc: Gurobi Optimizer Reference Manual (2016). http://www.gurobi.com

  7. Karmakar, N.: A new polynomial-time algorithm for linear programming. Combinatorica 4, 373–395 (1984)

    Article  MathSciNet  Google Scholar 

  8. Karp, R.: Reducibility among combinatorial problems. In: Miller, R., Thatcher, J. (eds.) Complexity of Computer Computations, pp. 85–103. Plenum Press, New York (1972)

    Chapter  Google Scholar 

  9. Khachiyan, L.: A polynomial algorithm in linear programming. Dokklady Akademiia Nauk SSSR 244, 1093–1096 (1979)

    MathSciNet  MATH  Google Scholar 

  10. Lenstra, J.K., Shmoys, D., Tardos, E.: Approximation algorithms for scheduling unrelated parallel machines. Math. Program. 46, 259–271 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  11. Liu, J.W.S.: Real-Time Systems. Prentice-Hall Inc., Upper Saddle River (2000)

    Google Scholar 

  12. McNaughton, R.: Scheduling with deadlines and loss functions. Manag. Sci. 6, 1–12 (1959)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

This research is supported by NSF grants CNS 1409175 and CPS 1446631, AFOSR grant FA9550-14-1-0161, and ARO grant W911NF-14-1-0499.

Author information

Authors and Affiliations

  1. The University of North Carolina at Chapel Hill, Chapel Hill, USA

    Calvin Deutschbein

  2. The University of York, York, UK

    Tom Fleming & Alan Burns

  3. Washington University in St. Louis, St. Louis, USA

    Sanjoy Baruah

Authors
  1. Calvin Deutschbein
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tom Fleming
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Alan Burns
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Sanjoy Baruah
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sanjoy Baruah .

Editor information

Editors and Affiliations

  1. Aalborg University, Aalborg, Denmark

    Kim Guldstrand Larsen

  2. University of Pennsylvania, Philadelphia, Pennsylvania, USA

    Oleg Sokolsky

  3. National University of Defense Technology, Changsha, China

    Ji Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Deutschbein, C., Fleming, T., Burns, A., Baruah, S. (2017). Multi-core Cyclic Executives for Safety-Critical Systems. In: Larsen, K., Sokolsky, O., Wang, J. (eds) Dependable Software Engineering. Theories, Tools, and Applications. SETTA 2017. Lecture Notes in Computer Science(), vol 10606. Springer, Cham. https://doi.org/10.1007/978-3-319-69483-2_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-69483-2_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-69482-5

  • Online ISBN: 978-3-319-69483-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation