, For GENSCHEDMULTIPROC, when the number of tasks is set to 20 (Fig. 8.1e) the results are similar to what we observed for G-ALAP-EDF: the results are quite similar between four (Fig. 8.1a) and eight (Fig. 8.1e) cores. Nonetheless, when the number of tasks and cores increases (Fig. 8.2c) there is a more significant difference specially when the utilization of the system is low (below 50%). We can also observe the fact that GENSCHED-MULTIPROC outperforms G-ALAP-EDF when the utilization of the system is higher than 60%, seen when the architecture has only four cores (Fig. 8.1b) but it occurs at a later point in Fig. 8.1f, i.e. when the utilization is over 40%

, ? The density becomes greater (from 20% to 40%) in the graph of Fig, vol.8, p.3

G. , This increment is caused by tasks with an increased timing budget which causes them to be executed for a longer period of time and therefore the chances to be preempted increase as well. This type of behavior can be seen for the set of plots presented in Fig. 8.3. An important result we want to insist on is the number of preemptions that G-ALAP-HYB produces compared to G-ALAP-LLF. The purpose of a hybrid algorithm combining G-EDF for the HI-criticality mode and G-LLF for the LO-criticality mode was to limit the number of preemptions that can be generated while the algorithm computes the HIcriticality scheduling table. The results of Fig. 8.3 show that we were in fact capable of limiting the number of preemptions thanks to G-ALAP-HYB. At the same time, while G-ALAP-LLF and G-ALAP-HYB generate more preemptions they tend to use less cores to find feasible schedules since clusters are not necessary for the scheduling of the system. G-ALAP-EDF vs. Federated approach: When comparing the results in terms of number of preemptions between G-ALAP-EDF and FEDMCDAG, the results are more sparse and different conclusions can be established. When we look into the results presented Fig. 8.3a, Fig. 8.3c and Fig. 8.3e, we have the same behavior for both heuristics: at the beginning FEDMCDAG generates more preemptions but as utilization increases, G-ALAP-EDF takes the upper hand and entails more preemptions compared to FEDMCDAG. Nevertheless, we can see that while G-ALAP-EDF tends to generate more preemptions, Like it was expected, solutions based on the G-LLF scheduler entail more preemptions: between 0.4 to 4 preemptions per job for G-ALAP-LLF and between 0.3 to 1 for

R. Medina, E. Borde, and L. Pautet, Availability analysis for synchronous data-flow graphs in mixed-criticality systems, 11th IEEE Symposium on Industrial Embedded Systems (SIES), pp.1-6, 2016.

R. Medina, E. Borde, and L. Pautet, Directed acyclic graph scheduling for mixed-criticality systems, Ada-Europe International Conference on Reliable Software Technologies, pp.217-232, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01995010

R. Medina, E. Borde, and L. Pautet, Availability enhancement and analysis for mixed-criticality systems on multi-core, Design, Automation & Test in Europe Conference & Exhibition (DATE), pp.1271-1276, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01994643

R. Medina, E. Borde, and L. Pautet, Scheduling multiperiodic mixed criticality dags on multi-core architectures, 2018 IEEE Real-Time Systems Symposium (RTSS), 2018.
URL : https://hal.archives-ouvertes.fr/hal-01994627

N. R. Storey, Safety critical computer systems, 1996.

G. Kahn, The semantics of a simple language for parallel programming, Information processing, vol.74, pp.471-475, 1974.

E. A. Lee and D. G. Messerschmitt, Synchronous data flow, Proceedings of the IEEE, vol.75, issue.9, pp.1235-1245, 1987.

S. Vestal, Preemptive scheduling of multi-criticality systems with varying degrees of execution time assurance, Real-Time Systems Symposium, pp.239-243, 2007.

R. I. Davis and A. Burns, Priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems, Real-Time Systems Symposium, pp.398-409, 2009.

M. R. Garey and D. S. Johnson, Computers and intractability, vol.29, 2002.

