Resource allocation in hard real-time avionic systems. Scheduling and routing problems

Le domaine avionique a ete transforme par l'apparition des architectures modulaires integrees (IMA). Celles-ci definissent un support d'execution et de communication standard et mutualise afin de reduire la complexite de l'architecture physique. Cependant, du fait du partage des ressources, cette demarche introduit une plus grande complexite lors de la conception et de l'integration des applications ce qui implique d'assister les concepteurs avec des outils dedies. La presente these contribue a cet effort en se focalisant sur deux problemes d'allocation de ressources : i) le probleme de l'ordonnancement multiprocesseur de tâches strictement periodiques et ii) le probleme du routage des messages echanges entre les fonctions avioniques. Le premier probleme a ete formalise sous la forme d'un programme lineaire en nombres entiers afin de garantir un potentiel maximum d'evolution sur les durees d'executions des traitements. L'inefficacite d'une approche exacte pour des instances de grande taille, nous a conduit a developper une heuristique originale s'inspirant de la theorie des jeux couplee avec un algorithme multi-start. Le routage est formalise sous la forme d'un probleme d'optimisation sur la charge maximum des liens. Deux propositions sont faites pour le resoudre, l'une, exacte, est basee sur une formulation nœud-lien, et la seconde est une heuristique a deux niveaux base sur une formulation lien-chemin. Mots-Cles en francais : ordonnancement temps-reel, optimisation, systemes avioniques, architectures modulaires integrees, tâches strictement periodique, theorie de jeux, routage des liens virtuels

[1]  Sanjoy K. Baruah,et al.  Priority-Driven Scheduling of Periodic Task Systems on Multiprocessors , 2003, Real-Time Systems.

[2]  Ulrich Killat,et al.  A Satisficing MOMIP Framework for Reliable Real-time Application Scheduling , 2006, 2006 2nd IEEE International Symposium on Dependable, Autonomic and Secure Computing.

[3]  Christos H. Papadimitriou,et al.  Worst-case Equilibria , 1999, STACS.

[4]  Alexander H. G. Rinnooy Kan,et al.  Bayesian stopping rules for multistart global optimization methods , 1987, Math. Program..

[5]  Rafael Martí.  Multi-Start Methods , 2003, Handbook of Metaheuristics.

[6]  Sape Mullender,et al.  Distributed systems , 1989 .

[7]  J. Leung,et al.  A Note on Preemptive Scheduling of Periodic, Real-Time Tasks , 1980, Inf. Process. Lett..

[8]  Leo Liberti,et al.  Variable Neighbourhood Search for the Global Optimization of Constrained NLPs , 2006 .

[9]  Ted G. Lewis,et al.  Scheduling in Hard Real-Time Applications , 1995, IEEE Softw..

[10]  Wa Halang,et al.  REAL-TIME SYSTEMS .1. , 1990 .

[11]  Cary R Spitzer,et al.  The avionics handbook , 2001 .

[12]  Y.-K. Kwok,et al.  Static scheduling algorithms for allocating directed task graphs to multiprocessors , 1999, CSUR.

[13]  Aloysius Ka-Lau Mok,et al.  Fundamental design problems of distributed systems for the hard-real-time environment , 1983 .

[14]  Max Felser,et al.  Real-Time Ethernet - Industry Prospective , 2005, Proceedings of the IEEE.

[15]  Laurent Nana,et al.  Cheddar: a flexible real time scheduling framework , 2004, SIGAda.

[16]  Nenad Mladenović,et al.  Mathematical Programming-Based Approach to Scheduling of Communicating Tasks , 2004 .

[17]  Ge Yu,et al.  Exact Schedulability Analysis for Static-Priority Global Multiprocessor Scheduling Using Model-Checking , 2007, SEUS.

[18]  Gerhard J. Woeginger,et al.  Exact Algorithms for NP-Hard Problems: A Survey , 2001, Combinatorial Optimization.

[19]  Paul Muhlethaler,et al.  Optimality and non-preemptive real-time scheduling revisited , 1995 .

[20]  Ralph E. Gomory,et al.  Outline of an Algorithm for Integer Solutions to Linear Programs and An Algorithm for the Mixed Integer Problem , 2010, 50 Years of Integer Programming.

[21]  K. Chao,et al.  Steiner Minimal Trees , 2005 .

[22]  A. Fleischmann.  Distributed Systems , 1994, Springer Berlin Heidelberg.

[23]  James W. Layland,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[24]  David Decotigny.  Une infrastructure de simulation modulaire pour l'évaluation de performances de systèmes temps-réel , 2003 .

[25]  Sven Danø.  Duality in Linear Programming , 1960 .

