{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T16:38:11Z","timestamp":1781714291946,"version":"3.54.5"},"reference-count":123,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2021,3,5]],"date-time":"2021-03-05T00:00:00Z","timestamp":1614902400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"European Regional Development Fund under the project AI8Reasoning","award":["CZ.02.1.01\/0.0\/0.0\/15_003\/0000466"],"award-info":[{"award-number":["CZ.02.1.01\/0.0\/0.0\/15_003\/0000466"]}]},{"name":"European Union's Horizon 2020 research and innovation program","award":["832011 (THERMAC)"],"award-info":[{"award-number":["832011 (THERMAC)"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Comput. Surv."],"published-print":{"date-parts":[[2022,1,31]]},"abstract":"<jats:p>This survey covers the basic principles and related works addressing the time-triggered scheduling of periodic tasks with deadlines. The wide range of applications and the increasing complexity of modern real-time systems result in the continually growing interest in this topic. However, the articles in this field appear without systematic notation. To address it, we extend the three-field Graham notation to cover periodic scheduling. Moreover, we formally define three example periodic scheduling problems (PSPs) and provide straightforward implementations of these examples in the Satisfiability Modulo Theories formalism with source codes. Then, we present a summary of the complexity results containing existing polynomially solvable PSPs. We also provide an overview of simple state-of-the-art methods and tricks to solve the PSPs efficiently in terms of time. Next, we survey the existing works on PSP according to the resource environment: scheduling on a single resource, on parallel identical resources, and on dedicated resources. In the survey, we indicate which works propose solution methods for more general PSPs. Finally, we present related problems that are not periodic by nature to provide inspiration for the PSP solution.<\/jats:p>","DOI":"10.1145\/3431232","type":"journal-article","created":{"date-parts":[[2021,3,5]],"date-time":"2021-03-05T11:13:28Z","timestamp":1614942808000},"page":"1-32","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":30,"title":["Survey on Periodic Scheduling for Time-triggered Hard Real-time Systems"],"prefix":"10.1145","volume":"54","author":[{"given":"Anna","family":"Minaeva","sequence":"first","affiliation":[{"name":"Czech Institute of Informatics, Robotics, and Cybernetics, Czech Technical University in PragueDejvice, Czech Republic"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zden\u011bk","family":"Hanz\u00e1lek","sequence":"additional","affiliation":[{"name":"Czech Institute of Informatics, Robotics, and Cybernetics, Czech Technical University in PragueDejvice, Czech Republic"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,3,5]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.809575"},{"key":"e_1_2_1_2_1","volume-title":"Proceedings of the Real-Time Systems Symposium (RTSS\u201920)","author":"Akesson Benny","unstructured":"Benny Akesson , Mitra Nasri , Geoffrey Nelissen , Sebastian Altmeyer , and Robert I. Davis . 2020. An empirical survey-based study into industry practice in real-time systems . In Proceedings of the Real-Time Systems Symposium (RTSS\u201920) . IEEE. Benny Akesson, Mitra Nasri, Geoffrey Nelissen, Sebastian Altmeyer, and Robert I. Davis. 2020. An empirical survey-based study into industry practice in real-time systems. In Proceedings of the Real-Time Systems Symposium (RTSS\u201920). IEEE."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11241-012-9148-y"},{"key":"e_1_2_1_4_1","first-page":"235","article-title":"Comparison of event-triggered and time-triggered concepts with regard to distributed control systems","volume":"2004","author":"Albert Amos","year":"2004","unstructured":"Amos Albert . 2004 . Comparison of event-triggered and time-triggered concepts with regard to distributed control systems . Embed. World 2004 (2004), 235 -- 252 . Amos Albert. 2004. Comparison of event-triggered and time-triggered concepts with regard to distributed control systems. Embed. World 2004 (2004), 235--252.","journal-title":"Embed. World"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11241-018-9322-y"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/2786397.2786403"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2003.12.017"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-002-0085-1"},{"key":"e_1_2_1_10_1","first-page":"594","article-title":"Scheduling the general job-shop. Manage","volume":"31","author":"Barker Jeffrey R.","year":"1985","unstructured":"Jeffrey R. Barker and Graham B. McMahon . 1985 . Scheduling the general job-shop. Manage . Sci. 31 , 5 (1985), 594 -- 598 . Jeffrey R. Barker and Graham B. McMahon. 1985. Scheduling the general job-shop. Manage. Sci. 31, 5 (1985), 594--598.","journal-title":"Sci."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01995675"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ECRTS.2016.14"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/DS-RT.2014.28"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.7873\/DATE.2015.0606"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11081-018-9385-6"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01940882"},{"key":"e_1_2_1_17_1","first-page":"1","article-title":"From dataflow specification to multiprocessor partitioned time-triggered real-time implementation","volume":"2","author":"Carle Thomas","year":"2015","unstructured":"Thomas Carle , Dumitru Potop-Butucaru , Yves Sorel , and David Lesens . 2015 . From dataflow specification to multiprocessor partitioned time-triggered real-time implementation . Leibniz Trans. Embed. Syst. 2 , 2 (2015), 1 -- 1 . Thomas Carle, Dumitru Potop-Butucaru, Yves Sorel, and David Lesens. 2015. From dataflow specification to multiprocessor partitioned time-triggered real-time implementation. Leibniz Trans. Embed. Syst. 2, 2 (2015), 1--1.","journal-title":"Leibniz Trans. Embed. Syst."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11241-015-9226-z"},{"key":"e_1_2_1_19_1","unstructured":"Sheng Cheng John A. Stankovic and Krithivasan Ramamritham. 1988. Scheduling algorithms for hard real-time systems--a brief survey. Tutor. Hard Real-Time Syst. (1988) 150--173.  Sheng Cheng John A. Stankovic and Krithivasan Ramamritham. 1988. Scheduling algorithms for hard real-time systems--a brief survey. Tutor. Hard Real-Time Syst. (1988) 150--173."},{"key":"e_1_2_1_20_1","volume-title":"Proceedings Second International Workshop on Real-Time Computing Systems and Applications. 210--217","author":"Cheng Sheng-Tzong","unstructured":"Sheng-Tzong Cheng and Ashok K. Agrawala . 1995. Allocation and scheduling of real-time periodic tasks with relative timing constraints . Proceedings Second International Workshop on Real-Time Computing Systems and Applications. 210--217 . Sheng-Tzong Cheng and Ashok K. Agrawala. 1995. Allocation and scheduling of real-time periodic tasks with relative timing constraints. Proceedings Second International Workshop on Real-Time Computing Systems and Applications. 210--217."},{"key":"e_1_2_1_21_1","volume-title":"Proceedings of the 22nd International Conference on Real-time Networks and Systems. ACM, 45","author":"Silviu","unstructured":"Silviu S. Craciunas and Ramon Serna Oliver. 2014. SMT-based task-and network-level static schedule generation for time-triggered networked systems . In Proceedings of the 22nd International Conference on Real-time Networks and Systems. ACM, 45 . Silviu S. Craciunas and Ramon Serna Oliver. 2014. SMT-based task-and network-level static schedule generation for time-triggered networked systems. In Proceedings of the 22nd International Conference on Real-time Networks and Systems. ACM, 45."},{"key":"e_1_2_1_22_1","volume-title":"Proceedings of the 10th Real-Time Systems Conference (RTS\u201902)","author":"Cucu Liliana","year":"2002","unstructured":"Liliana Cucu , Remy Kocik , and Yves Sorel . 2002 . Real-time scheduling for systems with precedence, periodicity and latency constraints . Proceedings of the 10th Real-Time Systems Conference (RTS\u201902) . Liliana Cucu, Remy Kocik, and Yves Sorel. 2002. Real-time scheduling for systems with precedence, periodicity and latency constraints. Proceedings of the 10th Real-Time Systems Conference (RTS\u201902)."},{"key":"e_1_2_1_23_1","volume-title":"Proceedings of the 23rd Annual Workshop of the UK Planning and Scheduling Special Interest Group (PLANSIG\u201904)","author":"Cucu Liliana","year":"2004","unstructured":"Liliana Cucu and Yves Sorel . 2004 . Non-preemptive multiprocessor scheduling for strict periodic systems with precedence constraints . Proceedings of the 23rd Annual Workshop of the UK Planning and Scheduling Special Interest Group (PLANSIG\u201904) . Liliana Cucu and Yves Sorel. 2004. Non-preemptive multiprocessor scheduling for strict periodic systems with precedence constraints. Proceedings of the 23rd Annual Workshop of the UK Planning and Scheduling Special Interest Group (PLANSIG\u201904)."},{"key":"e_1_2_1_24_1","volume-title":"Linear Programming and Extensions","author":"Dantzig George Bernard","unstructured":"George Bernard Dantzig . 1998. Linear Programming and Extensions . Princeton University Press , New Jersey . George Bernard Dantzig. 1998. Linear Programming and Extensions. Princeton University Press, New Jersey."},{"key":"e_1_2_1_25_1","volume-title":"Davis and Alan Burns","author":"Robert","year":"2011","unstructured":"Robert I. Davis and Alan Burns . 2011 . A survey of hard real-time scheduling for multiprocessor systems. ACM Comput. Surv. 43, 4, Article 35 (2011), 44 pages. Robert I. Davis and Alan Burns. 2011. A survey of hard real-time scheduling for multiprocessor systems. ACM Comput. Surv. 43, 4, Article 35 (2011), 44 pages."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2013.11.016"},{"key":"e_1_2_1_27_1","volume-title":"IFIP Congress","author":"Deogun Jitender S.","year":"1986","unstructured":"Jitender S. Deogun and M. C. Kong . 1986. On periodic scheduling of time-critical tasks . IFIP Congress ( 1986 ), 791--796. Jitender S. Deogun and M. C. Kong. 1986. On periodic scheduling of time-critical tasks. IFIP Congress (1986), 791--796."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/SIES.2017.7993390"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/WFCS.2014.6837576"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(90)90104-K"},{"key":"e_1_2_1_31_1","first-page":"299","article-title":"Scheduling periodic tasks in a hard real-time environment","volume":"6198","author":"Eisenbrand F.","year":"2010","unstructured":"F. Eisenbrand , N. Hahnle , M. Niemeier , M. Skutella , J. Verschae , and A. Wiese . 2010 a. Scheduling periodic tasks in a hard real-time environment . Autom. Lang. Program. 6198 (2010), 299 -- 311 . F. Eisenbrand, N. Hahnle, M. Niemeier, M. Skutella, J. Verschae, and A. Wiese. 2010a. Scheduling periodic tasks in a hard real-time environment. Autom. Lang. Program. 6198 (2010), 299--311.","journal-title":"Autom. Lang. Program."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15775-2_2"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/WFCS.2000.882557"},{"key":"e_1_2_1_34_1","volume-title":"Proceedings of the Workshop on Compositional Theory and Technology for Real-Time Embedded Systems (CRTS\u201908)","author":"Feiertag Nico","year":"2008","unstructured":"Nico Feiertag , Kai Richter , Johan Nordlander , and Jan Jonsson . 2008 . A compositional framework for end-to-end path delay calculation of automotive systems under different path semantics . In Proceedings of the Workshop on Compositional Theory and Technology for Real-Time Embedded Systems (CRTS\u201908) . Nico Feiertag, Kai Richter, Johan Nordlander, and Jan Jonsson. 2008. A compositional framework for end-to-end path delay calculation of automotive systems under different path semantics. In Proceedings of the Workshop on Compositional Theory and Technology for Real-Time Embedded Systems (CRTS\u201908)."},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/REAL.1995.495205"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/EMWRTS.1997.613773"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/SIES.2015.7185046"},{"key":"e_1_2_1_38_1","volume-title":"Johnson","author":"Garey Michael R.","year":"1979","unstructured":"Michael R. Garey and David S . Johnson . 1979 . Computers and Intractability: A Guide to the Theory of NP-completeness. Vol. 174 . Freeman , San Francisco, 96--105. Michael R. Garey and David S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-completeness. Vol. 174. Freeman, San Francisco, 96--105."},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(94)90080-9"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAES.1976.308251"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-22975-1_8"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/DATE.2012.6176680"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70356-X"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11241-018-9315-x"},{"key":"e_1_2_1_45_1","unstructured":"Claire Hanen and Zdenek Hanzalek. 2020. Periodic scheduling and packing problems. arXiv preprint arXiv:2011.01898.  Claire Hanen and Zdenek Hanzalek. 2020. Periodic scheduling and packing problems. arXiv preprint arXiv:2011.01898."},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-014-0399-4"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64843-5_8"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.5555\/827268.828943"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAES.2015.140063"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/DATE.2012.6176522"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.5555\/1890629.1890656"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11241-009-9088-3"},{"key":"e_1_2_1_53_1","unstructured":"Tobias Jacobs and Salvatore Longo. 2014. A new perspective on the windows scheduling problem. Retrieved from https:\/\/arXiv:1410.7237.  Tobias Jacobs and Salvatore Longo. 2014. A new perspective on the windows scheduling problem. Retrieved from https:\/\/arXiv:1410.7237."},{"key":"e_1_2_1_54_1","volume-title":"Proceedings of the IEEE Real-time Systems Symposium. IEEE, 129--139","author":"Jeffay Kevin","unstructured":"Kevin Jeffay , Donald F. Stanat , and Charles U. Martel . 1991. On non-preemptive scheduling of periodic and sporadic tasks . In Proceedings of the IEEE Real-time Systems Symposium. IEEE, 129--139 . Kevin Jeffay, Donald F. Stanat, and Charles U. Martel. 1991. On non-preemptive scheduling of periodic and sporadic tasks. In Proceedings of the IEEE Real-time Systems Symposium. IEEE, 129--139."},{"key":"e_1_2_1_55_1","volume-title":"Optimizing distributed real-time embedded system handling dependence and several strict periodicity constraints. Adv. Oper. Res. 2011","author":"Kermia Omar","year":"2011","unstructured":"Omar Kermia . 2011. Optimizing distributed real-time embedded system handling dependence and several strict periodicity constraints. Adv. Oper. Res. 2011 ( 2011 ), 561794:1--561794:19. Omar Kermia. 2011. Optimizing distributed real-time embedded system handling dependence and several strict periodicity constraints. Adv. Oper. Res. 2011 (2011), 561794:1--561794:19."},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2017.07.005"},{"key":"e_1_2_1_57_1","volume-title":"Proceedings of the ISCA 20th International Conference on Parallel and Distributed Computing Systems (PDCS\u201907)","author":"Kermia Omar","year":"2007","unstructured":"Omar Kermia and Yves Sorel . 2007 . A rapid heuristic for scheduling non-preemptive dependent periodic tasks onto multiprocessor . In Proceedings of the ISCA 20th International Conference on Parallel and Distributed Computing Systems (PDCS\u201907) . Omar Kermia and Yves Sorel. 2007. A rapid heuristic for scheduling non-preemptive dependent periodic tasks onto multiprocessor. In Proceedings of the ISCA 20th International Conference on Parallel and Distributed Computing Systems (PDCS\u201907)."},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTCSA.2008.44"},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/2997465.2997479"},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-013-0331-3"},{"key":"e_1_2_1_61_1","volume-title":"Art of Computer Programming, Volume 2: Seminumerical Algorithms","author":"Knuth Donald E.","unstructured":"Donald E. Knuth . 2014. Art of Computer Programming, Volume 2: Seminumerical Algorithms . Addison-Wesley Professional . Donald E. Knuth. 2014. Art of Computer Programming, Volume 2: Seminumerical Algorithms. Addison-Wesley Professional."},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2009.12.011"},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2014.06.013"},{"key":"e_1_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1367-5788(03)00002-6"},{"key":"e_1_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8237-7"},{"key":"e_1_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.8.4.428"},{"key":"e_1_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.9.4.351"},{"key":"e_1_2_1_68_1","volume-title":"Jan Karel Lenstra, and Jaap Wessels","author":"Korst Jan","year":"1991","unstructured":"Jan Korst , Emile Aarts , Jan Karel Lenstra, and Jaap Wessels . 1991 . Periodic multiprocessor scheduling. In Parallel Architectures and Languages Europe. Springer , Berlin, 166--178. Jan Korst, Emile Aarts, Jan Karel Lenstra, and Jaap Wessels. 1991. Periodic multiprocessor scheduling. In Parallel Architectures and Languages Europe. Springer, Berlin, 166--178."},{"key":"e_1_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2013.09.018"},{"key":"e_1_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1504\/IJBIC.2010.037018"},{"key":"e_1_2_1_71_1","volume-title":"Proceedings of the 32nd International Conference on Architecture of Computing Systems (ARCS\u201919)","author":"Lalo Erjola","year":"2019","unstructured":"Erjola Lalo , Raphael Weber , Andreas Sailer , Juergen Mottok , and Christian Siemers . 2019 . On solving task allocation and schedule generation for time-triggered LET systems using constraint programming . In Proceedings of the 32nd International Conference on Architecture of Computing Systems (ARCS\u201919) . VDE, 1--8. Erjola Lalo, Raphael Weber, Andreas Sailer, Juergen Mottok, and Christian Siemers. 2019. On solving task allocation and schedule generation for time-triggered LET systems using constraint programming. In Proceedings of the 32nd International Conference on Architecture of Computing Systems (ARCS\u201919). VDE, 1--8."},{"key":"e_1_2_1_72_1","volume-title":"Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference (IPCO\u201992)","author":"Jean","unstructured":"Jean B. Lasserre and Maurice Queyranne. 1992. Generic scheduling polyhedra and a new mixed-integer formulation for single-machine scheduling . Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference (IPCO\u201992) . 136--149. Jean B. Lasserre and Maurice Queyranne. 1992. Generic scheduling polyhedra and a new mixed-integer formulation for single-machine scheduling. Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference (IPCO\u201992). 136--149."},{"key":"e_1_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1145\/1629435.1629485"},{"key":"e_1_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2012.6165039"},{"key":"e_1_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.23919\/DATE.2018.8342096"},{"key":"e_1_2_1_76_1","volume-title":"Proceedings of the 18th International Conference on Real-Time and Network Systems (RTNS\u201910)","author":"Marouf Mohamed","year":"2010","unstructured":"Mohamed Marouf and Yves Sorel . 2010 . Schedulability conditions for non-preemptive hard real-time tasks with strict period . In Proceedings of the 18th International Conference on Real-Time and Network Systems (RTNS\u201910) . 50--58. Mohamed Marouf and Yves Sorel. 2010. Schedulability conditions for non-preemptive hard real-time tasks with strict period. In Proceedings of the 18th International Conference on Real-Time and Network Systems (RTNS\u201910). 50--58."},{"key":"e_1_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.1109\/ETFA.2011.6059014"},{"key":"e_1_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.1109\/ETFA46521.2020.9212029"},{"key":"e_1_2_1_79_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1976.1093424"},{"key":"e_1_2_1_80_1","doi-asserted-by":"publisher","DOI":"10.1109\/IMCSIT.2008.4747349"},{"key":"e_1_2_1_82_1","unstructured":"Anna Minaeva. 2020. SMT implementation of basic periodic scheduling problems using Z3 solver. Retrieved from https:\/\/github.com\/minaeann\/basic_periodic_scheduling_problems.git.  Anna Minaeva. 2020. SMT implementation of basic periodic scheduling problems using Z3 solver. Retrieved from https:\/\/github.com\/minaeann\/basic_periodic_scheduling_problems.git."},{"key":"e_1_2_1_83_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2017.2722443"},{"key":"e_1_2_1_84_1","volume-title":"Control performance optimization for application integration on automotive architectures","author":"Minaeva Anna","year":"2020","unstructured":"Anna Minaeva , Debayan Roy , Benny Akesson , Zdenek Hanzalek , and Samarjit Chakraborty . 2020. Control performance optimization for application integration on automotive architectures . IEEE Trans. Comput . ( 2020 ). Anna Minaeva, Debayan Roy, Benny Akesson, Zdenek Hanzalek, and Samarjit Chakraborty. 2020. Control performance optimization for application integration on automotive architectures. IEEE Trans. Comput. (2020)."},{"key":"e_1_2_1_85_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2015.11.019"},{"key":"e_1_2_1_86_1","doi-asserted-by":"publisher","DOI":"10.1109\/EURMIC.1998.708092"},{"key":"e_1_2_1_87_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIE.2012.2185913"},{"key":"e_1_2_1_88_1","volume-title":"Proceedings of the IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS\u201917)","author":"Nasri Mitra","unstructured":"Mitra Nasri and Bj\u00f6rn B. Brandenburg . 2017. Offline equivalence: A non-preemptive scheduling technique for resource-constrained embedded real-time systems . In Proceedings of the IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS\u201917) . IEEE, 75--86. Mitra Nasri and Bj\u00f6rn B. Brandenburg. 2017. Offline equivalence: A non-preemptive scheduling technique for resource-constrained embedded real-time systems. In Proceedings of the IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS\u201917). IEEE, 75--86."},{"key":"e_1_2_1_89_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(98)00221-X"},{"key":"e_1_2_1_90_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-739X(98)00041-7"},{"key":"e_1_2_1_91_1","volume-title":"Proceedings of the IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS\u201918)","author":"Oliver Ramon Serna","year":"2018","unstructured":"Ramon Serna Oliver , Silviu S. Craciunas , and Wilfried Steiner . 2018 . IEEE 802.1 Qbv gate control list synthesis using array theory encoding . In Proceedings of the IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS\u201918) . IEEE, 13--24. Ramon Serna Oliver, Silviu S. Craciunas, and Wilfried Steiner. 2018. IEEE 802.1 Qbv gate control list synthesis using array theory encoding. In Proceedings of the IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS\u201918). IEEE, 13--24."},{"key":"e_1_2_1_92_1","volume-title":"Proceedings of the International Conference on Hardware\/Software Codesign and System Synthesis. ACM, 1--10","author":"Pani\u0107 Milo\u0161","unstructured":"Milo\u0161 Pani\u0107 , Sebastian Kehr , Eduardo Qui\u00f1ones , Bert Boddecker , Jaume Abella , and Francisco J. Cazorla . 2014. Runpar: An allocation algorithm for automotive applications exploiting runnable parallelism in multicores . In Proceedings of the International Conference on Hardware\/Software Codesign and System Synthesis. ACM, 1--10 . Milo\u0161 Pani\u0107, Sebastian Kehr, Eduardo Qui\u00f1ones, Bert Boddecker, Jaume Abella, and Francisco J. Cazorla. 2014. Runpar: An allocation algorithm for automotive applications exploiting runnable parallelism in multicores. In Proceedings of the International Conference on Hardware\/Software Codesign and System Synthesis. ACM, 1--10."},{"key":"e_1_2_1_93_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.33.3.690"},{"key":"e_1_2_1_94_1","doi-asserted-by":"publisher","DOI":"10.5555\/1167736.1711216"},{"key":"e_1_2_1_95_1","volume-title":"Proceedings of the 9th International Conference on Distributed Computing Systems. IEEE, 190--198","author":"Peng D.-T.","unstructured":"D.-T. Peng and Kang G. Shin . 1989. Static allocation of periodic tasks with precedence constraints in distributed real-time systems . In Proceedings of the 9th International Conference on Distributed Computing Systems. IEEE, 190--198 . D.-T. Peng and Kang G. Shin. 1989. Static allocation of periodic tasks with precedence constraints in distributed real-time systems. In Proceedings of the 9th International Conference on Distributed Computing Systems. IEEE, 190--198."},{"key":"e_1_2_1_96_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.221134"},{"key":"e_1_2_1_97_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-014-0389-6"},{"key":"e_1_2_1_98_1","doi-asserted-by":"publisher","DOI":"10.1145\/1289816.1289873"},{"key":"e_1_2_1_99_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11241-015-9232-1"},{"key":"e_1_2_1_100_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2011.10.009"},{"key":"e_1_2_1_101_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.1990.89256"},{"key":"e_1_2_1_102_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.372795"},{"key":"e_1_2_1_103_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISORC.2015.24"},{"key":"e_1_2_1_104_1","volume-title":"Proceedings of the 28th Annual Hawaii International Conference on System Sciences","volume":"2","author":"Ronngren Stefan","unstructured":"Stefan Ronngren and Behrooz A. Shirazi . 1995. Static multiprocessor scheduling of periodic real-time tasks with precedence constraints and communication costs . In Proceedings of the 28th Annual Hawaii International Conference on System Sciences , Vol. 2 . IEEE, 143--152. Stefan Ronngren and Behrooz A. Shirazi. 1995. Static multiprocessor scheduling of periodic real-time tasks with precedence constraints and communication costs. In Proceedings of the 28th Annual Hawaii International Conference on System Sciences, Vol. 2. IEEE, 143--152."},{"key":"e_1_2_1_105_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTAS.2016.7461344"},{"key":"e_1_2_1_106_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2015.2488480"},{"key":"e_1_2_1_107_1","doi-asserted-by":"publisher","DOI":"10.1109\/DATE.2011.5763150"},{"key":"e_1_2_1_108_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009804226473"},{"key":"e_1_2_1_109_1","doi-asserted-by":"publisher","DOI":"10.1145\/3139258.3139289"},{"key":"e_1_2_1_110_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS.2010.25"},{"key":"e_1_2_1_111_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.mcm.2007.05.009"},{"key":"e_1_2_1_112_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11241-018-9320-0"},{"key":"e_1_2_1_113_1","doi-asserted-by":"publisher","DOI":"10.1145\/2380445.2380518"},{"key":"e_1_2_1_114_1","doi-asserted-by":"publisher","DOI":"10.1109\/SBAC-PAD.2004.7"},{"key":"e_1_2_1_115_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(80)90269-1"},{"key":"e_1_2_1_116_1","volume-title":"Van Laarhoven and Emile H. L. Aarts","author":"Peter J.","year":"1987","unstructured":"Peter J. M. Van Laarhoven and Emile H. L. Aarts . 1987 . Simulated Annealing : Theory and Applications. Springer . Peter J. M. Van Laarhoven and Emile H. L. Aarts. 1987. Simulated Annealing: Theory and Applications. Springer."},{"key":"e_1_2_1_117_1","volume-title":"Enhancing schedulability and throughput of time-triggered traffic in IEEE 802.1 Qbv time-sensitive networks","author":"Vlk Marek","year":"2020","unstructured":"Marek Vlk , Zden\u011bk Hanz\u00e1lek , Kate\u0159ina Brejchov\u00e1 , Siyu Tang , Sushmit Bhattacharjee , and Songwei Fu. 2020. Enhancing schedulability and throughput of time-triggered traffic in IEEE 802.1 Qbv time-sensitive networks . IEEE Trans. Commun . ( 2020 ). Marek Vlk, Zden\u011bk Hanz\u00e1lek, Kate\u0159ina Brejchov\u00e1, Siyu Tang, Sushmit Bhattacharjee, and Songwei Fu. 2020. Enhancing schedulability and throughput of time-triggered traffic in IEEE 802.1 Qbv time-sensitive networks. IEEE Trans. Commun. (2020)."},{"key":"e_1_2_1_118_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(83)90044-5"},{"key":"e_1_2_1_119_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.214831"},{"key":"e_1_2_1_120_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.48943"},{"key":"e_1_2_1_121_1","doi-asserted-by":"publisher","DOI":"10.1145\/123041.123066"},{"key":"e_1_2_1_123_1","doi-asserted-by":"publisher","DOI":"10.15514\/ISPRAS-2017-29(6)-10"},{"key":"e_1_2_1_124_1","doi-asserted-by":"publisher","DOI":"10.1134\/S0361768818030076"},{"key":"e_1_2_1_125_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2014.6742876"},{"key":"e_1_2_1_126_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2016.04.014"}],"container-title":["ACM Computing Surveys"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3431232","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3431232","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:24:45Z","timestamp":1750195485000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3431232"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,5]]},"references-count":123,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1,31]]}},"alternative-id":["10.1145\/3431232"],"URL":"https:\/\/doi.org\/10.1145\/3431232","relation":{},"ISSN":["0360-0300","1557-7341"],"issn-type":[{"value":"0360-0300","type":"print"},{"value":"1557-7341","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,3,5]]},"assertion":[{"value":"2019-12-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-10-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-03-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}