Document Open Access Logo

The Safe and Effective Use of Low-Assurance Predictions in Safety-Critical Systems

Authors Kunal Agrawal , Sanjoy Baruah , Michael A. Bender , Alberto Marchetti-Spaccamela

PDF
Thumbnail PDF

File

LIPIcs.ECRTS.2023.3.pdf
  • Filesize: 0.97 MB
  • 19 pages

Document Identifiers

Author Details

Kunal Agrawal
  • Washington University in Saint Louis, MO, USA
Sanjoy Baruah
  • Washington University in Saint Louis, MO, USA
Michael A. Bender
  • Stony Brook University, NY, USA
Alberto Marchetti-Spaccamela
  • Sapienza Università di Roma, Italy

Funding

  • Baruah, Sanjoy: US National Science Foundation (Grants CPS- 1932530, CNS-2141256, and CNS-2229290)
  • Bender, Michael A.: {US National Science Foundation (Grants CCF-2247577 and CCF-2106827)}
  • Marchetti-Spaccamela, Alberto: ERC 788893 AMDROMA, Sapienza Res. Proj. RM11816436B2F886

Cite AsGet BibTex

Kunal Agrawal, Sanjoy Baruah, Michael A. Bender, and Alberto Marchetti-Spaccamela. The Safe and Effective Use of Low-Assurance Predictions in Safety-Critical Systems. In 35th Euromicro Conference on Real-Time Systems (ECRTS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 262, pp. 3:1-3:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
https://doi.org/10.4230/LIPIcs.ECRTS.2023.3

Abstract

The algorithm-design paradigm of algorithms using predictions is explored as a means of incorporating the computations of lower-assurance components (such as machine-learning based ones) into safety-critical systems that must have their correctness validated to very high levels of assurance. The paradigm is applied to two simple example applications that are relevant to the real-time systems community: energy-aware scheduling, and classification using ML-based classifiers in conjunction with more reliable but slower deterministic classifiers. It is shown how algorithms using predictions achieve much-improved performance when the low-assurance computations are correct, at a cost of no more than a slight performance degradation even when they turn out to be completely wrong.

Subject Classification

ACM Subject Classification
  • Computer systems organization → Real-time systems
  • Software and its engineering → Scheduling
Keywords
  • Algorithms using predictions
  • robust scheduling
  • energy minimization
  • classification
  • on-line scheduling

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

References

  1. Tarek Abdelzaher, Kunal Agrawal, Sanjoy Baruah, Alan Burns, Robert I. Davis, Zhishan Guo, and Yigong Hu. Scheduling IDK classifiers with arbitrary dependences to minimize the expected time to successful classification. Real-Time Systems (to appear), 2023. URL: https://www-users.york.ac.uk/~rd17/papers/IDKarbitrary.pdf.
  2. Antonios Antoniadis, Peyman Jabbarzade, and Golnoosh Shahkarami. A Novel Prediction Setup for Online Speed-Scaling. In Artur Czumaj and Qin Xin, editors, 18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022), volume 227 of Leibniz International Proceedings in Informatics (LIPIcs), pages 9:1-9:20, Dagstuhl, Germany, 2022. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.SWAT.2022.9.
  3. Etienne Bamas, Andreas Maggiori, Lars Rohwedder, and Ola Svensson. Learning augmented energy minimization via speed scaling. In H. Larochelle, M. Ranzato, R. Hadsell, M.F. Balcan, and H. Lin, editors, Advances in Neural Information Processing Systems, volume 33, pages 15350-15359. Curran Associates, Inc., 2020. URL: https://proceedings.neurips.cc/paper/2020/file/af94ed0d6f5acc95f97170e3685f16c0-Paper.pdf.
  4. Mario Bambagini, Mauro Marinoni, Hakan Aydin, and Giorgio Buttazzo. Energy-aware scheduling for real-time systems: A survey. ACM Trans. Embed. Comput. Syst., 15(1), January 2016. URL: https://doi.org/10.1145/2808231.
  5. Sanjoy Baruah, Alan Burns, Robert Davis, and Yue Wu. Optimally ordering IDK classifiers subject to deadlines. Real Time Syst., 2022. URL: https://doi.org/10.1007/s11241-022-09383-w.
  6. Sanjoy Baruah, Alan Burns, and Yue Wu. Optimal synthesis of IDK-cascades. In Proceedings of the Twenty-Ninth International Conference on Real-Time and Network Systems, RTNS '21, New York, NY, USA, 2021. ACM. Google Scholar
  7. C. K. Chow. An optimum character recognition system using decision functions. IRE Transactions on Electronic Computers, EC-6(4):247-254, 1957. URL: https://doi.org/10.1109/TEC.1957.5222035.
  8. Corinna Cortes, Giulia DeSalvo, and Mehryar Mohri. Learning with rejection. In Ronald Ortner, Hans Ulrich Simon, and Sandra Zilles, editors, Algorithmic Learning Theory, pages 67-82. Springer International Publishing, 2016. Google Scholar
  9. Bartloomiej Kocot, Pawel Czarnul, and Jerzy Proficz. Energy-aware scheduling for high-performance computing systems: A survey. Energies, 16(2), 2023. URL: https://www.mdpi.com/1996-1073/16/2/890.
  10. Russell Lee, Jessica Maghakian, Mohammad Hajiesmaili, Jian Li, Ramesh Sitaraman, and Zhenhua Liu. Online peak-aware energy scheduling with untrusted advice. In Proceedings of the Twelfth ACM International Conference on Future Energy Systems, e-Energy '21, pages 107-123, New York, NY, USA, 2021. Association for Computing Machinery. URL: https://doi.org/10.1145/3447555.3464860.
  11. C. Liu and J. Layland. Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of the ACM, 20(1):46-61, 1973. Google Scholar
  12. David Madras, Toniann Pitassi, and Richard Zemel. Predict responsibly: Improving fairness and accuracy by learning to defer. In Proceedings of the 32nd International Conference on Neural Information Processing Systems, NIPS'18, pages 6150-6160, Red Hook, NY, USA, 2018. Curran Associates Inc. Google Scholar
  13. Aloysius Mok. Fundamental Design Problems of Distributed Systems for The Hard-Real-Time Environment. PhD thesis, Laboratory for Computer Science, Massachusetts Institute of Technology, 1983. Available as Technical Report No. MIT/LCS/TR-297. Google Scholar
  14. Tim Roughgarden, editor. Beyond the Worst-Case Analysis of Algorithms. Cambridge University Press, 2020. URL: https://doi.org/10.1017/9781108637435.
  15. Richard S Sutton and Andrew G Barto. Reinforcement Learning: An Introduction. MIT press, 2018. Google Scholar
  16. Reinhard Wilhelm, Jakob Engblom, Andreas Ermedahl, Niklas Holsti, Stephan Thesing, David Whalley, Guillem Bernat, Christian Ferdinand, Reinhold Heckmann, Tulika Mitra, Frank Mueller, Isabelle Puaut, Peter Puschner, Jan Staschulat, and Per Stenström. The worst-case execution-time problem - overview of methods and survey of tools. ACM Transactions on Embedded Computing Systems, 7(3):36:1-36:53, May 2008. Google Scholar
  17. F. Yao, A. Demers, and S. Shenker. A scheduling model for reduced CPU energy. In IEEE, editor, 36th Annual Symposium on Foundations of Computer Science: October 23-25, 1995, Milwaukee, Wisconsin, pages 374-382, 1109 Spring Street, Suite 300, Silver Spring, MD 20910, USA, 1995. IEEE Computer Society Press. Google Scholar
  18. Tianming Zhao, Wei Li, and Albert Y. Zomaya. Real-time scheduling with predictions. In IEEE Real-Time Systems Symposium, RTSS 2022, Houston, TX, USA, December 5-8, 2022, pages 331-343. IEEE, 2022. URL: https://doi.org/10.1109/RTSS55097.2022.00036.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact