Skip to main content
Log in

Correspondence article: a correction of the reduction-based schedulability analysis for APA scheduling

  • Published:
Real-Time Systems Aims and scope Submit manuscript

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2

References

  • Baruah S, Brandenburg BB (2013) Multiprocessor feasibility analysis of recurrent task systems with specified processor affinities. In: 34th IEEE international real-time systems symposium (RTSS’13)

  • Bertogna M, Cirinei M (2007) Response-time analysis for globally scheduled symmetric multiprocessor platforms. In: 28th IEEE international real-time systems symposium (RTSS’07)

  • Bonifaci V, Brandenburg BB, DAngelo G, Marchetti-Spaccamela A (2016) Multiprocessor real-time scheduling with hierarchical processor affinities. In: 28th Euromicro conference on real-time systems (ECRTS’16)

  • Cerqueira F, Gujarati A, Brandenburg BB (2014) Linux’s processor affinity API, refined: shifting real-time tasks towards higher schedulability. In: 35th IEEE international real-time systems symposium (RTSS’14)

  • Cerqueira F, Stutz F, Brandenburg BB (2016a) Prosa: a case for readable mechanized schedulability analysis. In: 28th Euromicro conference on real-time systems (ECRTS’16)

  • Cerqueira F, Stutz F, Brandenburg BB (2016b) Prosa: mechanized proofs of reduction-based APA schedulability analysis. http://prosa.mpi-sws.org/releases/v0.2/apa/

  • Gujarati A, Cerqueira F, Brandenburg BB (2013) Schedulability analysis of the Linux push and pull scheduler with arbitrary processor affinities. In: 25th Euromicro conference on real-time systems (ECRTS’13)

  • Gujarati A, Cerqueira F, Brandenburg BB (2015a) Multiprocessor real-time scheduling with arbitrary processor affinities: from practice to theory. Real Time Syst 51(4):440–483

    Article  MATH  Google Scholar 

  • Gujarati A, Cerqueira F, Brandenburg BB (2015b) Revised version: schedulability analysis of the Linux push and pull scheduler with arbitrary processor affinities, revision 1. https://www.mpi-sws.org/~bbb/papers/

  • Lelli J, Scordino C, Abeni L, Faggioli D (2016) Deadline scheduling in the Linux kernel. Soft Pract Exp 46(6):821–839

    Article  Google Scholar 

  • Lynx Software Technologies (2018) LynxOS RTOS. http://www.lynx.com/products/real-time-operating-systems/lynxos-rtos/

  • QNX Software Systems (2010) Processor affinity or bound multiprocessing? Easing the migration to embedded multicore processing. http://www.qnx.com/content/dam/qnx/whitepapers/2010/qnx_bmp_vs_processor_affinity.pdf

  • Wind River Systems, Inc (2014) Wind River VxWorks Platforms 6.9. https://www.windriver.com/products/product-notes/PN_VE_6_9_Platform_0311.pdf

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Björn B. Brandenburg.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Partially funded by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation)—391919384.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Gujarati, A., Cerqueira, F., Brandenburg, B.B. et al. Correspondence article: a correction of the reduction-based schedulability analysis for APA scheduling. Real-Time Syst 55, 136–143 (2019). https://doi.org/10.1007/s11241-018-9315-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11241-018-9315-x

Navigation