R. I. Davis and A. Burns, A survey of hard real-time scheduling for multiprocessor systems, ACM computing surveys (CSUR), vol.43, issue.4, p.35, 2011.

S. Baruah, Mixed criticality schedulability analysis is highly intractable, 2009.

P. J. Prisaznuk, Integrated modular avionics," in Aerospace and electronics conference, 1992. naecon 1992., proceedings of the ieee 1992 national, pp.39-45, 1992.

C. B. Watkins and R. Walter, Transitioning from federated avionics architectures to integrated modular avionics, Digital Avionics Systems Conference, 2007. DASC'07. IEEE/AIAA 26th, p.2, 2007.

, Autosar consortium. automotive open system architecture (autosar)

X. Jean, Maîtrise de la couche hyperviseur sur les architectures multi-coeurs COTS dans un contexte avionique, Télécom ParisTech, 2015.

R. Kaiser and S. Wagner, Evolution of the pikeos microkernel, First International Workshop on Microkernels for Embedded Systems, p.50, 2007.

C. L. Liu and J. W. Layland, Scheduling algorithms for multiprogramming in a hard-real-time environment, Journal of the ACM (JACM), vol.20, issue.1, pp.46-61, 1973.

K. Schild and J. Würtz, Scheduling of time-triggered real-time systems, Operating Systems of the 90s and Beyond, vol.5, pp.335-357, 2000.

H. Kopetz, The time-triggered model of computation, Real-Time Systems Symposium, 1998.

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

F. Liu, A. Narayanan, and Q. Bai, Real-time systems, Citeseer, 2000.
URL : https://hal.archives-ouvertes.fr/hal-00544464

S. Baruah and J. Goossens, Handbook of scheduling: Algorithms, models, and performance analysis, vol.3, 2004.

S. Baruah, Partitioned edf scheduling: a closer look, Real-Time Systems, vol.49, issue.6, pp.715-729, 2013.

B. Kalyanasundaram and K. Pruhs, Speed is as powerful as clairvoyance, Journal of the ACM (JACM), vol.47, issue.4, pp.617-643, 2000.

C. A. Phillips, C. Stein, E. Torng, and J. Wein, Optimal time-critical scheduling via resource augmentation, Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, pp.140-149, 1997.

B. Andersson, S. Baruah, and J. Jonsson, Static-priority scheduling on multiprocessors, Real-Time Systems Symposium, pp.193-202, 2001.

S. K. Baruah, N. K. Cohen, C. G. Plaxton, and D. A. Varvel, Proportionate progress: A notion of fairness in resource allocation, Algorithmica, vol.15, issue.6, pp.600-625, 1996.

J. H. Anderson and A. Srinivasan, Mixed pfair/erfair scheduling of asynchronous periodic tasks, Journal of Computer and System Sciences, vol.68, issue.1, pp.157-204, 2004.

R. Wilhelm, J. Engblom, A. Ermedahl, N. Holsti, S. Thesing et al., The worst-case executiontime problem-overview of methods and survey of tools, ACM Transactions on Embedded Computing Systems (TECS), vol.7, issue.3, p.36, 2008.

J. Engblom, Processor pipelines and static worst-case execution time analysis, 2002.

C. Ferdinand and R. Wilhelm, Efficient and precise cache behavior prediction for real-time systems, Real-Time Systems, vol.17, issue.2-3, pp.131-181, 1999.

I. J. Stein, ILP-based path analysis on abstract pipeline state graphs. epubli, 2010.

A. Colin and I. Puaut, A modular and retargetable framework for tree-based wcet analysis, Real-Time Systems, 13th Euromicro Conference on, pp.37-44, 2001.

A. Betts, N. Merriam, and G. Bernat, Hybrid measurement-based wcet analysis at the source level using object-level traces, Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, vol.15, 2010.

L. Cucu-grosjean, L. Santinelli, M. Houston, C. Lo, T. Vardanega et al., Measurement-based probabilistic timing analysis for multi-path programs, Real-Time Systems (ECRTS), pp.91-101, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00765987

