A. Alhammad and R. Pellizzoni, Schedulability analysis of global memory-predictable scheduling, Proceedings of the 14th International Conference on Embedded Software, EMSOFT '14, 2014.
DOI : 10.1145/2656045.2656070

A. Alhammad, S. Wasly, and R. Pellizzoni, Memory efficient global scheduling of real-time tasks, 21st IEEE Real-Time and Embedded Technology and Applications Symposium, 2015.
DOI : 10.1109/RTAS.2015.7108452

S. Altmeyer, R. Davis, and C. Maiza, Improved cache related pre-emption delay aware response time analysis for fixed priority pre-emptive systems, Real-Time Systems, vol.6, issue.1, pp.499-526, 2012.
DOI : 10.1145/334012.334025

S. Altmeyer, R. Douma, W. Lunniss, and R. Davis, On the effectiveness of cache partitioning in hard real-time systems, Real-Time Systems, vol.58, issue.9, pp.1-46, 2016.
DOI : 10.1109/TC.2009.58

N. Audsley, Optimal priority assignment and feasibility of static priority tasks with arbitrary start times, 1991.

N. Audsley, On priority assignment in fixed priority scheduling, Information Processing Letters, vol.79, issue.1, pp.39-44, 2001.
DOI : 10.1016/S0020-0190(00)00165-4

N. Audsley, A. Burns, M. Richardson, K. Tindell, and A. Wellings, Applying new scheduling theory to static priority pre-emptive scheduling, Software Engineering Journal, vol.8, issue.5, pp.284-292, 1993.
DOI : 10.1049/sej.1993.0034

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

N. Audsley, A. Burns, M. Richardson, and A. Wellings, Hard realtime scheduling: the deadline-monotonic approach, RTOSS, 1991.
DOI : 10.1016/s1474-6670(17)51283-5

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

S. Bak, G. Yao, R. Pellizzoni, M. Caccamo, S. Baruah et al., Memory-aware scheduling of multicore task sets for real-time systems Preemptively scheduling hard-real-time sporadic tasks on one processor, RTCSA, 2012. [10] RTSS, 1990.

A. Bastoni, B. Brandenburg, and J. Anderson, Cache-related preemption and migration delays: empirical approximation and impact on schedulability, OSPERT, 2010.

E. Bini and G. C. Buttazzo, Measuring the performance of schedulability tests. Real-Time Systems, pp.129-154, 2005.

A. Burns and S. K. Baruah, Sustainability in Real-time Scheduling, Journal of Computing Science and Engineering, vol.2, issue.1, pp.74-97, 2008.
DOI : 10.5626/JCSE.2008.2.1.074

G. Buttazzo, M. Bertogna, and G. Yao, Limited Preemptive Scheduling for Real-Time Systems. A Survey, IEEE Transactions on Industrial Informatics, vol.9, issue.1, pp.3-15, 2013.
DOI : 10.1109/TII.2012.2188805

URL : https://www.iris.sssup.it/bitstream/11382/388049/1/TII-13-Survey.pdf

B. Chen, Analysis of Classes of Heuristics for Scheduling a Two-Stage Flow Shop with Parallel Machines at One Stage, Journal of the Operational Research Society, vol.46, issue.2, pp.234-244, 1995.
DOI : 10.1057/jors.1995.28

R. Davis and A. Burns, Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems, Real-Time Systems, vol.20, issue.1, pp.1-40, 2010.
DOI : 10.1007/s11241-010-9106-5

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

R. Davis, A. Burns, S. Baruah, T. Rothvoss, L. George et al., Exact comparison of fixed priority and EDF scheduling based on speedup factors for both pre-emptive and non-preemptive paradigms. Real-Time Systems, pp.51566-601, 2015.

R. I. Davis, T. Rothvoß, S. K. Baruah, and A. Burns, Exact quantification of the sub-optimality of uniprocessor fixed priority pre-emptive scheduling. Real-Time Systems, pp.211-258, 2009.

R. I. Davis, A. Thekkilakattil, O. Gettings, R. Dobrin, and S. Punnekkat, Quantifying the Exact Sub-optimality of Non-preemptive Scheduling, 2015 IEEE Real-Time Systems Symposium, 2015.
DOI : 10.1109/RTSS.2015.17

URL : https://hal.archives-ouvertes.fr/hal-01231718

M. Dertouzos, Control robotics: the procedural control of physical processes, Information Processing, vol.74, 1974.

