Abstract
An EDF-based task-splitting scheme for scheduling multiprocessor systems is presented in this paper. For m processors at most m−1 tasks are split. The first part of a split task is constrained to have a deadline equal to its computation time. The second part of the task then has the maximum time available to complete its execution on a different processor. The advantage of this scheme is that no special run-time mechanisms are required and the overheads are kept to a minimum. Analysis is developed that allows the parameters of the split tasks to be derived. This analysis is integrated into the QPA algorithm for testing the schedulability of any task set executing on a single processor under EDF. Evaluation of the C=D scheme is provided via a comparison with a fully partitioned scheme. Different heuristics for choosing the task to split are derived and evaluated. Issues pertaining to the implementation of the C=D scheme on Linux or via the Ada programming language are also discussed.
Similar content being viewed by others
References
Andersson B, Tovar E (2006) Multiprocessor scheduling with few preemptions. In: RTCSA, pp 322–334
Andersson B, Bletsas K, Baruah SK (2008) Scheduling arbitrary-deadline sporadic task systems on multiprocessors. In: IEEE real-time systems symposium, pp 385–394
Balbastre P, Ripoll I, Crespo A (2006) Optimal deadline assignment for periodic real-time tasks in dynamic priority systems. In: Euromicro conference on real-time systems (ECRTS)
Baruah SK, Burns A (2006) Sustainable schedulability analysis. In: Proceedings of IEEE real-time systems symposium (RTSS), pp 159–168
Baruah SK, Mok AK, Rosier LE (1990) Preemptive scheduling of hard real-time sporadic tasks on one processor. In: Proceedings of IEEE real-time systems symposium (RTSS), pp 182–190
Baruah SK, Howell RR, Rosier LE (1993) Feasibility problems for recurring tasks on one processor. Theor Comput Sci 118:3–20
Bastoni A, Brandenburg B, Anderson J (2010) Cache-related preemption and migration delays: empirical approximation and impact on schedulability. In: Proceedings of sixth international workshop on operating systems platforms for embedded real-time applications, pp 33–44
Bini E, Buttazzo GC (2005) Measuring the performance of schedulability tests. Real-Time Syst 30(1–2):129–154
Bletsas K, Andersson B (2009) Notional processors: an approach for multiprocessor scheduling. In: IEEE real-time and embedded technology and applications symposium, pp 3–12
Burns A, Wellings AJ (2009) Real-time systems and programming languages, 4th edn. Addison-Wesley/Longman, Reading/Harlow
Burns A, Wellings AJ (2010) Dispatching domains for multiprocessor platforms and their representation in Ada. In: Real J, Vardanega T (eds) Proceedings of reliable software technologies—Ada-Europe 2010. LNCS, vol 6106. Springer, Berlin, pp 41–53
Burns A, Davis RI, Wang P, Zhang F (2010) Partitioned edf scheduling for multiprocessors using a C=D scheme. In: Proceedings of 18th international conference on real-time and network systems (RTNS), pp 169–178
Checconi F, Cucinotta T, Faggioli D, Lipari G. (2009) Hierarchical multiprocessor cpu reservations for the Linux kernel. In: Proceedings of 5th international workshop on operating systems platforms for embedded real-time applications (OSPERT, 2009)
Davis RI, Burns A (2009) Priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems. In: Proceedings of IEEE real-time systems symposium (RTSS), pp 398–409
Davis R, Burns A (2010) Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems. Real-Time Syst J 1–40
Davis RI, Burns A (2011) A survey of hard real-time scheduling algorithms for multiprocessor systems. ACM Comput Surv (accepted)
Faggioli D, Checconi F, Trimarchi M, Scordino C (2009) An edf scheduling class for the Linux kernel. In: Proceedings of 11th real-time Linux workshop (RTLWS)
Guan N, Stigge M, Yi W, Yu G (2010) Fixed priority multiprocessor scheduling with Liu and Layland utilization bound. In: Proceedings of the IEEE real-time technology and applications symposium (RTAS), April 2010. IEEE Press, New York,
Hoang H, Buttazzo GC, Jonsson M, Karlsson S (2006) Computing the minimum EDF feasible deadline in periodic systems. In: RTCSA, pp 125–134
Johnson DS (1974) Near-optimal bin-packing algorithms. PhD thesis, Department of Mathematics, MIT
Kato S, Yamasaki N (2007) Real-time scheduling with task splitting on multiprocessors. In: RTCSA, pp 441–450
Kato S, Yamasaki N (2008a) Portioned static-priority scheduling on multiprocessors. In: IPDPS, pp 1–12
Kato S, Yamasaki N (2008b) Portioned EDF-based scheduling on multiprocessors. In: EMSOFT, pp 139–148
Kato S, Yamasaki N (2009) Semi-partitioned fixed-priority scheduling on multiprocessors. In: IEEE real-time and embedded technology and applications symposium, pp 23–32
Kato S, Yamasaki N, Ishikawa Y (2009) Semi-partitioned scheduling of sporadic task systems on multiprocessors. In: ECRTS’09: proceedings of the 2009 21st euromicro conference on real-time systems, pp 249–258
Lakshmanan K, Rajkumar R, Lehoczky J (2009) Partitioned fixed-priority preemptive scheduling for multi-core processors. In: ECRTS’09: proceedings of the 2009 21st euromicro conference on real-time systems, pp 239–248
Liu CL, Layland JW (1973) Scheduling algorithms for multiprogramming in a hard real-time environment. JACM 20(1):46–61
Lopez JM, Garcia M, Diaz JL, Garcia DF (2000) Worst-case utilization bound for EDF scheduling on real-time multiprocessor systems. In: Proceedings of ECRTS, pp 25–33
Ripoll I, Crespo A, Mok AK (1996) Improvement in feasibilty testing for real-time tasks. Real-Time Syst 11(1):19–39
Spuri M (1996) Analysis of deadline schedule real-time systems. Technical Report 2772, INRIA, France
Yao AC (1980) New algorithms for bin packing. Journal of the ACM 27(2)
Zhang F, Burns A (2008a) Schedulability analysis for real-time systems with EDF scheduling. Technical Report YCS 426, University of York
Zhang F, Burns A (2008b) Schedulability analysis for real-time systems with EDF scheduling. IEEE Trans Comput 58(9):1250–1258
Zhang F, Burns A, Baruah S (2010) Sensitivity analysis for EDF scheduled arbitrary deadline real-time systems. In: Proceedings of 16th IEEE conference on embedded and real-time computing systems and applications (RTCSA), pp 61–70
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Burns, A., Davis, R.I., Wang, P. et al. Partitioned EDF scheduling for multiprocessors using a C=D task splitting scheme. Real-Time Syst 48, 3–33 (2012). https://doi.org/10.1007/s11241-011-9126-9
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11241-011-9126-9