F. Wartel, L. Kosmidis, C. Lo, B. Triquet, E. Quinones et al., Measurement-based probabilistic timing analysis: Lessons from an integrated-modular avionics case study, 8th IEEE International Symposium on, pp.241-248, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00920538

S. J. Gil, I. Bate, G. Lima, L. Santinelli, A. Gogonel et al., Open challenges for probabilistic measurement-based worst-case execution time, IEEE Embedded Systems Letters, vol.9, issue.3, pp.69-72, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01633802

A. Burns and R. Davis, Mixed criticality systems-a review, pp.1-69, 2013.

S. K. Baruah, V. Bonifaci, G. Angelo, H. Li, A. Marchetti-spaccamela et al., Scheduling real-time mixed-criticality jobs, International Symposium on Mathematical Foundations of Computer Science, pp.90-101, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00643942

S. K. Baruah, A. Burns, and R. I. Davis, Response-time analysis for mixed criticality systems, Real-Time Systems Symposium (RTSS), 2011 IEEE 32nd, pp.34-43, 2011.

H. Su and D. Zhu, An elastic mixed-criticality task model and its scheduling algorithm, Proceedings of the Conference on Design, Automation and Test in Europe, pp.147-152, 2013.

K. Agrawal and S. Baruah, Intractability issues in mixed-criticality scheduling, LIPIcs-Leibniz International Proceedings in Informatics, vol.106, 2018.

N. C. Audsley, On priority asignment in fixed priority scheduling, Information Processing Letters, vol.79, issue.1, pp.39-44, 2001.

Q. Zhao, Z. Gu, and H. Zeng, Pt-amc: integrating preemption thresholds into mixed-criticality scheduling, Proceedings of the Conference on Design, Automation and Test in Europe, pp.141-146, 2013.

F. Santy, L. George, P. Thierry, and J. Goossens, Relaxing mixed-criticality scheduling strictness for task sets scheduled with fp, Real-Time Systems (ECRTS), pp.155-165, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01080434

S. K. Baruah, V. Bonifaci, G. Angelo, A. Marchetti-spaccamela, S. Van-der et al., Mixed-criticality scheduling of sporadic task systems, European Symposium on Algorithms, pp.555-566, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00643987

S. Baruah, V. Bonifaci, G. Dangelo, H. Li, A. Marchetti-spaccamela et al., The preemptive uniprocessor scheduling of mixedcriticality implicit-deadline sporadic task systems, Real-Time Systems (ECRTS), pp.145-154, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00728995

P. Ekberg and W. Yi, Bounding and shaping the demand of generalized mixedcriticality sporadic task systems, Real-time systems, vol.50, pp.48-86, 2014.

A. Easwaran, Demand-based scheduling of mixed-criticality sporadic tasks on one processor, 2013 IEEE 34th Real-Time Systems Symposium, pp.78-87, 2013.

S. Baruah, B. Chattopadhyay, H. Li, and I. Shin, Mixed-criticality scheduling on multiprocessors, Real-Time Systems, vol.50, issue.1, pp.142-177, 2014.

P. Rodriguez, L. George, Y. Abdeddaïm, and J. Goossens, Multicriteria evaluation of partitioned edf-vd for mixed-criticality systems upon identical processors, Workshop on Mixed Criticality Systems, 2013.

X. Gu and A. Easwaran, Dynamic budget management with service guarantees for mixed-criticality systems, 2016 IEEE Real-Time Systems Symposium (RTSS), pp.47-56, 2016.

J. Han, X. Tao, D. Zhu, and H. Aydin, Criticality-aware partitioning for multicore mixed-criticality systems, Parallel Processing (ICPP), 2016 45th International Conference on, pp.227-235, 2016.

S. Ramanathan and A. Easwaran, Utilization difference based partitioned scheduling of mixed-criticality systems, Proceedings of the Conference on Design, Automation & Test in Europe, pp.238-243, 2017.

