Abstract
The avionic industry has recently adopted the Integrated Modular Avionics (IMA). Such architectures allow the execution of avionic functions on a shared computing platform while avoiding any interference between them. This is done through hard memory and temporal segregation constraints. Although IMA reduces the weight and the power consumption and shortens the design-cycle times, it gives rise to a complex multiprocessor scheduling problem. One of the key difficulties of this problem is related to the strict periodicity of tasks, which means that the time separating two successive executions of the same task is strictly equal to the associated period. In order to help the system designer in producing a proper schedule, an exact formulation based on Integer Linear Programming and a heuristic inspired from Game Theory are proposed. To enhance the solution quality of the heuristic, a multi-start method, which gives some probabilistic guarantees on the optimality of the solutions, is also introduced.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ahuja R, Magnanti T, Orlin J, Weihe K (1993) Network flows: theory, algorithms, and applications. Prentice Hall, Englewood Cliffs
Al-Sheikh A, Brun O, Hladik PE (2010) Partition scheduling on an IMA platform with strict periodicity and communication delays. In: Proceedings of the 18th international conference on real-time and network systems (RTNS 2010), pp 179–188
Al-Sheikh A, Brun O, Hladik PE, Prabhu BJ (2011) A best-response algorithm for multiprocessor periodic scheduling. In: Proceedings of the 23rd Euromicro conference on real-time systems (ECRTS 2011), pp 228–237
Baruah S, Chakraborty S (2006) Schedulability analysis of non-preemptive recurring real-time tasks. In: Proceedings 20th IEEE international parallel & distributed processing symposium, p 149
Boender C, Rinnooy Kan A (1987) Bayesian stopping rules for multistart global optimization methods. Math Program 37(1):59–80
Campbell AM, Hardin JR (2005) Vehicle minimization for periodic deliveries. Eur J Oper Res 165(3):668–684
Cormen TH, Leiserson CE, Rivest RL, Stein C (2001) Introduction to algorithms. MIT Press, Cambridge
Coulouris G, Dollimore J, Kindberg T (2005) Distributed systems: concepts and design. Addison-Wesley/Longman, Reading/Harlow
Eisenbrand F, Hähnle N, Niemeier M, Skutella M, Verschae J, Wiese A (2010a) Scheduling periodic tasks in a hard real-time environment. In: Automata, languages and programming, pp 299–311
Eisenbrand F, Kesavan K, Mattikalli R, Niemeier M, Nordsieck A, Skutella M, Verschae J, Wiese A (2010b) Solving an avionics real-time scheduling problem by advanced IP-methods. In: Algorithms (ESA 2010), pp 11–22
Ferguson T (2010) Linear programming: a concise introduction. Website. Available at http://www.math.ucla.edu/~tom/LP.pdf
Fudenberg D, Tirole J (1991) Game theory. MIT Press, Cambridge
ILOG CPLEX: http://www.ilog.com/products/cplex/ (2011)
Kermia O, Sorel Y (2007) A rapid heuristic for scheduling non-preemptive dependent periodic tasks onto multiprocessor. In: Proceedings of ISCA 20th international conference on parallel and distributed computing systems (PDCS), vol 7
Korst J (1992) Periodic multiprocessor scheduling. PhD thesis, Eindhoven university of technology, Eindhoven, the Netherlands
Korst J, Aarts E, Lenstra JK (1996) Scheduling periodic tasks. INFORMS J Comput 8:428–435
Korst J, Aarts E, Lenstra JK (1997) Scheduling periodic tasks with slack. INFORMS J Comput 9:351–362
Koutsoupias E, Papadimitriou C (1999) Worst-case equilibria. In: Proceedings of the 16th annual conference on theoretical aspects of computer science, pp 404–413
Marouf M, Sorel Y (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 2010), pp 50–58
Martí R (2003) Multi-start methods. Handbook of metaheuristics, pp 355–368
Meumeu P, Sorel Y (2006) Non-schedulability conditions for off-line scheduling of real-time systems subject to precedence and strict periodicity constraints. In: Proceedings of 11th IEEE international conference on emerging technologies and factory automation (ETFA06)
Nash J (2005) Non-cooperative games. Ann Math 286–295
Roux W (1997) Une approche coherente pour la planification et l’ordonnacement de systèmes de production complexes. PhD thesis, Université Paul Sabatier, Toulouse, France
Sagaspe L, Bieber P (2007) Constraint-based design and allocation of shared avionics resources. In: 26th AIAA-IEEE digital avionics systems conference
Sharieh A, Al_Rawagepfeh W, Mahafzah M, Al Dahamsheh A (2008) An algorithm for finding maximum independent set in a graph. Eur J Sci Res 23(4):586–596
Spitzer C (2001) The avionics handbook. CRC Press, Boca Raton
Watkins C, Walter R (2007) Transitioning from federated avionics architectures to integrated modular avionics. In: Proceedings of the IEEE/AIAA 26th digital avionics systems conference (DASC’07)
Acknowledgements
The work presented in this paper was conducted under the research project SATRIMMAP (SAfety and Time Critical Middleware for future Modular Avionics Platforms) which is supported by the French National Agency for Research (ANR).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Al Sheikh, A., Brun, O., Hladik, PE. et al. Strictly periodic scheduling in IMA-based architectures. Real-Time Syst 48, 359–386 (2012). https://doi.org/10.1007/s11241-012-9148-y
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11241-012-9148-y