Papers
Topics
Authors
Recent
Search
2000 character limit reached

Joint Optimization of Continuous Variables and Priority Assignments for Real-Time Systems with Black-box Schedulability Constraints

Published 6 Jan 2024 in eess.SY and cs.SY | (2401.03284v2)

Abstract: In real-time systems optimization, designers often face a challenging problem posed by the non-convex and non-continuous schedulability conditions, which may even lack an analytical form to understand their properties. To tackle this challenging problem, we treat the schedulability analysis as a black box that only returns true/false results. We propose a general and scalable framework to optimize real-time systems, named Numerical Optimizer with Real-Time Highlight (NORTH). NORTH is built upon the gradient-based active-set methods from the numerical optimization literature but with new methods to manage active constraints for the non-differentiable schedulability constraints. In addition, we also generalize NORTH to NORTH+, to collaboratively optimize certain types of discrete variables (e.g., priority assignments, categorical variables) with continuous variables based on numerical optimization algorithms. We demonstrate the algorithm performance with two example applications: energy minimization based on dynamic voltage and frequency scaling (DVFS), and optimization of control system performance. In these experiments, NORTH achieved $102$ to $105$ times speed improvements over state-of-the-art methods while maintaining similar or better solution quality. NORTH+ outperforms NORTH by 30% with similar algorithm scalability. Both NORTH and NORTH+ support black-box schedulability analysis, ensuring broad applicability.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (63)
  1. N. Audsley, A. Burns, M. Richardson, K. Tindell, and A. J. Wellings, “Applying new scheduling theory to static priority pre-emptive scheduling,” Software engineering journal, vol. 8, no. 5, pp. 284–292, 1993.
  2. S. Baruah, A. K. Mok, and L. E. Rosier, “Preemptively scheduling hard-real-time sporadic tasks on one processor,” [1990] Proceedings 11th Real-Time Systems Symposium, pp. 182–190, 1990.
  3. L. Thiele, S. Chakraborty, and M. Naedele, “Real-time calculus for scheduling hard real-time systems,” in 2000 IEEE International Symposium on Circuits and Systems (ISCAS), vol. 4, pp. 101–104 vol.4, 2000.
  4. R. Henia, A. Hamann, M. Jersak, R. Racu, K. Richter, and R. Ernst, “System level performance analysis–the symta/s approach,” IEE Proceedings-Computers and Digital Techniques, vol. 152, no. 2, pp. 148–166, 2005.
  5. K. G. Larsen, P. Pettersson, and W. Yi, “Uppaal in a nutshell,” International Journal on Software Tools for Technology Transfer, vol. 1, pp. 134–152, 1997.
  6. M. Nasri, G. Nelissen, and B. B. Brandenburg, “Response-time analysis of limited-preemptive parallel dag tasks under global scheduling,” in ECRTS, 2019.
  7. L. Heintzman, A. Hashimoto, N. Abaid, and R. K. Williams, “Anticipatory planning and dynamic lost person models for Human-Robot search and rescue,” in 2021 IEEE International Conference on Robotics and Automation (ICRA), pp. 8252–8258, ieeexplore.ieee.org, May 2021.
  8. A. H. Simon Kramer, Dirk Ziegenbein, “Real world automotive benchmarks for free,” in 6th International Workshop on Analysis Tools and Methodologies for Embedded and Real-time Systems (WATERS), 2015.
  9. Y. Zhao, V. Gala, and H. Zeng, “A unified framework for period and priority optimization in distributed hard real-time systems,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 37, no. 11, pp. 2188–2199, 2018.
  10. Y. Zhao, R. Zhou, and H. Zeng, “An optimization framework for real-time systems with sustainable schedulability analysis,” 2020 IEEE Real-Time Systems Symposium (RTSS), pp. 333–344, 2020.
  11. Y. Zhao, R. Zhou, and H. Zeng, “Design optimization for real-time systems with sustainable schedulability analysis,” Real-Time Systems, vol. 58, no. 3, pp. 275–312, 2022.
  12. S. Baruah and A. Burns, “Sustainable scheduling analysis,” in 2006 27th IEEE International Real-Time Systems Symposium (RTSS’06), pp. 159–168, IEEE, 2006.
  13. A. Burns and S. Baruah, “Sustainability in real-time scheduling,” J. Comput. Sci. Eng., vol. 2, pp. 74–97, 2008.
  14. Springer New York, NY, 2006.
  15. M. Shin and M. Sunwoo, “Optimal period and priority assignment for a networked control system scheduled by a fixed priority scheduling system,” International Journal of Automotive Technology, vol. 8, pp. 39–48, 2007.
  16. K. Tindell, A. Burns, and A. Wellings, “Allocating hard real-time tasks: An np-hard problem made easy,” Real-Time Systems, vol. 4, pp. 145–165, 2004.
  17. J. Jonsson and K. Shin, “A parametrized branch-and-bound strategy for scheduling precedence-constrained tasks on a multiprocessor system,” Proceedings of the 1997 International Conference on Parallel Processing (Cat. No.97TB100162), pp. 158–165, 1997.
  18. M. Natale, L. Guo, H. Zeng, and A. Sangiovanni-Vincentelli, “Synthesis of multitask implementations of simulink models with minimum delays,” IEEE Transactions on Industrial Informatics, vol. 6, pp. 637–651, 2010.
  19. H. Zeng and M. Di Natale, “Efficient implementation of autosar components with minimal memory usage,” in 7th IEEE International Symposium on Industrial Embedded Systems (SIES’12), pp. 130–137, IEEE, 2012.
  20. H. Aydin, V. Devadas, and D. Zhu, “System-level energy management for periodic real-time tasks,” 2006 27th IEEE International Real-Time Systems Symposium (RTSS’06), pp. 313–322, 2006.
  21. M. Bambagini, M. Marinoni, H. Aydin, and G. Buttazzo, “Energy-aware scheduling for real-time systems: A survey,” ACM Trans. Embed. Comput. Syst., vol. 15, pp. 7:1–7:34, 2016.
  22. Y. Zhao and H. Zeng, “The virtual deadline based optimization algorithm for priority assignment in fixed-priority scheduling,” in 2017 IEEE Real-Time Systems Symposium (RTSS), pp. 116–127, IEEE, 2017.
  23. M. POWELL, “A new algorithm for unconstrained optimization,” in Nonlinear Programming (J. Rosen, O. Mangasarian, and K. Ritter, eds.), pp. 31–65, Academic Press, 1970.
  24. D. Marquardt, “An algorithm for least-squares estimation of nonlinear parameters,” Journal of The Society for Industrial and Applied Mathematics, vol. 11, pp. 431–441, 1963.
  25. M. V. Balashov, B. Polyak, and A. A. Tremba, “Gradient projection and conditional gradient methods for constrained nonconvex minimization,” Numerical Functional Analysis and Optimization, vol. 41, pp. 822 – 849, 2019.
  26. J. A. Nelder and R. Mead, “A simplex method for function minimization,” Comput. J., vol. 7, pp. 308–313, 1965.
  27. S. Lee, H. Baek, H. Woo, K. G. Shin, and J. Lee, “Ml for rt: Priority assignment using machine learning,” 2021 IEEE 27th Real-Time and Embedded Technology and Applications Symposium (RTAS), pp. 118–130, 2021.
  28. Z. Bo, Y. Qiao, C. Leng, H. Wang, C. Guo, and S. Zhang, “Developing real-time scheduling policy by deep reinforcement learning,” 2021 IEEE 27th Real-Time and Embedded Technology and Applications Symposium (RTAS), pp. 131–142, 2021.
  29. F. F. Yao, A. Demers, and S. Shenker, “A scheduling model for reduced cpu energy,” Proceedings of IEEE 36th Annual Foundations of Computer Science, pp. 374–382, 1995.
  30. P. Pillai and K. Shin, “Real-time dynamic voltage scaling for low-power embedded operating systems,” Proceedings of the eighteenth ACM symposium on Operating systems principles, 2001.
  31. A. Qadi, S. Goddard, and S. Farritor, “A dynamic voltage scaling algorithm for sporadic tasks,” RTSS 2003. 24th IEEE Real-Time Systems Symposium, 2003, pp. 52–62, 2003.
  32. C.-H. Lee and K. Shin, “On-line dynamic voltage scaling for hard real-time systems using the edf algorithm,” 25th IEEE International Real-Time Systems Symposium, pp. 319–335, 2004.
  33. E. Bini, G. Buttazzo, and G. Lipari, “Minimizing cpu energy in real-time systems with discrete speed management,” ACM Trans. Embed. Comput. Syst., vol. 8, pp. 31:1–31:23, 2009.
  34. A. Bhuiyan, D. Liu, A. Khan, A. Saifullah, N. Guan, and Z. Guo, “Energy-efficient parallel real-time scheduling on clustered multi-core,” IEEE Transactions on Parallel and Distributed Systems, vol. 31, pp. 2097–2111, 2020.
  35. A. Bhuiyan, F. Reghenzani, W. Fornaciari, and Z. Guo, “Optimizing energy in non-preemptive mixed-criticality scheduling by exploiting probabilistic information,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 39, pp. 3906–3917, 2020.
  36. G. M. Mancuso, E. Bini, and G. Pannocchia, “Optimal priority assignment to control tasks,” ACM Trans. Embed. Comput. Syst., vol. 13, pp. 161:1–161:17, 2014.
  37. A. Davare, Q. Zhu, M. D. Natale, C. Pinello, S. Kanajan, and A. L. Sangiovanni-Vincentelli, “Period optimization for hard real-time distributed automotive systems,” 2007 44th ACM/IEEE Design Automation Conference, pp. 278–283, 2007.
  38. E. Bini and M. D. Natale, “Optimal task rate selection in fixed priority systems,” 26th IEEE International Real-Time Systems Symposium (RTSS’05), pp. 11 pp.–409, 2005.
  39. S. Wang, R. K. Williams, and H. Zeng, “A general and scalable method for optimizing real-time systems with continuous variables,” IEEE Real-Time and Embedded Technology and Applications Symposium, pp. 119–132, 2023.
  40. P. Huang, P. Kumar, G. Giannopoulou, and L. Thiele, “Energy efficient dvfs scheduling for mixed-criticality systems,” 2014 International Conference on Embedded Software (EMSOFT), pp. 1–10, 2014.
  41. Z. Guo, A. Bhuiyan, D. Liu, A. Khan, A. Saifullah, and N. Guan, “Energy-efficient real-time scheduling of dags on clustered multi-core platforms,” 2019 IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS), pp. 156–168, 2019.
  42. S. Pagani and J.-J. Chen, “Energy efficient task partitioning based on the single frequency approximation scheme,” 2013 IEEE 34th Real-Time Systems Symposium, pp. 308–318, 2013.
  43. M. Joseph and P. K. Pandya, “Finding response times in a real-time system,” Comput. J., vol. 29, pp. 390–395, 1986.
  44. K. Levenberg, “A method for the solution of certain non – linear problems in least squares,” Quarterly of Applied Mathematics, vol. 2, pp. 164–168, 1944.
  45. R. I. Davis, A. Zabos, and A. Burns, “Efficient exact schedulability tests for fixed priority real-time systems,” IEEE Transactions on Computers, vol. 57, pp. 1261–1276, 2008.
  46. F. Dorin, P. Richard, M. Richard, and J. Goossens, “Schedulability and sensitivity analysis of multiple criticality tasks with fixed-priorities,” Real-Time Systems, vol. 46, pp. 305–331, 2010.
  47. P. B. Betoret, I. Ripoll, and A. Crespo, “Minimum deadline calculation for periodic real-time tasks in dynamic priority systems,” IEEE Transactions on Computers, vol. 57, pp. 96–109, 2008.
  48. C. Liu and J. Layland, “Scheduling algorithms for multiprogramming in a hard-real-time environment,” J. ACM, vol. 20, pp. 46–61, 1973.
  49. J. H. Friedman, T. J. Hastie, H. Hofling, and R. Tibshirani, “Pathwise coordinate optimization,” The Annals of Applied Statistics, vol. 1, pp. 302–332, 2007.
  50. S. P. Boyd and L. Vandenberghe, “Convex optimization,” IEEE Transactions on Automatic Control, vol. 51, pp. 1859–1859, 2006.
  51. F. Dellaert, “Factor graphs and gtsam: A hands-on introduction,” in Factor Graphs and GTSAM: A Hands-on Introduction, 2012.
  52. F. Dellaert and M. Kaess, “Factor graphs for robot perception,” Found. Trends Robotics, vol. 6, pp. 1–139, 2017.
  53. M. Kaess, A. Ranganathan, and F. Dellaert, “isam: Incremental smoothing and mapping,” IEEE Transactions on Robotics, vol. 24, pp. 1365–1378, 2008.
  54. M. Mukadam, J. Dong, F. Dellaert, and B. Boots, “Steap: simultaneous trajectory estimation and planning,” Autonomous Robots, pp. 1–20, 2018.
  55. S. Wang, J. Chen, X. Deng, S. A. Hutchinson, and F. Dellaert, “Robot calligraphy using pseudospectral optimal control in conjunction with a novel dynamic brush model,” 2020 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), pp. 6696–6703, 2020.
  56. A. Mutapcic, K. Koh, S. Kim, and S. Boyd, “Ggplab version 1.00: a matlab toolbox for geometric programming,” 2006.
  57. J. Lofberg, “Yalmip : a toolbox for modeling and optimization in matlab,” 2004 IEEE International Conference on Robotics and Automation (IEEE Cat. No.04CH37508), pp. 284–289, 2004.
  58. A. Wächter and L. T. Biegler, “On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming,” Mathematical Programming, vol. 106, pp. 25–57, 2006.
  59. A. W. Winkler, “Ifopt - A modern, light-weight, Eigen-based C++ interface to Nonlinear Programming solvers Ipopt and Snopt.,” 2018.
  60. Q. He, M. Lv, and N. Guan, “Response time bounds for dag tasks with arbitrary intra-task priority assignment,” in ECRTS, 2021.
  61. M. Verucchi, M. Theile, M. Caccamo, and M. Bertogna, “Latency-aware generation of single-rate dags from multi-rate task sets,” 2020 IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS), pp. 226–238, 2020.
  62. S. Bozhko, G. von der Bruggen, and B. B. Brandenburg, “Monte carlo response-time analysis,” 2021 IEEE Real-Time Systems Symposium (RTSS), 2021.
  63. H. Zeng and M. D. Natale, “An efficient formulation of the real-time feasibility region for design optimization,” IEEE Trans. Computers, vol. 62, pp. 644–661, 2013.
Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.