R. Gratia, T. Robert, and L. Pautet, Generalized mixed-criticality scheduling based on run, Proceedings of the 23rd International Conference on Real Time and Networks Systems, pp.267-276, 2015.

J. Lee, S. Ramanathan, K. Phan, A. Easwaran, I. Shin et al., Mc-fluid: Multi-core fluid-based mixed-criticality scheduling, IEEE Transactions on Computers, issue.1, pp.1-1, 2018.

R. M. Pathan, Schedulability analysis of mixed-criticality systems on multiprocessors, 2012 24th Euromicro Conference on Real-Time Systems, pp.309-320, 2012.

H. Li and S. Baruah, Outstanding paper award: Global mixed-criticality scheduling on multiprocessors, Real-Time Systems (ECRTS), pp.166-175, 2012.

J. Lee, K. Phan, X. Gu, J. Lee, A. Easwaran et al., Mc-fluid: Fluid model-based mixed-criticality scheduling on multiprocessors, Real-Time Systems Symposium (RTSS), 2014.

S. Baruah, A. Eswaran, and Z. Guo, Mc-fluid: simplified and optimally quantified, Real-Time Systems Symposium, pp.327-337, 2015.

A. Burns and S. Baruah, Semi-partitioned cyclic executives for mixed criticality systems, Proc. 3rd Workshop on Mixed Criticality Systems (WMC), RTSS, pp.36-41, 2015.

M. A. Awan, K. Bletsas, P. F. Souto, and E. Tovar, Semi-partitioned mixedcriticality scheduling, International Conference on Architecture of Computing Systems, pp.205-218, 2017.

J. Ren and L. T. Phan, Mixed-criticality scheduling on multiprocessors using task grouping, Real-Time Systems (ECRTS), pp.25-34, 2015.

Z. Al-bayati, Q. Zhao, A. Youssef, H. Zeng, and Z. Gu, Enhanced partitioned scheduling of mixed-criticality systems on multicore platforms, Design Automation Conference (ASP-DAC), 2015 20th Asia and South Pacific, pp.630-635, 2015.

S. Ramanathan and A. Easwaran, Mixed-criticality scheduling on multiprocessors with service guarantees, 2018 IEEE 21st International Symposium on Real-Time Distributed Computing (ISORC), pp.17-24, 2018.

H. Xu and A. Burns, Semi-partitioned model for dual-core mixed criticality system, Proceedings of the 23rd International Conference on Real Time and Networks Systems, pp.257-266, 2015.

I. Bate, A. Burns, and R. I. Davis, A bailout protocol for mixed criticality systems, Real-Time Systems (ECRTS), pp.259-268, 2015.

I. Bate, A. Burns, and R. I. Davis, An enhanced bailout protocol for mixed criticality embedded software, IEEE Transactions on Software Engineering, vol.43, issue.4, pp.298-320, 2017.

H. Su, N. Guan, and D. Zhu, Service guarantee exploration for mixed-criticality systems, 2014 IEEE 20th International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA), pp.1-10, 2014.

M. Cordovilla, F. Boniol, J. Forget, E. Noulard, and C. Pagetti, Developing critical embedded systems on multicore architectures: the prelude-schedmcore toolset, 19th International Conference on Real-Time and Network Systems, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00618587

C. Lavarenne, O. Seghrouchni, Y. Sorel, and M. Sorine, The syndex software environment for real-time distributed systems design and implementation, European Control Conference, vol.2, pp.1684-1689, 1991.

E. A. Lee and D. G. Messerschmitt, Static scheduling of synchronous data flow programs for digital signal processing, IEEE Transactions on computers, vol.100, issue.1, pp.24-35, 1987.

A. K. Singh, M. Shafique, A. Kumar, and J. Henkel, Mapping on multi/many-core systems: survey of current and emerging trends, pp.1-10, 2013.

T. L. Adam, K. M. Chandy, and J. Dickson, A comparison of list schedules for parallel processing systems, Communications of the ACM, vol.17, issue.12, pp.685-690, 1974.