[26]  Stephan Merz,et al.  Model Checking , 2000 .

[27]  R.L. Alena,et al.  Communications for Integrated Modular Avionics , 2007, 2007 IEEE Aerospace Conference.

[28]  Patrick Meumeu Yomsi,et al.  Non-Schedulability Conditions for Off-line Scheduling of Real-Time Systems Subject to Precedence and Strict Periodicity Constraints , 2006, 2006 IEEE Conference on Emerging Technologies and Factory Automation.

[29]  David S. Johnson,et al.  Complexity Results for Multiprocessor Scheduling under Resource Constraints , 1975, SIAM J. Comput..

[30]  Hoyt Lougee,et al.  SOFTWARE CONSIDERATIONS IN AIRBORNE SYSTEMS AND EQUIPMENT CERTIFICATION , 2001 .

[31]  Gary D. Knott,et al.  Duality in Linear Programming , 2013 .

[32]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[33]  Zoubir Mammeri,et al.  Scheduling in Real-Time Systems , 2002 .

[34]  George B. Dantzig,et al.  Decomposition Principle for Linear Programs , 1960 .

[35]  Yves Sorel,et al.  A rapid heuristic for scheduling non-preemptive dependent periodic tasks onto multiprocessor , 2007, ISCA PDCS.

[36]  RamamrithamKrithi,et al.  What is predictability for real-time systems? , 1990 .

[37]  Martin W. P. Savelsbergh,et al.  Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..

[38]  Jan Karel Lenstra,et al.  Periodic Multiprocessor Scheduling , 1991, PARLE.

[39]  Jan Karel Lenstra,et al.  Scheduling Periodic Tasks , 1996, INFORMS J. Comput..

[40]  Jill R. Hardin,et al.  Vehicle minimization for periodic deliveries , 2005, Eur. J. Oper. Res..

[41]  Daniel F. García,et al.  Minimum and maximum utilization bounds for multiprocessor RM scheduling , 2001, Proceedings 13th Euromicro Conference on Real-Time Systems.

[42]  Marco Platzner,et al.  An EDF schedulability test for periodic tasks on reconfigurable hardware devices , 2006, LCTES '06.

[43]  Olivier Brun,et al.  Optimal LSP placement with QoS constraints in DiffServ/MPLS networks , 2003 .

[44]  Omar Kermia,et al.  Ordonnancement temps réel multiprocesseur de tâches non-préemptives avec contraintes de précédence, de périodicité stricte et de latence , 2009 .

[45]  R. Lehnert,et al.  Providing Quality of Service in Heterogeneous Environments , 2003 .

[46]  Deep Medhi,et al.  Routing, flow, and capacity design in communication and computer networks , 2004 .

[47]  Stéphane Pailler.  Analyse hors ligne d'ordonnançabilité d'applications temps réels comportant des tâches conditionnelles et sporadiques , 2006 .

[48]  David Powell,et al.  Failure mode assumptions and assumption coverage , 1992, [1992] Digest of Papers. FTCS-22: The Twenty-Second International Symposium on Fault-Tolerant Computing.

[49]  Felix C. Freiling,et al.  Fundamentals of Fault-Tolerant Distributed Computing in Asynchronous Environments , 1999, ACM Comput. Surv..

[50]  Yves Sorel,et al.  Schedulability conditions for non-preemptive hard real-time tasks with strict period , 2010 .

[51]  M. Degroot.  Optimal Statistical Decisions , 1970 .

[52]  David Powell.  Failure mode assumptions and assumption coverage , 1992 .

[53]  Sanjoy K. Baruah,et al.  Proportionate progress: a notion of fairness in resource allocation , 1993, STOC '93.

[54]  Qi Yang,et al.  Energy-aware partitioning for multiprocessor real-time systems , 2003, Proceedings International Parallel and Distributed Processing Symposium.

[55]  Daniel F. García,et al.  Worst-case utilization bound for EDF scheduling on real-time multiprocessor systems , 2000, Proceedings 12th Euromicro Conference on Real-Time Systems. Euromicro RTS 2000.

[56]  Constraint Solving , 2022 .

[57]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[58]  P. Pardalos,et al.  An exact algorithm for the maximum clique problem , 1990 .

[59]  Jorge Crichigno,et al.  A Multicast Routing Algorithm Using Multiobjective Optimization , 2004, ICT.

[60]  Patric R. J. Östergård,et al.  A fast algorithm for the maximum clique problem , 2002, Discret. Appl. Math..

[61]  David Burton.  Elementary Number Theory , 1976 .

[62]  Martin Skutella,et al.  Scheduling Periodic Tasks in a Hard Real-Time Environment , 2010, ICALP.

[63]  Martin Skutella,et al.  Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods , 2010, ESA.

