Anna Minaeva
Skip Abstract Section
Abstract
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.
- Tarek F. Abdelzaher and Kang G. Shin. 1999. Combined task and message scheduling in distributed real-time systems. IEEE Trans. Parallel Distrib. Syst. 10, 11 (1999), 1179--1191.Google Scholar
Digital Library
- 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’20). IEEE.Google Scholar
- Ahmad Al Sheikh, Olivier Brun, Pierre-Emmanuel Hladik, and Balakrishna J. Prabhu. 2012. Strictly periodic scheduling in IMA-based architectures. Real-Time Syst. 48, 4 (2012), 359--386.Google ScholarDigital Library
- Amos Albert. 2004. Comparison of event-triggered and time-triggered concepts with regard to distributed control systems. Embed. World 2004 (2004), 235--252.Google Scholar
- Muhammad Ali Awan, Pedro F. Souto, Benny Akesson, Konstantinos Bletsas, and Eduardo Tovar. 2019. Uneven memory regulation for scheduling IMA applications on multi-core platforms. Real-Time Syst. 55, 2 (2019), 248--292.Google ScholarDigital Library
- Egon Balas. 1968. Project Scheduling with Resource Constraints. Technical Report. Carnegie-Mellon University, Pittsburgh, PA.Google Scholar
- Amotz Bar-Noy, Randeep Bhatia, Joseph (Seffi) Naor, and Baruch Schieber. 2002a. Minimizing service and operation costs of periodic scheduling. Math. Oper. Res. 27, 3 (2002), 518--544.Google ScholarDigital Library
- Amotz Bar-Noy, Vladimir Dreizin, and Boaz Patt-Shamir. 2004. Efficient algorithms for periodic scheduling. Comput. Netw. 45, 2 (2004), 155--173.Google ScholarDigital Library
- Amotz Bar-Noy, Aviv Nisgav, and Boaz Patt-Shamir. 2002b. Nearly optimal perfectly periodic schedules. Distrib. Comput. 15, 4 (2002), 207--220.Google ScholarDigital Library
- Jeffrey R. Barker and Graham B. McMahon. 1985. Scheduling the general job-shop. Manage. Sci. 31, 5 (1985), 594--598.Google ScholarDigital Library
- Sanjoy K. Baruah, Louis E. Rosier, and Rodney R. Howell. 1990. Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor. Real-time Syst. 2, 4 (1990), 301--324.Google ScholarDigital Library
- Matthias Becker, Dakshina Dasari, Borislav Nicolic, Benny Akesson, Vincent Nélis, and Thomas Nolte. 2016. Contention-free execution of automotive applications on a clustered many-core platform. In Proceedings of the 28th Euromicro Conference on Real-Time Systems (ECRTS’16). 14--24.Google ScholarCross Ref
- Sofiene Beji, Sardaouna Hamadou, Abdelouahed Gherbi, and John Mullins. 2014. SMT-based cost optimization approach for the integration of avionic functions in IMA and TTEthernet architectures. Proceedings of the IEEE/ACM 18th International Symposium on Distributed Simulation and Real-Time Applications. 165--174.Google ScholarDigital Library
- Alexander Biewer, Benjamin Andres, Jens Gladigau, Torsten Schaub, and Christian Haubelt. 2015. A symbolic system synthesis approach for hard real-time systems based on coordinated SMT-solving. In Proceedings of the Design, Automation and Test in Europe Conference and Exhibition (DATE’15). EDA Consortium. 357--362.Google ScholarCross Ref
- Mathias Blikstad, Emil Karlsson, Tomas Lööw, and Elina Rönnberg. 2017. An optimisation approach for pre-runtime scheduling of tasks and communication in an integrated modular avionic system. Optimization and Engineering 19, 4 (2018), 977--1004.Google ScholarCross Ref
- Yang Cai and M. C. Kong. 1996. Nonpreemptive scheduling of periodic tasks in uni- and multiprocessor systems. Algorithmica 15, 6 (1996), 572--599.Google ScholarDigital Library
- 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.Google Scholar
- Jinchao Chen, Chenglie Du, Fei Xie, and Zhenkun Yang. 2016. Schedulability analysis of non-preemptive strictly periodic tasks in multi-core real-time systems. Real-Time Syst. 52, 3 (2016), 239--271.Google ScholarDigital Library
- 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.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- 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’02).Google Scholar
- 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’04).Google Scholar
- George Bernard Dantzig. 1998. Linear Programming and Extensions. Princeton University Press, New Jersey.Google Scholar
- 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.Google ScholarDigital Library
- Federico Della Croce, Fabio Salassa, and Vincent T’kindt. 2014. A hybrid heuristic approach for single machine scheduling with release times. Comput. Operat. Res. 45 (2014), 7--11.Google ScholarDigital Library
- Jitender S. Deogun and M. C. Kong. 1986. On periodic scheduling of time-critical tasks. IFIP Congress (1986), 791--796.Google Scholar
- Emilie Deroche, Jean-Luc Scharbarg, and Christian Fraboul. 2017. A greedy heuristic for distributing hard real-time applications on an IMA architecture. In Proceedings of the 12th IEEE International Symposium on Industrial Embedded Systems. IEEE, Toulouse, France, 1--8.Google ScholarCross Ref
- Jan Dvorak and Zdenek Hanzalek. 2014. Multi-variant time constrained FlexRay static segment scheduling. In Proceedings of the 10th IEEE Workshop on Factory Communication Systems (WFCS’14). 1--8.Google ScholarCross Ref
- Martin E. Dyer and Laurence A. Wolsey. 1990. Formulating the single machine sequencing problem with release dates as a mixed integer program. Discrete Appl. Math. 26, 2--3 (1990), 255--270.Google ScholarDigital Library
- 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.Google Scholar
- Friedrich Eisenbrand, Karthikeyan Kesavan, Raju S. Mattikalli, Martin Niemeier, Arnold W. Nordsieck, Martin Skutella, José Verschae, and Andreas Wiese. 2010b. Solving an avionics real-time scheduling problem by advanced IP-methods. In Proceedings of the European Symposium on Algorithms. 11--22.Google ScholarCross Ref
- Sebastien Faucou, A.-M. Deplanche, and J.-P. Beauvais. 2000. Heuristic techniques for allocating and scheduling communicating periodic tasks in distributed real-time systems. Proceedings of the IEEE International Workshop on Factory Communication System. 257--265.Google ScholarCross Ref
- 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’08).Google Scholar
- Gerhard Fohler. 1995. Joint scheduling of distributed complex periodic and hard aperiodic tasks in statically scheduled systems. In Proceedings of the 16th IEEE Real-Time Systems Symposium. IEEE, 152--161.Google ScholarCross Ref
- Gerhard Fohler and Krithi Ramamritham. 1997. Static scheduling of pipelined periodic tasks in distributed real-time systems. In Proceedings of the 9th Euromicro Workshop on Real Time Systems. IEEE, 128--135.Google ScholarCross Ref
- Matthias Freier and Jian-Jia Chen. 2015. Time-triggered communication scheduling analysis for real-time multicore systems. In Proceedings of the 10th IEEE International Symposium on Industrial Embedded Systems (SIES’15). IEEE, 1--9.Google ScholarCross Ref
- 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.Google ScholarDigital Library
- Celia A. Glass. 1994. Feasibility of scheduling lot sizes of two frequencies on one machine. Eur. J. Oper. Res. 75, 2 (1994), 354--364.Google ScholarCross Ref
- M. J. Gonzalez and Jin W. Soh. 1976. Periodic job scheduling in a distributed processor system. IEEE Trans. Aerospace Electron. Syst. AES-12, 5 (1976), 530--536.Google ScholarCross Ref
- Raul Gorcitz, Emilien Kofman, Thomas Carle, Dumitru Potop-Butucaru, and Robert De Simone. 2015. On the scalability of constraint solving for static/off-line real-time scheduling. In Proceedings of the International Conference on Formal Modeling and Analysis of Timed Systems. Springer, 108--123.Google ScholarCross Ref
- Dip Goswami, Martin Lukasiewycz, Reinhard Schneider, and Samarjit Chakraborty. 2012. Time-triggered implementations of mixed-criticality automotive software. In Proceedings of the Conference on Design, Automation and Test in Europe. 1227--1232.Google ScholarCross Ref
- Ronald L. Graham, Eugene L. Lawler, Jan Karel Lenstra, and A. H. G. Rinnooy Kan. 1979. Optimization and approximation in deterministic sequencing and scheduling: A survey. Ann. Discrete Math. 5 (1979), 287--326.Google ScholarCross Ref
- Arpan Gujarati, Felipe Cerqueira, Björn B. Brandenburg, and Geoffrey Nelissen. 2019. Correspondence article: A correction of the reduction-based schedulability analysis for APA scheduling. Real-Time Syst. 55, 1 (2019), 136--143.Google ScholarDigital Library
- Claire Hanen and Zdenek Hanzalek. 2020. Periodic scheduling and packing problems. arXiv preprint arXiv:2011.01898.Google Scholar
- Zdenek Hanzalek and Claire Hanen. 2015. The impact of core precedences in a cyclic RCPSP with precedence delays. J. Schedul. 18, 3 (2015), 275--284.Google ScholarDigital Library
- Richard Hladík, Anna Minaeva, and Zdeněk Hanzálek. 2020. On the complexity of a periodic scheduling problem with precedence relations. In Proceedings of the 14th Annual International Conference on Combinatorial Optimization and Applications (COCOA’20).Google ScholarCross Ref
- Chih-Wen Hsueh and Kwei-Jay Lin. 1996. An optimal pinwheel scheduler using the single-number reduction technique. In Proceedings of the 17th IEEE Real-Time Systems Symposium. IEEE, 196--205.Google ScholarDigital Library
- Menglan Hu, Jun Luo, Yang Wang, and Bharadwaj Veeravalli. 2015. Scheduling periodic task graphs for safety-critical time-triggered avionic systems. IEEE Trans. Aerospace Electron. Syst. 51, 3 (2015), 2294--2304.Google ScholarCross Ref
- Jia Huang, Jan Olaf Blech, Andreas Raabe, Christian Buckl, and Alois Knoll. 2012. Static scheduling of a time-triggered network-on-chip based on SMT solving. In Proceedings of the Design, Automation and Test in Europe Conference and Exhibition (DATE’12). IEEE, 509--514.Google ScholarCross Ref
- Damir Isovic and Gerhard Fohler. 2000. Efficient scheduling of sporadic, aperiodic, and periodic tasks with complex constraints. In Proceedings of the 21st IEEE Real-Time Systems Symposium. IEEE, 207--216.Google ScholarDigital Library
- Damir Isovic and Gerhard Fohler. 2009. Handling mixed sets of tasks in combined offline and online scheduled real-time systems. Real-time Syst. 43, 3 (2009), 296--325.Google ScholarDigital Library
- Tobias Jacobs and Salvatore Longo. 2014. A new perspective on the windows scheduling problem. Retrieved from https://arXiv:1410.7237.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- Omar Kermia. 2017. An efficient approach for the multiprocessor non-preemptive strictly periodic task scheduling problem. J. Syst. Architect. 79 (2017), 31--44.Google ScholarDigital Library
- 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’07).Google Scholar
- Omar Kermia and Yves Sorel. 2008. Schedulability analysis for non-preemptive tasks under strict periodicity constraints. In Proceedings of the 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications. IEEE, 25--32.Google ScholarDigital Library
- Jad Khatib, Alix Munier-Kordon, Enagnon Cédric Klikpo, and Kods Trabelsi-Colibet. 2016. Computing latency of a real-time system modeled by synchronous dataflow graph. In Proceedings of the 24th International Conference on Real-Time Networks and Systems. ACM, 87--96.Google ScholarDigital Library
- Eun-Seok Kim and Celia A. Glass. 2014. Perfect periodic scheduling for three basic cycles. J. Schedul. 17, 1 (2014), 47--65.Google ScholarDigital Library
- Donald E. Knuth. 2014. Art of Computer Programming, Volume 2: Seminumerical Algorithms. Addison-Wesley Professional.Google Scholar
- Oumar Koné, Christian Artigues, Pierre Lopez, and Marcel Mongeau. 2011. Event-based MILP models for resource-constrained project scheduling problems. Comput. Oper. Res. 38, 1 (2011), 3--13.Google ScholarDigital Library
- Anis Kooli and Mehdi Serairi. 2014. A mixed integer programming approach for the single machine problem with unequal release dates. Comput. Oper. Res. 51 (2014), 323--330.Google ScholarDigital Library
- Hermann Kopetz. 2003. Time-triggered real-time computing. Annu. Rev. Control 27, 1 (2003), 3--13.Google ScholarCross Ref
- Hermann Kopetz. 2011. Real-time Systems: Design Principles for Distributed Embedded Applications. Springer Science 8 Business Media.Google ScholarCross Ref
- Jan Korst, Emile Aarts, and Jan Karel Lenstra. 1996. Scheduling periodic tasks. INFORMS J. Comput. 8, 4 (1996), 428--435.Google ScholarDigital Library
- Jan Korst, Emile Aarts, and Jan Karel Lenstra. 1997. Scheduling periodic tasks with slack. INFORMS J. Comput. 9, 4 (1997), 351--362.Google ScholarDigital Library
- Jan Korst, Emile Aarts, Jan Karel Lenstra, and Jaap Wessels. 1991. Periodic multiprocessor scheduling. In Parallel Architectures and Languages Europe. Springer, Berlin, 166--178.Google Scholar
- Yacine Laalaoui and Nizar Bouguila. 2014. Pre-run-time scheduling in real-time systems: Current researches and artificial intelligence perspectives. Expert Syst. Appl. 41, 5 (2014), 2196--2210.Google ScholarDigital Library
- Yacine Laalaoui and Habiba Drias. 2010. ACO approach with learning for preemptive scheduling of real-time tasks. Int. J. Bio-Inspired Comput. 2, 6 (2010), 383--394.Google ScholarDigital Library
- 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’19). VDE, 1--8.Google Scholar
- 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’92). 136--149.Google Scholar
- Martin Lukasiewycz, Michael Glaß, Jürgen Teich, and Paul Milbredt. 2009. FlexRay schedule optimization of the static segment. In Proceedings of the 7th IEEE/ACM International Conference on Hardware/software Codesign and System Synthesis. IEEE/ACM, 363--372.Google ScholarDigital Library
- Martin Lukasiewycz, Reinhard Schneider, Dip Goswami, and Samarjit Chakraborty. 2012. Modular scheduling of distributed heterogeneous time-triggered automotive systems. In Proceedings of the 17th Asia and South Pacific Design Automation Conference. IEEE. 665--670.Google ScholarCross Ref
- Rouhollah Mahfouzi, Amir Aminifar, Soheil Samii, Ahmed Rezine, Petru Eles, and Zebo Peng. 2018. Stability-aware integrated routing and scheduling for control applications in Ethernet networks. In Proceedings of the Design, Automation and Test in Europe Conference and Exhibition (DATE’18). IEEE, 682--687.Google ScholarCross Ref
- 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’10). 50--58.Google Scholar
- Mohamed Marouf and Yves Sorel. 2011. Scheduling non-preemptive hard real-time tasks with strict periods. In Proceedings of the IEEE 16th Conference on Emerging Technologies and Factory Automation (ETFA’11). IEEE, 1--8.Google ScholarCross Ref
- Shane D. McLean, Silviu S. Craciunas, Emil Alexander Juul Hansen, and Paul Pop. 2020. Mapping and scheduling automotive applications on ADAS platforms using metaheuristics. In Proceedings of the 25th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA’20), Vol. 1. IEEE, 329--336.Google ScholarCross Ref
- Philip Merlin and David Farber. 1976. Recoverability of communication protocols-implications of a theoretical study. IEEE Trans. Commun. 24, 9 (1976), 1036--1043.Google ScholarCross Ref
- Philippe Michelon, Dominique Quadri, and Marcos Negreiros. 2008. On a class of periodic scheduling problems: Models, lower bounds and heuristics. In Proceedings of the International Multiconference on Computer Science and Information Technology. IEEE, 899--906.Google ScholarCross Ref
- Anna Minaeva. 2019. Scalable Scheduling Algorithms for Embedded Systems with Real-Time Requirements. Ph.D. Dissertation. Czech Technical University in Prague.Google Scholar
- Anna Minaeva. 2020. SMT implementation of basic periodic scheduling problems using Z3 solver. Retrieved from https://github.com/minaeann/basic_periodic_scheduling_problems.git.Google Scholar
- Anna Minaeva, Benny Akesson, Zdeněk Hanzálek, and Dakshina Dasari. 2017. Time-triggered co-scheduling of computation and communication with jitter requirements. IEEE Trans. Comput. 67, 1 (2017), 115--129.Google ScholarDigital Library
- 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).Google Scholar
- Anna Minaeva, Přemysl Šůcha, Benny Akesson, and Zdeněk Hanzálek. 2016. Scalable and efficient configuration of time-division multiplexed resources. J. Syst. Softw. 113 (2016), 44--58.Google ScholarDigital Library
- Yannick Monnier, Jean-Pierre Beauvais, and Anne-Marie Déplanche. 1998. A genetic algorithm for scheduling tasks in a real-time distributed system. In Proceedings of the 24th Euromicro Conference. IEEE, 708--714.Google ScholarCross Ref
- Aurélien Monot, Nicolas Navet, Bernard Bavoux, and Françoise Simonot-Lion. 2012. Multisource software on multicore automotive ECUs—combining runnable sequencing with task scheduling. IEEE Trans. Industr. Electron. 59, 10 (2012), 3934--3942.Google ScholarCross Ref
- Mitra Nasri and Björn 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’17). IEEE, 75--86.Google Scholar
- Jerzy R. Nawrocki, Adam Czajka, and Wojciech Complak. 1998. Scheduling cyclic tasks with binary periods. Info. Process. Lett. 65, 4 (1998), 173--178.Google ScholarDigital Library
- Roman Nossal. 1998. An evolutionary approach to multiprocessor scheduling of dependent tasks. Future Gen. Comput. Syst. 14, 5--6 (1998), 383--392.Google ScholarDigital Library
- 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’18). IEEE, 13--24.Google Scholar
- Miloš Panić, Sebastian Kehr, Eduardo Quiñones, 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.Google Scholar
- Kyung S. Park and Doek K. Yun. 1985. Optimal scheduling of periodic activities. Oper. Res. 33, 3 (1985), 690--695.Google ScholarDigital Library
- Shailesh Patil and Vijay K. Garg. 2006. Adaptive general perfectly periodic scheduling. Info. Process. Lett. 98, 3 (2006), 107--114.Google ScholarDigital Library
- 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.Google Scholar
- D.-T. Peng and Kang G. Shin. 1993. Optimal scheduling of cooperative tasks in a distributed system using an enumerative method. IEEE Trans. Softw. Eng. 19, 3 (1993), 253--267.Google ScholarDigital Library
- Clément Pira and Christian Artigues. 2016. Line search method for solving a non-preemptive strictly periodic scheduling problem. J. Schedul. 19, 3 (2016), 227--243.Google ScholarDigital Library
- Paul Pop, Kåre Harbo Poulsen, Viacheslav Izosimov, and Petru Eles. 2007. Scheduling and voltage scaling for energy/reliability trade-offs in fault-tolerant time-triggered embedded systems. In Proceedings of the 5th IEEE/ACM International Conference on Hardware/software Codesign and System Synthesis. 233--238.Google ScholarDigital Library
- Wolfgang Puffitsch, Eric Noulard, and Claire Pagetti. 2015. Off-line mapping of multi-rate dependent task sets to many-core platforms. Real-Time Syst. 51, 5 (2015), 526--565.Google ScholarDigital Library
- Diogo Quintas and Vasilis Friderikos. 2012. Energy efficient spatial TDMA scheduling in wireless networks. Comput. Oper. Res. 39, 9 (2012), 2091--2099.Google ScholarDigital Library
- Krithi Ramamritham. 1990. Allocation and scheduling of complex periodic tasks. In Proceedings of the 10th International Conference on Distributed Computing Systems. IEEE, 108--115.Google ScholarCross Ref
- K. Ramamritham. 1995. Allocation and scheduling of precedence-related periodic tasks. IEEE Trans. Parall. Distrib. Syst. 6, 4 (Apr. 1995), 412--420.Google ScholarDigital Library
- Jin Woo Ro, Partha Roop, and Avinash Malik. 2015. Schedule synthesis for time-triggered multi-hop wireless networks with retransmissions. In Proceedings of the IEEE 18th International Symposium on Real-Time Distributed Computing. IEEE, 94--101.Google ScholarDigital Library
- 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.Google Scholar
- Debayan Roy, Licong Zhang, Wanli Chang, Dip Goswami, and Samarjit Chakraborty. 2016. Multi-objective co-optimization of FlexRay-based distributed control systems. In Proceedings of the IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS’16). IEEE, 1--12.Google ScholarCross Ref
- Florian Sagstetter, Peter Waszecki, Sebastian Steinhorst, Martin Lukasiewycz, and Samarjit Chakraborty. 2015. Multischedule synthesis for variant management in automotive time-triggered systems. IEEE Trans. Comput.-Aid. Design Integr. Circ. Syst. 35, 4 (2015), 637--650.Google ScholarCross Ref
- Thijs Schenkelaars, Bart Vermeulen, and Kees Goossens. 2011. Optimal scheduling of switched FlexRay networks. In Proceedings of the Design, Automation and Test in Europe Conference and Exhibition (DATE’11). 1--6.Google ScholarCross Ref
- Klaus Schild and Jörg Würtz. 2000. Scheduling of time-triggered real-time systems. Constraints 5, 4 (2000), 335--357.Google ScholarDigital Library
- Eike Schweissguth, Peter Danielis, Dirk Timmermann, Helge Parzyjegla, and Gero Mühl. 2017. ILP-based joint routing and scheduling for time-triggered networks. In Proceedings of the 25th International Conference on Real-Time Networks and Systems. 8--17.Google ScholarDigital Library
- W. Steiner. 2010. An evaluation of SMT-based schedule synthesis for time-triggered multi-hop networks. In Proceedings of the 31st IEEE Real-Time Systems Symposium (RTSS’10). 375--384.Google ScholarDigital Library
- Premysl Sucha and Zdenek Hanzalek. 2008. Deadline constrained cyclic scheduling on pipelined dedicated processors considering multiprocessor tasks and changeover times. Math. Comput. Model. 47, 9 (2008), 925--942.Google ScholarDigital Library
- Ali Syed and Gerhard Fohler. 2019. Efficient offline scheduling of task-sets with complex constraints on large distributed time-triggered systems. Real-Time Syst. 55, 2 (2019), 209--247.Google ScholarDigital Library
- Domitian Tamas-Selicean, Paul Pop, and Wilfried Steiner. 2012. Synthesis of communication schedules for TTEthernet-based mixed-criticality systems. In Proceedings of the 8th IEEE/ACM/IFIP International Conference on Hardware/software Codesign and System Synthesis. ACM, 473--482.Google ScholarDigital Library
- Eduardo Tavares, Raimundo Barreto, Meuse Oliveira Junior, Paulo Maciel, Marilia Neves, and Ricardo Lima. 2004. An approach for pre-runtime scheduling in embedded hard real-time systems with power constraints. In Proceedings of the16th Symposium on Computer Architecture and High Performance Computing. IEEE, 188--195.Google ScholarDigital Library
- Robert Tijdeman. 1980. The chairman assignment problem. Discrete Math. 32, 3 (1980), 323--330.Google ScholarDigital Library
- Peter J. M. Van Laarhoven and Emile H. L. Aarts. 1987. Simulated Annealing: Theory and Applications. Springer.Google Scholar
- Marek Vlk, Zdeněk Hanzálek, Kateřina Brejchová, 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).Google Scholar
- W. D. Wei and C. L. Liu. 1983. On a periodic maintenance problem. Oper. Res. Lett. 2, 2 (1983), 90--93.Google ScholarDigital Library
- Jia Xu. 1993. Multiprocessor scheduling of processes with release times, deadlines, precedence, and exclusion relations. IEEE Trans. Softw. Eng. 19, 2 (1993), 139--154.Google ScholarDigital Library
- Jia Xu and David Lorge Parnas. 1990. Scheduling processes with release times, deadlines, precedence and exclusion relations. IEEE Trans. Softw. Eng. 16, 3 (1990), 360--369.Google ScholarDigital Library
- Jia Xu and David Lorge Parnas. 1991. On satisfying timing constraints in hard-real-time systems. ACM SIGSOFT Softw. Eng. Notes 16, 5 (1991), 132--146.Google ScholarDigital Library
- Patrick Meumeu Yomsi and Yves Sorel. 2008. Schedulability Analysis for Non Necessarily Harmonic Real-time Systems with Precedence and Strict Periodicity Constraints Using the Exact Number of Preemptions and No Idle Time. Ph.D. Dissertation. INRIA.Google Scholar
- Sophia Anatolievna Zelenova and Sergey Vadimovich Zelenov. 2017. Non-conflict scheduling criterion for strict periodic tasks. Proc. Inst. Syst. Program. RAS 29, 6 (2017), 183--202 (in Russian).Google ScholarCross Ref
- Sophia A. Zelenova and Sergey V. Zelenov. 2018. Schedulability analysis for strictly periodic tasks in RTOS. Program. Comput. Softw. 44, 3 (2018), 159--169.Google ScholarDigital Library
- Licong Zhang, Debkalpa Goswami, Reinhard Schneider, and Shiladri Chakraborty. 2014. Task- and network-level schedule co-synthesis of Ethernet-based time-triggered systems. In Proceedings of the 19th Asia and South Pacific Design Automation Conference (ASP-DAC’14). IEEE, 119--124.Google ScholarCross Ref
- Tianyu Zhang, Nan Guan, Qingxu Deng, and Wang Yi. 2016. Start time configuration for strictly periodic real-time task systems. J. Syst. Architect. 66 (2016), 61--68.Google ScholarDigital Library
Index Terms
- Survey on Periodic Scheduling for Time-triggered Hard Real-time Systems
Recommendations
A survey of hard real-time scheduling for multiprocessor systems
This survey covers hard real-time scheduling algorithms and schedulability analysis techniques for homogeneous multiprocessor systems. It reviews the key results in this field from its origins in the late 1960s to the latest research published in late ...
Simulation-based evaluations of DAG scheduling in hard real-time multiprocessor systems
The scheduling of parallel real-time tasks on multiprocessor systems is more complicated than the one of independent sequential tasks, specially for the Directed Acyclic Graph (DAG) model. The complexity is due to the structure of DAG tasks and the ...
A Pre-Run-Time Scheduling Algorithm for Hard Real-Time Systems
Process scheduling, an important issue in the design and maintenance of hard real-time systems, is discussed. A pre-run-time scheduling algorithm that addresses the problem of process sequencing is presented. The algorithm is designed for multiprocessor ...
Comments