Y. Kwok and I. Ahmad, Benchmarking and comparison of the task graph scheduling algorithms, Journal of Parallel and Distributed Computing, vol.59, issue.3, pp.381-422, 1999.

A. Saifullah, J. Li, K. Agrawal, C. Lu, and C. Gill, Multi-core real-time scheduling for generalized parallel task models, Real-Time Systems, vol.49, issue.4, pp.404-435, 2013.

A. Saifullah, D. Ferry, J. Li, K. Agrawal, C. Lu et al., Parallel realtime scheduling of dags, IEEE Transactions on Parallel and Distributed Systems, vol.25, issue.12, pp.3242-3252, 2014.

A. Parri, A. Biondi, and M. Marinoni, Response time analysis for g-edf and gdm scheduling of sporadic dag-tasks with arbitrary deadline, Proceedings of the 23rd International Conference on Real Time and Networks Systems, pp.205-214, 2015.

M. Qamhieh, F. Fauberteau, L. George, and S. Midonnet, Global edf scheduling of directed acyclic graphs on multiprocessor systems, Proceedings of the 21st International conference on Real-Time Networks and Systems, pp.287-296, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00878667

M. Qamhieh, L. George, and S. Midonnet, A stretching algorithm for parallel realtime dag tasks on multiprocessor systems, Proceedings of the 22Nd International Conference on Real-Time Networks and Systems, p.13, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01090627

M. Qamhieh, L. George, and S. Midonnet, Stretching algorithm for global scheduling of real-time dag tasks, pp.1-31, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01814052

S. Baruah, Implementing mixed-criticality synchronous reactive programs upon uniprocessor platforms, Real-Time Systems, vol.50, issue.3, pp.317-341, 2014.

S. Baruah, Implementing mixed criticality synchronous reactive systems upon multiprocessor platforms, 2013.

S. Baruah, The federated scheduling of systems of mixed-criticality sporadic dag tasks, Real-Time Systems Symposium (RTSS), pp.227-236, 2016.

J. Li, D. Ferry, S. Ahuja, K. Agrawal, C. Gill et al., Mixed-criticality federated scheduling for parallel real-time tasks, Real-Time Systems, vol.53, issue.5, pp.760-811, 2017.

R. M. Pathan, Improving the schedulability and quality of service for federated scheduling of parallel mixed-criticality tasks on multiprocessors, LIPIcs-Leibniz International Proceedings in Informatics, vol.106, 2018.

P. Ekberg and W. Yi, Schedulability analysis of a graph-based task model for mixed-criticality systems, Real-Time Systems, vol.52, pp.1-37, 2016.

A. Singh, P. Ekberg, and S. Baruah, Applying real-time scheduling theory to the synchronous data flow model of computation, LIPIcs-Leibniz International Proceedings in Informatics, vol.76, 2017.