[64]  Dana S. Richards,et al.  Steiner tree problems , 1992, Networks.

[65]  Pankaj Jalote,et al.  Fault tolerance in distributed systems , 1994 .

[66]  John E. Beasley.  An algorithm for the steiner problem in graphs , 1984, Networks.

[67]  Underwood Dudley.  Elementary Number Theory , 1978 .

[68]  Gerd Keiser,et al.  Local Area Networks , 1989 .

[69]  Sanjoy K. Baruah,et al.  Schedulability analysis of non-preemptive recurring real-time tasks , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[70]  M. Dufwenberg.  Game theory. , 2011, Wiley interdisciplinary reviews. Cognitive science.

[71]  J. Javier Gutiérrez,et al.  MAST: Modeling and Analysis Suite for Real Time Applications , 2001, ECRTS.

[72]  Jérôme Ermont,et al.  Analyzing End-to-End Functional Delays on an IMA Platform , 2010, ISoLA.

[73]  John Rushby,et al.  Critical system properties: survey and taxonomy , 1994 .

[74]  Carl E. Landwehr,et al.  Basic concepts and taxonomy of dependable and secure computing , 2004, IEEE Transactions on Dependable and Secure Computing.

[75]  Balakrishna J. Prabhu,et al.  A Best-Response Algorithm for Multiprocessor Periodic Scheduling , 2011, 2011 23rd Euromicro Conference on Real-Time Systems.

[76]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[77]  E. Lawler.  Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints , 1978 .

[78]  James H. Anderson,et al.  On the implementation of pfair-scheduled multiprocessor systems , 2004 .

