C. L. Liu and J. W. Layland, Sche multiprogramming in a hard real-time of the, vol.20, pp.46-61

C. L. Liu and J. W. Layland, Sched multiprogramming in a hard real-time of the ACM, vol.20, pp.46-61

, DigitalOut SyncLED(LED1

D. Syncled2, , vol.3

, Store current context MRS R0, PSP ;// Get current process stack pointer value STMDB R0!, pp.4-11

, // Save R4 to R11 in task stack (8 regs)

. Ldr-r1, =__cpp(&scheduler.curr_task

, // Get current task pointer address LDR R2

, //Save current PSP pointer value in current task, STR R0, vol.psp field // ---------------------

, // Get next task pointer address LDR R4

, // Get next task pointer value STR R4

, // set curr task = next task LDR R0

, PSP pointer value from next task psp field LDMIA R0!, pp.4-11

, R4 to R11 from task stack (8 regs)

. Msr-psp, , p.0

, LOGTP(PREEMPTED

, LOGSCHEDB(BEGIN

, scheduler.next_task = scheduler.sched_table[scheduler.index_table].task

, flag == 1) { // if it is a new instance of the task /* verify if the task has completed its previous instance before beginning a new one */ if (scheduler.next_task->done == 0) // if not then call deadline missed, vol.task //---------------------------------------------------------------------------if

. Stack_frame_init(scheduler,

T. P. Baker, Stack-based scheduling of realtime processes. Real-Time Systems, vol.3, pp.67-99, 1991.

A. Burns, K. Tindell, and A. Wellings, Effective analysis for engineering real-time fixed priority schedulers, IEEE Trans. Softw. Eng, vol.21, pp.475-480, 1995.

C. Giorgio, M. Buttazzo, G. Bertogna, and . Yao, Limited preemptive scheduling for real-time systems. a survey. Industrial Informatics, IEEE Transactions on, vol.9, issue.1, pp.3-15, 2013.

H. Chetto, M. Silly, and T. Bouchentouf, Dynamic scheduling of real-time tasks under precedence constraints. Real-Time System, vol.2, pp.181-194, 1990.

M. Chetto, Real-time Systems Scheduling 1: Fundamentals, vol.1, 2014.
URL : https://hal.archives-ouvertes.fr/hal-02021471

A. Choquet-geniet and E. Grolleau, Minimal schedulability interval for real-time systems of periodic tasks with offsets, Theor. Comput. Sci, vol.310, issue.1-3, pp.117-134, 2004.

L. Cucu-grosjean and J. Goossens, Exact schedulability tests for real-time scheduling of periodic tasks on unrelated multiprocessor platforms, Journal of Systems Architecture -Embedded Systems Design, vol.57, issue.5, pp.561-569, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00646576

J. Echague, I. Ripoll, and A. Crespo, Hard real-time preemptively scheduling with high context switch cost, Proceedings of 7th Euromicro workshop on Real-Time Systems, 1995.

J. Forget, F. Boniol, E. Grolleau, D. Lesens, and C. Pagetti, Scheduling dependent periodic tasks without synchronization mechanisms, Proceedings of the 2010 16th IEEE Real-Time and Embedded Technology and Applications Symposium, pp.301-310, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00800980

J. Forget, E. Grolleau, C. Pagetti, and P. Richard, Dynamic Priority Scheduling of Periodic Tasks with Extended Precedences, IEEE 16th Conference on Emerging Technologies Factory Automation (ETFA), 2011.
URL : https://hal.archives-ouvertes.fr/inria-00638941

J. Goossens, E. Grolleau, and L. Cucu-grosjean, Periodicity of real-time schedules for dependent periodic tasks on identical multiprocessor platforms. Real-Time Systems, vol.52, pp.808-832, 2016.

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, PDCS'07, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00413486

A. H. Kodancha, Time Management in Partitioned Systems, 2007.

H. Kopetz, The time-triggered model of computation, Proceedings of the IEEE Real Time Systems Symposium, RTSS'98, pp.168-177, 1998.

J. Leung and M. Merrill, A note on preemptive scheduling of periodic, real-time tasks, Information Processing Letters, vol.11, issue.3, 1980.

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

F. Ndoye and Y. Sorel, Monoprocessor real-time scheduling of data dependent tasks with exact preemption cost for embedded systems, Proceedings of 16th IEEE International Conference on Computational Science and Engieering, ICCSE'13, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00930224

J. M. Pont, Patterns for Time-triggered Embedded Systems: Building Reliable Applications with the 8051 Family of Microcontrollers, 2001.

P. Richard, M. Cottet, and . Richard, On-line scheduling of real-time distributed computers with complex communication constraints, ICECCS, pp.26-34, 2001.

L. Sha, R. Rajkumar, and J. P. Lehoczky, Priority inheritance protocols: An approach to real-time synchronization, IEEE Transactions on Computers, vol.39, pp.1175-1185, 1990.

R. Wilhelm, J. Engblom, A. Ermedahl, N. Holsti, S. Thesing et al., The worstcase execution time problem: overview of methods and survey of tools, Trans. on Embedded Computing Systems, vol.7, issue.3, pp.1-53, 2008.

P. , M. Yomsi, and Y. Sorel, Extending rate monotonic analysis with exact cost of preemptions for hard real-time systems, Proceedings of 19th Euromicro Conference on Real-Time Systems, ECRTS'07, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00413487