A. Singh, P. Ekberg, and S. Baruah, Applying real-time scheduling theory to the synchronous data flow model of computation, Proceedings of the 29th Euromicro Conference on Real-Time Systems (ECRTS) (M. Bertogna, vol.76, pp.1-8, 2017.

A. Singh, P. Ekberg, and S. Baruah, Uniprocessor scheduling of real-time synchronous dataflow tasks, pp.1-31, 2018.

E. C. Klikpo and A. Munier-kordon, Preemptive scheduling of dependent periodic tasks modeled by synchronous dataflow graphs, Proceedings of the 24th International Conference on Real-Time Networks and Systems, pp.77-86, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01449876

K. Jad, Modeling and scheduling embedded real-time systems using Synchronous Data Flow Graphs, 2018.

G. Bilsen, M. Engels, R. Lauwereins, and J. Peperstraete, Static scheduling of multi-rate and cyclo-static dsp-applications, VLSI Signal Processing, pp.137-146, 1994.

G. Bilsen, M. Engels, R. Lauwereins, and J. Peperstraete, Cycle-static dataflow, IEEE Transactions on signal processing, vol.44, issue.2, pp.397-408, 1996.

M. Bamakhrama and T. Stefanov, Hard-real-time scheduling of data-dependent tasks in embedded streaming applications, Proceedings of the ninth ACM international conference on Embedded software, pp.195-204, 2011.

M. A. Bamakhrama, J. T. Zhai, H. Nikolov, and T. Stefanov, A methodology for automated design of hard-real-time embedded streaming systems, Proceedings of the Conference on Design, Automation and Test in Europe, pp.941-946, 2012.

A. Bouakaz, J. Talpin, and J. Vitek, Affine data-flow graphs for the synthesis of hard real-time applications, Application of Concurrency to System Design (ACSD), 2012 12th International Conference on, pp.183-192, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00763387

A. Bouakaz, T. Gautier, and J. Talpin, Earliest-deadline first scheduling of multiple independent dataflow graphs, SiPS, pp.292-297, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01092606

B. D. Theelen, M. C. Geilen, T. Basten, J. P. Voeten, S. V. Gheorghita et al., A scenario-aware data flow model for combined long-run average and worstcase performance analysis, Formal Methods and Models for Co-Design, 2006. MEMOCODE'06. Proceedings. Fourth ACM and IEEE International Conference on, pp.185-194, 2006.

S. Stuijk, M. Geilen, B. Theelen, and T. Basten, Scenario-aware dataflow: Modeling, analysis and implementation of dynamic applications, 2011 International Conference on, pp.404-411, 2011.

A. Avizienis, J. Laprie, B. Randell, and C. Landwehr, Basic concepts and taxonomy of dependable and secure computing, IEEE transactions on dependable and secure computing, vol.1, pp.11-33, 2004.

A. Burns and S. Baruah, Towards a more practical model for mixed criticality systems, Workshop on Mixed-Criticality Systems (colocated with RTSS), 2013.

N. Halbwachs, P. Caspi, P. Raymond, and D. Pilaud, The synchronous data flow programming language lustre, Proceedings of the IEEE, vol.79, issue.9, pp.1305-1320, 1991.

A. Burns, R. I. Davis, S. Baruah, and I. J. Bate, Robust mixed-criticality systems, IEEE Transactions on Computers, 2018.

G. Bernat, A. Burns, and A. Liamosi, Weakly hard real-time systems, IEEE transactions on Computers, vol.50, issue.4, pp.308-321, 2001.

R. L. Graham, Bounds for certain multiprocessing anomalies, Bell Labs Technical Journal, vol.45, issue.9, pp.1563-1581, 1966.

M. Geilen, T. Basten, and S. Stuijk, Minimising buffer requirements of synchronous dataflow graphs with model checking, Proceedings of the 42nd annual Design Automation Conference, pp.819-824, 2005.

S. Stuijk, T. Basten, M. Geilen, and H. Corporaal, Multiprocessor resource allocation for throughput-constrained synchronous dataflow graphs, Proceedings of the 44th annual Design Automation Conference, pp.777-782, 2007.

M. R. Garey and D. S. Johnson, strong"np-completeness results: Motivation, examples, and implications, Journal of the ACM (JACM), vol.25, issue.3, pp.499-508, 1978.

H. S. Chwa, J. Lee, J. Lee, K. Phan, A. Easwaran et al., Global edf schedulability analysis for parallel tasks on multi-core platforms, IEEE Transactions on Parallel and Distributed Systems, vol.28, issue.5, pp.1331-1345, 2017.

O. Svensson, Conditional hardness of precedence constrained scheduling on identical machines, Proceedings of the forty-second ACM symposium on Theory of computing, pp.745-754, 2010.

A. Burns, System mode changes-general and criticality-based, Proc. of 2nd Workshop on Mixed Criticality Systems (WMC), pp.3-8, 2014.

D. L. Parnas, A. J. Van-schouwen, and S. P. Kwan, Evaluation of safety-critical software, Communications of the ACM, vol.33, issue.6, pp.636-648, 1990.

L. A. Johnson, Do-178b, software considerations in airborne systems and equipment certification, Crosstalk, vol.199, 1998.

G. Klein, K. Elphinstone, G. Heiser, J. Andronick, D. Cock et al., sel4: Formal verification of an os kernel, Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles, pp.207-220, 2009.

D. Maxim, R. I. Davis, L. Cucu-grosjean, and A. Easwaran, Probabilistic analysis for mixed criticality systems using fixed priority preemptive scheduling, Proceedings of the 25th International Conference on Real-Time Networks and Systems, pp.237-246, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01614684

M. Kwiatkowska, G. Norman, and D. Parker, PRISM 4.0: Verification of probabilistic real-time systems, Proc. 23rd International Conference on Computer Aided Verification (CAV'11, vol.6806, pp.585-591, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00648035

S. Stuijk, M. Geilen, and T. Basten, Sdf?3Sdf?3: Sdf for free," in Application of Concurrency to System Design, Sixth International Conference on, pp.276-278, 2006.

D. Cordeiro, G. Mounié, S. Perarnau, D. Trystram, J. Vincent et al., Random graph generation for scheduling simulations, Proceedings of the 3rd international ICST conference on simulation tools and techniques, p.60, 2010.
DOI : 10.4108/icst.simutools2010.8667
URL : https://hal.archives-ouvertes.fr/hal-00471255

J. Lee, A. Easwaran, I. Shin, and I. Lee, Zero-laxity based real-time multiprocessor scheduling, Journal of Systems and Software, vol.84, issue.12, pp.2324-2333, 2011.
DOI : 10.1016/j.jss.2011.07.002

R. Medina, E. Borde, and L. Pautet, Directed acyclic graph scheduling for mixedcriticality systems, Ada-Europe International Conference on Reliable Software Technologies, pp.217-232, 2017.
DOI : 10.1007/978-3-319-60588-3_14
URL : https://hal.archives-ouvertes.fr/hal-01995010

S. Oh and S. Yang, A modified least-laxity-first scheduling algorithm for real-time tasks, Real-Time Computing Systems and Applications, pp.31-36, 1998.

R. E. Lyons and W. Vanderkulk, The use of triple-modular redundancy to improve computer reliability, IBM Journal of Research and Development, vol.6, issue.2, pp.200-209, 1962.
DOI : 10.1147/rd.62.0200

J. Rushby, Bus architectures for safety-critical embedded systems, International Workshop on Embedded Software, pp.306-323, 2001.
DOI : 10.1007/3-540-45449-7_22

H. Kopetz, Fault containment and error detection in the time-triggered architecture, Autonomous Decentralized Systems, 2003. ISADS 2003. The Sixth International Symposium on, pp.139-146, 2003.
DOI : 10.1109/isads.2003.1193942

A. Goldberg and G. Horvath, Software fault protection with arinc 653, Aerospace Conference, pp.1-11, 2007.
DOI : 10.1109/aero.2007.352946

R. P. Dick, D. L. Rhodes, and W. Wolf, Tgff: task graphs for free, Proceedings of the 6th international workshop on Hardware/software codesign, pp.97-101, 1998.
DOI : 10.1109/hsc.1998.666245

T. Tobita and H. Kasahara, A standard task graph set for fair evaluation of multiprocessor scheduling algorithms, Journal of Scheduling, vol.5, issue.5, pp.379-394, 2002.
DOI : 10.1002/jos.116

E. Bini and G. C. Buttazzo, Measuring the performance of schedulability tests, Real-Time Systems, vol.30, pp.129-154, 2005.
DOI : 10.1007/s11241-005-0507-9

G. Giannopoulou, N. Stoimenov, P. Huang, L. Thiele, and B. D. De-dinechin, Mixed-criticality scheduling on cluster-based manycores with shared communication and storage resources, Real-Time Systems, vol.52, issue.4, pp.399-449, 2016.
DOI : 10.1007/s11241-015-9227-y