[79]  Ulrich Killat,et al.  Static scheduling of periodic tasks in a decentralized real-time control system using an ILP , 2005, 11th International Conference on Parallel and Distributed Systems (ICPADS'05).

[80]  Giovanni Rinaldi,et al.  A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems , 1991, SIAM Rev..

[81]  Joël Goossens,et al.  Limitation of the hyper-period in real-time periodic task set generation , 2001 .

[82]  Michael C. Mulder,et al.  Local Area Networks , 1984, Computer.

[83]  Sanjay Ranka,et al.  Using game theory for scheduling tasks on multi-core processors for simultaneous optimization of performance and energy , 2008, 2008 IEEE International Symposium on Parallel and Distributed Processing.

[84]  René Sitters.  Two NP-Hardness Results for Preemptive Minsum Scheduling of Unrelated Parallel Machines , 2001, IPCO.

[85]  Roger S. Pressman,et al.  Software Engineering: A Practitioner's Approach , 1982 .

[86]  Jan Korst,et al.  Scheduling Periodic Tasks with Slack , 1997, INFORMS J. Comput..

[87]  Mathai Joseph,et al.  Finding Response Times in a Real-Time System , 1986, Comput. J..

[88]  George Coulouris,et al.  Distributed systems - concepts and design , 1988 .

[89]  Marco Spuri,et al.  Implications of Classical Scheduling Results for Real-Time Systems , 1995, Computer.

[90]  Björn Andersson,et al.  Fixed-priority preemptive multiprocessor scheduling: to partition or not to partition , 2000, Proceedings Seventh International Conference on Real-Time Computing Systems and Applications.

[91]  Sanjoy K. Baruah,et al.  A Categorization of Real-Time Multiprocessor Scheduling Problems and Algorithms , 2004, Handbook of Scheduling.

[92]  Sanjoy K. Baruah,et al.  The feasibility of general task systems with precedence constraints on multiprocessor platforms , 2008, Real-Time Systems.

[93]  Johanne Cohen,et al.  Non-clairvoyant Scheduling Games , 2011, Theory of Computing Systems.

[94]  Marek Chrobak,et al.  The complexity of mean flow time scheduling problems with release times , 2006, J. Sched..

[95]  Olivier Brun,et al.  Flow-level modelling of TCP traffic using GPS queueing networks , 2009, 2009 21st International Teletraffic Congress.

[96]  Olivier Brun,et al.  Partition Scheduling on an IMA Platform with Strict Periodicity and Communication Delays , 2010 .

[97]  Ariel Rubinstein,et al.  A Course in Game Theory , 1995 .

[98]  Joseph Huysseune,et al.  NEVADA-PAMELA-VICTORIA: Towards the definition of new aircraft electronic systems , 2001 .

[99]  Thomas L. Magnanti,et al.  A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs , 1990, Oper. Res..

[100]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[101]  Jacques F. Benders,et al.  Partitioning procedures for solving mixed-variables programming problems , 2005, Comput. Manag. Sci..

[102]  Cary R. Spitzer.  Digital Avionics Systems , 1987 .

[103]  M. Padberg,et al.  Lp-based combinatorial problem solving , 1985 .

[104]  Sanjoy K. Baruah,et al.  The Non-preemptive Scheduling of Periodic Tasks upon Multiprocessors , 2006, Real-Time Systems.

[105]  Hans-Juergen Boehm,et al.  Understanding memory allocation of scheme programs , 2000, ICFP '00.

[106]  Jeffrey D. Ullman,et al.  NP-Complete Scheduling Problems , 1975, J. Comput. Syst. Sci..

[107]  Aurel A. Lazar,et al.  Real-Time Scheduling with Quality of Service Constraints , 1991, IEEE J. Sel. Areas Commun..

[108]  Theodore P. Baker,et al.  The cyclic executive model and Ada , 2006, Real-Time Systems.

[109]  Chien-Hung Lin,et al.  Makespan minimization for multiple uniform machines , 2008, Comput. Ind. Eng..

[110]  Liliana Cucu,et al.  Ordonnancement non préemptif et condition d'ordonnançabilité pour systèmes embarqués à contraintes temps réel , 2004 .

[111]  Yanghee Choi,et al.  Explicit multicast routing algorithms for constrained traffic engineering , 2002, Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications.

[112]  L. Sagaspe,et al.  Constraint-based design and allocation of shared avionics resources , 2007, 2007 IEEE/AIAA 26th Digital Avionics Systems Conference.

[113]  Raymond T. Boute,et al.  The Euclidean definition of the functions div and mod , 1992, TOPL.

[114]  Flaviu Cristian,et al.  Understanding fault-tolerant distributed systems , 1991, CACM.

[115]  Roger B. Myerson,et al.  Game theory - Analysis of Conflict , 1991 .

[116]  Christian Fraboul,et al.  Modeling advanced modular avionics architectures for early real-time performance analysis , 1999, Proceedings of the Seventh Euromicro Workshop on Parallel and Distributed Processing. PDP'99.

[117]  Ailsa H. Land,et al.  An Automatic Method of Solving Discrete Programming Problems , 1960 .

[118]  Lui Sha,et al.  Aperiodic task scheduling for Hard-Real-Time systems , 2006, Real-Time Systems.

[119]  L. V. Kantorovich,et al.  Mathematical Methods of Organizing and Planning Production , 1960 .

[120]  George Markowsky,et al.  A fast algorithm for Steiner trees , 1981, Acta Informatica.

[121]  Joseph Y.-T. Leung,et al.  On the complexity of fixed-priority scheduling of periodic, real-time tasks , 1982, Perform. Evaluation.

[122]  Eric van Damme,et al.  Non-Cooperative Games , 2000 .

[123]  WANGChang-Jun,et al.  Modeling and Analysis of Single Machine Scheduling Based on Noncooperative Game Theory , 2005 .

[124]  U. Killat,et al.  Global scheduling of periodic tasks in a decentralized real-time control system , 2004, IEEE International Workshop on Factory Communication Systems, 2004. Proceedings..

[125]  Giuseppe Di Battista,et al.  26 Computer Networks , 2004 .

[126]  Lothar Thiele,et al.  Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach , 1999, IEEE Trans. Evol. Comput..

[127]  Guillem Bernat,et al.  WCET analysis of probabilistic hard real-time systems , 2002, 23rd IEEE Real-Time Systems Symposium, 2002. RTSS 2002..

[128]  Olivier Brun,et al.  Ressource allocation in communication networks , 2002, 5th IEEE International Conference on High Speed Networks and Multimedia Communication (Cat. No.02EX612).

[129]  Leonard Kleinrock,et al.  Queueing Systems: Volume I-Theory , 1975 .

[130]  Ludwig Nastansky,et al.  Cost-minimal trees in directed acyclic graphs , 1974, Z. Oper. Research.

[131]  Jean-Dominique Decotignie,et al.  Ethernet-Based Real-Time and Industrial Communications , 2005, Proceedings of the IEEE.

[132]  Jérôme Ermont,et al.  Latency and freshness analysis on IMA systems , 2011, ETFA2011.

[133]  C.B. Watkins,et al.  Transitioning from federated avionics architectures to Integrated Modular Avionics , 2007, 2007 IEEE/AIAA 26th Digital Avionics Systems Conference.

[134]  Erik.  Scheduling of Hard Real-Time Periodic Systems with Various Kinds of Deadline and Offset Constraints , .

[135]  Philippe Baptiste,et al.  Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time , 2004, Math. Methods Oper. Res..

[136]  Martin W. P. Savelsbergh,et al.  A Branch-and-Price Algorithm for the Generalized Assignment Problem , 1997, Oper. Res..