R. Allocation, I. Avionic, and . Systems, Original graph G. Green hashed nodes are Steiner points, in which node 1 is source

A. Figure, 1: A graph G and its complementary G

A. A. Sheikh, O. Brun, P. E. Hladik, and B. Prabhu, APPENDIX B List of publications Related to the thesis: ? Strictly periodic scheduling on an IMA-based avionic platform, 15th Austrian-French-German conference on Optimization (AFG'11), 2011.

A. A. Sheikh, O. Brun, and P. E. Hladik, ? Partition scheduling on an IMA platform with strict periodicity and communication delays, proceedings of the 18th International Conference on Real-Time and Network Systems, 2010.

O. Brun, A. Al, J. M. Sheikh, and . Garcia, Other, proceedings of the 21st International Teletraffic Congress (ITC'21), 2009.
DOI : 10.2307/25304386
URL : https://hal.archives-ouvertes.fr/hal-01419386

I. Ahmad, S. Ranka, and S. Khan, Using game theory for scheduling tasks on multi-core processors for simultaneous optimization of performance and energy, IEEE International Symposium on Parallel and Distributed Processing, pp.1-6, 2008.

R. Ahuja, T. Magnanti, J. Orlin, and K. Weihe, Network flows: theory, algorithms, and applications, 1993.

A. Sheikh, O. Brun, and P. Hladik, Decision support for task mapping on IMA architecture, Proceedings of the 3rd Junior Researcher Workshop on Real-Time Computing (JR- WRTC2009), pp.31-34, 2009.

A. Sheikh, O. Brun, and P. Hladik, Partition scheduling on an IMA platform with strict periodicity and communication delays, Proceedings of the 18th International Conference on Real-Time and Network Systems, pp.179-188, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00546945

A. Sheikh, O. Brun, and P. Hladik, Ordonnacement de tâches sous contrainte de périodicité stricte, Congrès Annuel de la Société Française de Recherche Opérationnelle et d'Aidè a la Décision, pp.55-56, 2011.

A. Sheikh, O. Brun, P. Hladik, and B. J. Prabhu, A Best-Response Algorithm for Multiprocessor Periodic Scheduling, 2011 23rd Euromicro Conference on Real-Time Systems, 2011.
DOI : 10.1109/ECRTS.2011.29

A. Sheikh, O. Brun, P. Hladik, and B. J. Prabhu, Strictly periodic scheduling on an IMAbased avionic platform, 15th Austrian-French-German conference on Optimization (AFG'11), 2011.

R. Alena, J. Ossenfort, K. Laws, A. Goforth, and F. Figueroa, Communications for Integrated Modular Avionics, 2007 IEEE Aerospace Conference, pp.1-18, 2007.
DOI : 10.1109/AERO.2007.352639

B. Andersson and J. Jonsson, Fixed-priority preemptive multiprocessor scheduling: to partition or not to partition, Proceedings Seventh International Conference on Real-Time Computing Systems and Applications, 2000.
DOI : 10.1109/RTCSA.2000.896409
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.118.8935

F. Authority, 178B, Software considerations in airborne systems and equipment certification, DO-178B/ED-12B, Radio Technical Commission for Aeronautics, 1992.

A. Avi?ienis, J. Laprie, B. Randell, and C. Landwehr, Basic concepts and taxonomy of dependable and secure computing, IEEE transactions on dependable and secure computing, pp.11-33, 2004.
DOI : 10.1109/TDSC.2004.2

H. Aydin and Q. Yang, Energy-aware partitioning for multiprocessor real-time systems, Proceedings International Parallel and Distributed Processing Symposium, 2003.
DOI : 10.1109/IPDPS.2003.1213225
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.128.119

K. Baker, Introduction to sequencing and scheduling, 1974.

T. Baker and A. Shaw, The cyclic executive model and Ada. Real-Time Systems, pp.7-25, 1989.

P. Baptiste and V. Timkovsky, Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time, Mathematical Methods of Operational Research, vol.60, issue.1, pp.145-153, 2004.
DOI : 10.1007/s001860300336
URL : https://hal.archives-ouvertes.fr/inria-00123801

C. Barnhart, E. Johnson, G. Nemhauser, M. Savelsbergh, and P. Vance, Branch-and-Price: Column Generation for Solving Huge Integer Programs, Operations Research, vol.46, issue.3, pp.316-329, 1998.
DOI : 10.1287/opre.46.3.316

S. Baruah, The non-preemptive scheduling of periodic tasks upon multiprocessors. Real-Time Systems, pp.9-20, 2006.

S. Baruah and S. Chakraborty, Schedulability analysis of non-preemptive recurring real-time tasks, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium, p.149, 2006.
DOI : 10.1109/IPDPS.2006.1639406

S. Baruah, N. Cohen, C. Plaxton, and D. Varvel, Proportionate progress, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing , STOC '93, pp.600-625, 1996.
DOI : 10.1145/167088.167194

J. Beasley, An algorithm for the steiner problem in graphs, Networks, vol.12, issue.1, pp.147-159, 1984.
DOI : 10.1002/net.3230140112

J. Benders, Partitioning procedures for solving mixed-variables programming problems, Numerische Mathematik, vol.38, issue.1, pp.238-252, 1962.
DOI : 10.1007/BF01386316

G. Bernat, A. Colin, and S. Petters, WCET analysis of probabilistic hard real-time systems, 23rd IEEE Real-Time Systems Symposium, 2002. RTSS 2002., pp.279-288, 2002.
DOI : 10.1109/REAL.2002.1181582

P. Bieber, J. Bodeveix, C. Castel, D. Doose, M. Filali et al., Constraintbased Design of Avionics Platform?Preliminary Design Exploration, 2008.

C. Boender and A. R. Kan, Bayesian stopping rules for multistart global optimization methods, Mathematical Programming, vol.21, issue.1981, pp.59-80, 1987.
DOI : 10.1007/BF02591684

R. Boute, The Euclidean definition of the functions div and mod, ACM Transactions on Programming Languages and Systems, vol.14, issue.2, p.144, 1992.
DOI : 10.1145/128861.128862

P. Brucker and S. Kravchenko, Complexity of mean flow time scheduling problems with release dates, 2004.

O. Brun and J. Garcia, Ressource allocation in communication networks, 5th IEEE International Conference on High Speed Networks and Multimedia Communication (Cat. No.02EX612), pp.229-233, 2002.
DOI : 10.1109/HSNMC.2002.1032581

A. M. Campbell and J. R. Hardin, Vehicle minimization for periodic deliveries, European Journal of Operational Research, vol.165, issue.3, pp.668-684, 2005.
DOI : 10.1016/j.ejor.2003.09.036

J. Carpenter, S. Funk, P. Holman, A. Srinivasan, J. Anderson et al., A categorization of real-time multiprocessor scheduling problems and algorithms, Handbook on Scheduling Algorithms, Methods, and Models, 2004.

R. Carraghan and P. Pardalos, An exact algorithm for the maximum clique problem, Operations Research Letters, vol.9, issue.6, pp.375-382, 1990.
DOI : 10.1016/0167-6377(90)90057-C

P. Chanet and V. Cassigneul, How to control the increase in the complexity of civil aircraft onboard systems. AGARD, Aerospace Software Engineering for Advanced Systems Architectures, 1993.

W. Chang-jun and X. Yu-geng, Modeling and analysis of single machine scheduling based on noncooperative game theory, Acta Automatica Sinica, 2005.

E. Clarke, Model checking, Foundations of Software Technology and Theoretical Computer Science, pp.54-56, 1997.

T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 2001.

F. Cottet, J. Delacroix, C. Kaiser, and Z. Mammeri, Ordonnancement temps réel: cours et exercices corrigés, Hermès science publications, 2000.

F. Cottet and Z. Mammeri, Scheduling in real-time systems, 2002.
DOI : 10.1002/0470856343
URL : https://hal.archives-ouvertes.fr/hal-01125110

G. Coulouris, J. Dollimore, and T. Kindberg, Distributed systems: concepts and design, 2005.

J. Crichigno and B. Barán, A multicast routing algorithm using multiobjective optimization. Telecommunications and Networking-ICT, pp.63-74, 2004.

F. Cristian, Understanding fault-tolerant distributed systems, Communications of the ACM, vol.34, issue.2, pp.56-78, 1993.
DOI : 10.1145/102792.102801

L. Cucu, Ordonnancement non préemptif et condition d'ordonnançabilité pour systèmes embarquésbarqués`barquésà contraintes temps réel, 2004.

K. Danne and M. Platzner, An EDF schedulability test for periodic tasks on reconfigurable hardware devices, Proceedings of the 2006 ACM SIGPLAN/SIGBED conference on Language, compilers, and tool support for embedded systems, p.102, 2006.

G. Dantzig and P. Wolfe, Decomposition Principle for Linear Programs, Operations Research, vol.8, issue.1, pp.101-111, 1960.
DOI : 10.1287/opre.8.1.101

T. Davidovic, L. Liberti, N. Maculan, and N. Mladenovic, Mathematical programming-based approach to scheduling of communicating tasks, 2004.

J. Decotignie, Ethernet-Based Real-Time and Industrial Communications, Proceedings of the IEEE, vol.93, issue.6, pp.1102-1117, 2005.
DOI : 10.1109/JPROC.2005.849721
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.383.7743

D. Decotigny, Une infrastructure de simulation modulaire pour l'´ evaluation de performances de systèmes temps-réel, 2003.

M. Degroot, Optimal statistical decisions, 2004.
DOI : 10.1002/0471729000

N. Deshpande and S. K. , Distributed Systems, 2009.

C. Dürr and K. Nguyen, Non-clairvoyant scheduling games. Algorithmic Game Theory, pp.135-146, 2009.

F. Eisenbrand, N. Hähnle, M. Niemeier, M. Skutella, J. Verschae et al., Scheduling Periodic Tasks in a Hard Real-Time Environment, Automata, Languages and Programming, pp.299-311, 2010.
DOI : 10.1007/978-3-642-14165-2_26

F. Eisenbrand, K. Kesavan, R. Mattikalli, M. Niemeier, A. Nordsieck et al., Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods, Algorithms?, pp.11-22, 2010.
DOI : 10.1007/978-3-642-15775-2_2

J. Elloy, Editorial: Quelle informatique est donc nécessaire pour automatiser en temps réel, Technique et Sciences Informatique, vol.7, issue.5, pp.395-396, 1988.

M. Felser, Real-Time Ethernet - Industry Prospective, Proceedings of the IEEE, pp.1118-1129, 2005.
DOI : 10.1109/JPROC.2005.849720

]. T. Ferguson, Linear programming: A concise introduction. Website, 2011.

N. Fisher and S. Baruah, The feasibility of general task systems with precedence constraints on multiprocessor platforms. Real-Time Systems, pp.1-26, 2009.

C. Fraboul and F. Martin, Modeling advanced modular avionics architectures for early real-time performance analysis, Proceedings of the Seventh Euromicro Workshop on Parallel and Distributed Processing. PDP'99, pp.181-188, 1999.
DOI : 10.1109/EMPDP.1999.746662

D. Fudenberg and J. Tirole, Game Theory, 1991.

J. Garcia, A. Rachdi, and O. Brun, Optimal LSP Placement with QoS Constraints in Diff- Serv/MPLS Networks, Providing Quality of Service in Heterogeneous Environments, issue.11, 2003.

M. Garey and D. Johnson, Complexity Results for Multiprocessor Scheduling under Resource Constraints, SIAM Journal on Computing, vol.4, issue.4, p.397, 1975.
DOI : 10.1137/0204035

M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NPcompleteness, 1979.

F. Gärtner, Fundamentals of fault-tolerant distributed computing in asynchronous environments, ACM Computing Surveys, vol.31, issue.1, pp.1-26, 1999.
DOI : 10.1145/311531.311532

L. George, P. Muhlethaler, and N. Rivierre, Optimality and non-preemptive real-time scheduling revisited, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00074162

E. Gilbert and H. Pollak, Steiner Minimal Trees, SIAM Journal on Applied Mathematics, vol.16, issue.1, pp.1-29, 1968.
DOI : 10.1137/0116001

R. Gomory, Outline of an algorithm for integer solutions to linear programs, Bulletin of the American Mathematical Society, vol.64, issue.5, pp.275-278, 1958.
DOI : 10.1090/S0002-9904-1958-10224-4

J. Goossens, Scheduling of hard real-time periodic systems with various kinds of deadline and offset constraints, 1999.

J. Goossens, S. Funk, and S. Baruah, Priority-driven scheduling of periodic task systems on multiprocessors. Real-Time Systems, pp.187-205, 2003.

J. Goossens and C. Macq, Limitation of the hyper-period in real-time periodic task set generation, Proceedings of the RTS Embedded System (RTS'01), pp.133-148, 2001.

N. Guan, Z. Gu, Q. Deng, S. Gao, and G. Yu, Exact Schedulability Analysis for Static-Priority Global Multiprocessor Scheduling Using Model-Checking, Proceedings of the 5th IFIP WG 10.2 international conference on Software technologies for embedded and ubiquitous systems, pp.263-272, 2007.
DOI : 10.1109/TC.2003.1214344

M. Harbour, J. García, J. Gutiérrez, and J. Moyano, Mast: Modeling and analysis suite for real time applications, 13th Euromicro Conference on Real-Time Systems, pp.125-134, 2001.

K. Hoffman and M. Padberg, Lp-based combinatorial problem solving, Annals of Operations Research, vol.8, issue.1, pp.145-194, 1985.
DOI : 10.1007/BF02022040

P. Holman, On the implementation of Pfair-scheduled multiprocessor systems, 2004.

J. Huysseune, P. Palmer, and . Nevada-pamela-victoria, Towards the definition of new aircraft electronic systems, Air & Space Europe, vol.3, pp.3-4180, 2001.

F. Hwang and D. Richards, Steiner tree problems, Networks, vol.20, issue.1, pp.55-89, 1992.
DOI : 10.1002/net.3230220105

J. Hyman, A. Lazar, and G. Pacifici, Real-time scheduling with quality of service constraints, IEEE Journal on Selected Areas in Communications, vol.9, issue.7, pp.1052-1063, 1991.
DOI : 10.1109/49.103552

P. Jalote, Fault-Tolerance in Distributed Systems, 1994.

G. Jones and J. Jones, Elementary number theory, 1998.
DOI : 10.1007/978-1-4471-0613-5

M. Joseph and P. Pandya, Finding Response Times in a Real-Time System, The Computer Journal, vol.29, issue.5, p.390, 1986.
DOI : 10.1093/comjnl/29.5.390

L. Kantorovich, Mathematical Methods of Organizing and Planning Production, Management Science, vol.6, issue.4, pp.366-422, 1960.
DOI : 10.1287/mnsc.6.4.366

O. Kermia, 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.

O. Kermia and Y. Sorel, A rapid heuristic for scheduling non-preemptive dependent periodic tasks onto multiprocessor, Proceedings of ISCA 20th international conference on Parallel and Distributed Computing Systems, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00413486

L. Kleinrock, Queueing systems, volume I: theory, 1975.

R. Kocik, Sur l'optimisation des systèmes distribués temps réel embarqués: application au prototypage rapide d'un véhiculé electrique semi-autonome, 2000.

J. Korst, Periodic multiprocessor scheduling, 1992.
DOI : 10.1007/bfb0035103
URL : http://repository.tue.nl/346857

J. Korst, E. Aarts, J. Lenstra, and . Karel, Scheduling Periodic Tasks, INFORMS Journal on Computing, vol.8, issue.4, pp.428-435, 1996.
DOI : 10.1287/ijoc.8.4.428

J. Korst, E. Aarts, and J. K. Lenstra, Scheduling Periodic Tasks with Slack, INFORMS Journal on Computing, vol.9, issue.4, pp.351-362, 1997.
DOI : 10.1287/ijoc.9.4.351

L. Kou, G. Markowsky, and L. Berman, A fast algorithm for Steiner trees, Acta Informatica, vol.30, issue.2, pp.141-145, 1981.
DOI : 10.1007/BF00288961

E. Koutsoupias and C. Papadimitriou, Worst-case equilibria, Proceedings of the 16th annual conference on Theoretical Aspects of Computer Science, pp.404-413, 1999.
DOI : 10.1007/3-540-49116-3_38

Y. Kwok and I. Ahmad, Static scheduling algorithms for allocating directed task graphs to multiprocessors, ACM Computing Surveys, vol.31, issue.4, pp.406-471, 1999.
DOI : 10.1145/344588.344618

A. Land and A. Doig, An automatic method for solving discrete programming problems. 50 Years of Integer Programming, pp.105-132, 1958.
DOI : 10.1007/978-3-540-68279-0_5
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.308.7332

J. Laprie, Sûreté de fonctionnement informatique: concepts de base et terminologie, LAAS-CNRS, 2004.

M. Lauer, J. Ermont, F. Boniol, and C. Pagetti, Latency and freshness analysis on IMA systems, ETFA2011, 2011.
DOI : 10.1109/ETFA.2011.6059017

M. Lauer, J. Ermont, C. Pagetti, and F. Boniol, Analyzing End-to-End Functional Delays on an IMA Platform, Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation -Volume Part I, ISoLA'10, pp.243-257, 2010.
DOI : 10.1007/s100090050010

E. Lawler, Sequencing jobs to minimize total weighted completion time subject to precedence constraints Algorithmic aspects of combinatorics, pp.75-90, 1978.

E. Lee, MIL-STD-1553 Tutorial, CONDOR Engineering, 2000.

J. Leung and M. Merrill, A note on preemptive scheduling of periodic, real-time tasks, Information Processing Letters, vol.11, issue.3, pp.115-118, 1980.
DOI : 10.1016/0020-0190(80)90123-4

J. Leung and J. Whitehead, On the complexity of fixed-priority scheduling of periodic, real-time tasks, Performance Evaluation, vol.2, issue.4, pp.237-250, 1982.
DOI : 10.1016/0166-5316(82)90024-4

L. Liberti, Automatic reformulation of bilinear MINLPs, 2004.

L. Liberti and M. Drazic, Variable neighbourhood search for the global optimization of constrained NLPs, Proceedings of Global Optimization, pp.1-5, 2005.

C. Lin and C. Liao, Makespan minimization for multiple uniform machines, Computers & Industrial Engineering, vol.54, issue.4, pp.983-992, 2008.
DOI : 10.1016/j.cie.2007.11.009

C. Liu, Scheduling algorithms for multiprocessors in a hard real-time environment. JPL Space Programs Summary 37-60, pp.28-37, 1969.

C. Liu and J. Layland, Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment, Journal of the ACM, vol.20, issue.1, pp.46-61, 1973.
DOI : 10.1145/321738.321743

J. Lopez, J. Diaz, and D. Garcia, Minimum and maximum utilization bounds for multiprocessor RM scheduling, Proceedings 13th Euromicro Conference on Real-Time Systems, p.67, 2001.
DOI : 10.1109/EMRTS.2001.934003
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.109.8193

J. Lopez, M. Garcia, J. Diaz, and D. Garcia, Worst-case utilization bound for EDF scheduling on real-time multiprocessor systems, Proceedings 12th Euromicro Conference on Real-Time Systems. Euromicro RTS 2000, p.25, 2000.
DOI : 10.1109/EMRTS.2000.853989

T. Magnanti and R. Vachani, A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs, Operations Research, vol.38, issue.3, pp.456-473, 1990.
DOI : 10.1287/opre.38.3.456

M. Marouf and Y. Sorel, Schedulability conditions for non-preemptive hard real-time tasks with strict period, Proceedings of the 18th International Conference on Real-Time and Network Systems, pp.50-58, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00566359

R. Martí, Multi-start methods. Handbook of metaheuristics, pp.355-368, 2003.

P. Meumeu and Y. Sorel, Non-schedulability conditions for off-line scheduling of real-time systems subject to precedence and strict periodicity constraints, Proceedings of 11th IEEE International Conference on Emerging technologies and Factory Automation (ETFA06), 2006.

A. Mok and M. Dertouzos, Multiprocessor scheduling in a hard real-time environment, Proceedings of the Seventh Texas Conference on Computing Systems, 1978.

A. K. Mok, Fundamental design problems of distributed systems for the hard-real-time environment, 1983.

R. Myerson, Game theory: analysis of conflict, 1997.

J. Nash, Non-cooperative games, Annals of mathematics, pp.286-295, 1951.
DOI : 10.2307/1969529

L. Nastansky, S. Selkow, and N. Stewart, Cost-minimal trees in directed acyclic graphs, Zeitschrift f??r Operations Research, vol.4, issue.No. 2, pp.59-67, 1974.
DOI : 10.1007/BF01949715

M. Osborne and A. Rubinstein, A course in game theory, 1994.

P. Ostergard, A fast algorithm for the maximum clique problem, Discrete Applied Mathematics, vol.120, issue.1-3, pp.197-207, 2002.
DOI : 10.1016/S0166-218X(01)00290-6

M. Padberg and G. Rinaldi, A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems, SIAM Review, vol.33, issue.1, pp.60-100, 1991.
DOI : 10.1137/1033004

S. Pallier, Analyse hors ligne d'ordonnanç abilit´cabilit´c d'applications temps réel comportant des tâches conditionnelles et sporadiques, 2006.

M. Pióro and D. Medhi, Routing, flow, and capacity design in communication and computer networks, 2004.

D. Powell, Failure mode assumption and assumption coverage, International Symposium on Fault-Tolerant Computing (FTCS-22), pp.386-395, 1992.
DOI : 10.1007/978-3-642-79789-7_8
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.56.5363

R. Pressman, Software engineering: a practitioner's approach, 1992.

W. Roux, Une approche coherente pour la planification et l'ordonnacement de systèmes de production complexes, 1997.

J. Rushby, Critical system properties: Survey and taxonomy. Reliability Engineering and Systems Safety, pp.189-219, 1994.

L. Sagaspe and P. Bieber, Constraint-based design and allocation of shared avionics resources, 2007 IEEE/AIAA 26th Digital Avionics Systems Conference, 2007.
DOI : 10.1109/DASC.2007.4391846

M. Savelsbergh, A Branch-and-Price Algorithm for the Generalized Assignment Problem, Operations Research, vol.45, issue.6, pp.831-841, 1997.
DOI : 10.1287/opre.45.6.831

Y. Seok, Y. Lee, Y. Choi, and C. Kim, Explicit multicast routing algorithms for constrained traffic engineering, IEEE 7th International Symposium on Computer and Communications, 2002.

M. Serrano and H. Boehm, Understanding memory allocation of scheme programs, Proceedings of the fifth ACM SIGPLAN international conference on Functional programming, pp.245-256, 2000.

A. Sharieh, W. Rawagepfeh, M. Mahafzah, and A. Dahamsheh, An Algorithm for Finding Maximum Independent Set in a Graph, European Journal of Scientific Research, vol.23, issue.4, pp.586-596, 2008.

F. Singhoff, J. Legrand, L. Nana, and L. Marcé, Cheddar: a flexible real time scheduling framework, Proceedings of the 2004 annual ACM SIGAda international conference on Ada, pp.1-8, 2004.

R. Sitters, Two np-hardness results for preemptive minsum scheduling of unrelated parallel machines. Integer Programming and Combinatorial Optimization, pp.396-405, 2001.

C. Spitzer, Digital avionics systems, 1993.

C. Spitzer, The avionics handbook, 2001.

B. Sprunt, L. Sha, and J. Lehoczky, Aperiodic task scheduling for Hard-Real-Time systems, Real-time Systems, vol.20, issue.1, pp.27-60, 1989.
DOI : 10.1007/BF02341920

J. Stankovic and K. Ramamritham, What is predictability for real-time systems? Real-Time Systems, pp.247-254, 1990.

J. Stankovic, M. Spuri, M. D. Natale, and G. Buttazzo, Implications of classical scheduling results for real-time systems, Computer, vol.28, issue.6, pp.16-25, 1995.
DOI : 10.1109/2.386982

A. Tanenbaum, Computer Networks, 2003.

S. Thanikesavan and U. Killat, Global scheduling of periodic tasks in a decentralized real-time control system, IEEE International Workshop on Factory Communication Systems, 2004. Proceedings., pp.307-310, 2004.
DOI : 10.1109/WFCS.2004.1377733

S. Thanikesavan and U. Killat, Static Scheduling of Periodic Tasks in a Decentralized Real-time Control System Using an ILP, 11th International Conference on Parallel and Distributed Systems (ICPADS'05), p.639, 2005.
DOI : 10.1109/ICPADS.2005.268

S. Thanikesavan and U. Killat, A satisficing momip framework for reliable real-time application scheduling, Proceedings of the 2nd IEEE International Symposium on Dependable, Autonomic and Secure Computing (DASC '06), pp.187-194, 2006.

J. Ullman, NP-complete scheduling problems, Journal of Computer and System Sciences, vol.10, issue.3, pp.384-393, 1975.
DOI : 10.1016/S0022-0000(75)80008-0
URL : http://doi.org/10.1016/s0022-0000(75)80008-0

C. Watkins and R. Walter, Transitioning from federated avionics architectures to Integrated Modular Avionics, 2007 IEEE/AIAA 26th Digital Avionics Systems Conference, 2007.
DOI : 10.1109/DASC.2007.4391842

G. Woeginger, Exact Algorithms for NP-Hard Problems: A Survey, Combinatorial Optimization- Eureka, pp.185-207, 2003.
DOI : 10.1007/3-540-36478-1_17

J. Zhu, T. Lewis, W. Jackson, and R. Wilson, Scheduling in hard real-time applications, IEEE Software, vol.12, issue.3, pp.54-63, 1995.

E. Zitzler and L. Thiele, Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach, IEEE Transactions on Evolutionary Computation, vol.3, issue.4, pp.257-271, 1999.
DOI : 10.1109/4235.797969