J. Deverge and I. Puaut, WCET-Directed Dynamic Scratchpad Memory Allocation of Data, 19th Euromicro Conference on Real-Time Systems (ECRTS'07), 2007.
DOI : 10.1109/ECRTS.2007.37

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

J. Garcia and M. Harbour, Optimized priority assignment for tasks and messages in distributed hard real-time systems, Proceedings of Third Workshop on Parallel and Distributed Real-Time Systems, 1995.
DOI : 10.1109/WPDRTS.1995.470498

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

A. Hamann, M. Jersak, K. Richter, and R. Ernst, A framework for modular analysis and exploration of heterogeneous embedded systems, Real-Time Systems, vol.50, issue.2-3, pp.1-3101, 2006.
DOI : 10.1007/s11241-006-6884-x

J. Hennessy and D. Patterson, Computer architecture: a quantitative approach, 2011.

J. Hoogeveen, J. Lenstra, and B. Veltman, Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard, European Journal of Operational Research, vol.89, issue.1, pp.172-175, 1996.
DOI : 10.1016/S0377-2217(96)90070-3

URL : https://pure.tue.nl/ws/files/2129202/403141.pdf

P. Jayachandran and T. Abdelzaher, A Delay Composition Theorem for Real-Time Pipelines, 19th Euromicro Conference on Real-Time Systems (ECRTS'07), 2007.
DOI : 10.1109/ECRTS.2007.80

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

P. Jayachandran and T. Abdelzaher, Reduction-based schedulability analysis of distributed systems with cycles in the task graph, Real-Time Systems, vol.19, issue.1, pp.121-151, 2010.
DOI : 10.1007/s11241-010-9098-1

S. Johnson, Optimal two- and three-stage production schedules with setup times included, Naval Research Logistics Quarterly, vol.1, issue.1, pp.61-68, 1954.
DOI : 10.1002/nav.3800010110

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

B. Kalyanasundaram and K. Pruhs, Speed is as powerful as clairvoyance, Journal of the ACM, vol.47, issue.4, pp.617-643, 2000.
DOI : 10.1145/347476.347479

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

J. Krakora, L. Waszniowski, P. Pisa, and Z. Hanzalek, Timed automata model for component-based real-time systems, WFCS, 2004.

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

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. Lu, H. Chen, R. Fu, W. Hsu, B. Othmer et al., The performance of runtime data cache prefetching in a dynamic optimization system, MICRO, 2003.

R. Mancuso, R. Dudko, and M. Caccamo, Light-PREM: Automated software refactoring for predictable execution on COTS embedded systems, 2014 IEEE 20th International Conference on Embedded and Real-Time Computing Systems and Applications, 2014.
DOI : 10.1109/RTCSA.2014.6910515

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

A. Marongiu, L. Benini, and A. Melani, An OpenMP Compiler for Efficient Use of Distributed Scratchpad Memory in MPSoCs, IEEE Transactions on Computers, vol.61, issue.2, pp.222-236, 2012.
DOI : 10.1109/TC.2010.199

A. Melani, M. Bertogna, V. Bonifaci, A. Marchetti-spaccamela, and G. Buttazzo, Memory-processor co-scheduling in fixed priority systems, Proceedings of the 23rd International Conference on Real Time and Networks Systems, RTNS '15, 2015.
DOI : 10.1109/RTAS.2012.19

URL : https://hal.archives-ouvertes.fr/hal-01249107

A. Melani, R. Mancuso, D. Cullina, M. Caccamo, and L. Thiele, Speed Optimization for Tasks with Two Resources, Proceedings of the 2016 Design, Automation & Test in Europe Conference & Exhibition (DATE), 2016.
DOI : 10.3850/9783981537079_0404

M. D. Natale and J. A. Stankovic, Dynamic end-to-end guarantees in distributed real time systems, Proceedings Real-Time Systems Symposium REAL-94, 1994.
DOI : 10.1109/REAL.1994.342714

J. C. Palencia and M. Harbour, Offset-based response time analysis of distributed systems scheduled under EDF, 15th Euromicro Conference on Real-Time Systems, 2003. Proceedings., 2003.
DOI : 10.1109/EMRTS.2003.1212721

J. C. Palencia and M. G. Harbour, Schedulability analysis for tasks with static and dynamic offsets, Proceedings 19th IEEE Real-Time Systems Symposium (Cat. No.98CB36279), 1998.
DOI : 10.1109/REAL.1998.739728

J. C. Palencia and M. G. Harbour, Exploiting precedence relations in the schedulability analysis of distributed real-time systems, Proceedings 20th IEEE Real-Time Systems Symposium (Cat. No.99CB37054), 1999.
DOI : 10.1109/REAL.1999.818860

R. Pellizzoni, E. Betti, S. Bak, J. Criswell, M. Caccamo et al., A Predictable Execution Model for COTS-Based Embedded Systems, 2011 17th IEEE Real-Time and Embedded Technology and Applications Symposium, 2011.
DOI : 10.1109/RTAS.2011.33

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

R. Pellizzoni and G. Lipari, Holistic analysis of asynchronous real-time transactions with earliest deadline scheduling, Journal of Computer and System Sciences, vol.73, issue.2, pp.186-206, 2007.
DOI : 10.1016/j.jcss.2006.04.002

I. Puaut and C. Pais, Scratchpad memories vs locked caches in hard real-time systems: a quantitative comparison, 2007 Design, Automation & Test in Europe Conference & Exhibition, 2007.
DOI : 10.1109/DATE.2007.364510

URL : https://hal.archives-ouvertes.fr/inria-00105010

R. Rajkumar, L. Sha, and J. P. Lehoczky, On countering the effects of cycle-stealing in a hard real-time environment, RTSS, 1987.

J. Rosen, A. Andrei, P. Eles, and Z. Peng, Bus Access Optimization for Predictable Implementation of Real-Time Applications on Multiprocessor Systems-on-Chip, 28th IEEE International Real-Time Systems Symposium (RTSS 2007), 2007.
DOI : 10.1109/RTSS.2007.24

P. Schuurman and G. J. Woeginger, A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem, Theoretical Computer Science, vol.237, issue.1-2, pp.105-122, 2000.
DOI : 10.1016/S0304-3975(98)00157-1

L. Sha, J. P. Lehoczky, and R. Rajkumar, Solutions for some practical problems in prioritized preemptive scheduling, RTSS, 1986.

B. Sprunt, D. Kirk, and L. Sha, Priority-driven, preemptive I/O controllers for real-time systems, ISCA, 1988.
DOI : 10.1145/633625.52418

M. Spuri, Holistic analysis for deadline scheduled real-time distributed systems, 1996.
URL : https://hal.archives-ouvertes.fr/inria-00073818

L. Thiele, S. Chakraborty, and M. Naedele, Real-time calculus for scheduling hard real-time systems, 2000 IEEE International Symposium on Circuits and Systems. Emerging Technologies for the 21st Century. Proceedings (IEEE Cat No.00CH36353), 2000.
DOI : 10.1109/ISCAS.2000.858698

K. Tindell, A. Burns, and A. Wellings, An extendible approach for analyzing fixed priority hard real-time tasks, Real-Time Systems, vol.4, issue.2, pp.133-151, 1994.
DOI : 10.1007/BF01088593

K. Tindell and J. Clark, Holistic schedulability analysis for distributed hard real-time systems, Microprocessing and Microprogramming, vol.40, issue.2-3, pp.117-134, 1994.
DOI : 10.1016/0165-6074(94)90080-9

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

B. Ward, J. Herman, C. Kenna, and J. Anderson, Making shared caches more predictable on multicore platforms, ECRTS, 2013.
DOI : 10.1109/ecrts.2013.26

S. Wasly and R. Pellizzoni, A Dynamic Scratchpad Memory Unit for Predictable Real-Time Embedded Systems, 2013 25th Euromicro Conference on Real-Time Systems, 2013.
DOI : 10.1109/ECRTS.2013.28

S. Wasly and R. Pellizzoni, Hiding memory latency using fixed priority scheduling, 2014 IEEE 19th Real-Time and Embedded Technology and Applications Symposium (RTAS), 2014.
DOI : 10.1109/RTAS.2014.6925992

J. Whitham and N. C. Audsley, Explicit Reservation of Local Memory in a Predictable, Preemptive Multitasking Real-Time System, 2012 IEEE 18th Real Time and Embedded Technology and Applications Symposium, 2012.
DOI : 10.1109/RTAS.2012.19

G. Yao, R. Pellizzoni, S. Bak, E. Betti, and M. Caccamo, Memory-centric scheduling for multicore hard real-time systems, Real-Time Systems, vol.29, issue.5, pp.681-715, 2012.
DOI : 10.1109/RTAS.2010.24

S. Zhuravlev, J. C. Saez, S. Blagodurov, A. Fedorova, and M. Prieto, Survey of scheduling techniques for addressing shared resources in multicore processors, ACM Computing Surveys, vol.45, issue.1, p.4, 2012.
DOI : 10.1145/2379776.2379780

A. Zuhily and A. Burns, Optimal -monotonic priority assignment, Information Processing Letters, vol.103, issue.6, pp.247-250, 2007.
DOI : 10.1016/j.ipl.2007.04.006