Publisher
Springer Nature Singapore
Reference12 articles.
1. Buttazzo C (2004) Hard real-time computing systems: predictable scheduling algorithms and applications, 2nd edn. Springer
2. Davis RI, Burns A (2011) A survey of hard real-time scheduling for multiprocessor systems. ACM Comput Surveys (CSUR) 43(4):1–44
3. Gracioli G, Fröhlich AA, Pellizzoni R, Fischmeister S (2013) Implementation and evaluation of global and partitioned scheduling in a real-time OS. Real-Time Syst 49(6):669–714
4. Zapata OUP, Alvarez PM (2005) Edf and rm multiprocessor scheduling algorithms: survey and performance evaluation. Seccion de Computacion Av. IPN, 2508
5. Andersson B, Jonsson J (2003) The utilization bounds of partitioned and pfair static-priority scheduling on multiprocessors are 50%. In: 15th Euromicro conference on real-time systems, 2003. Proceedings. IEEE, pp 33–40