article

Partitioned EDF scheduling for multiprocessors using a C=D task splitting scheme

Authors:

F. ZhangAuthors Info & Claims

Real-Time Systems, Volume 48, Issue 1

Pages 3 - 33

https://doi.org/10.1007/s11241-011-9126-9

Published: 01 January 2012 Publication History

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.

References

[1]

Andersson B, Tovar E (2006) Multiprocessor scheduling with few preemptions. In: RTCSA, pp 322-334.

[2]

Andersson B, Bletsas K, Baruah SK (2008) Scheduling arbitrary-deadline sporadic task systems on multiprocessors. In: IEEE real-time systems symposium, pp 385-394.

[3]

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).

[4]

Baruah SK, Burns A (2006) Sustainable schedulability analysis. In: Proceedings of IEEE real-time systems symposium (RTSS), pp 159-168.

[5]

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.

[6]

Baruah SK, Howell RR, Rosier LE (1993) Feasibility problems for recurring tasks on one processor. Theor Comput Sci 118:3-20.

Digital Library

[7]

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.

[8]

Bini E, Buttazzo GC (2005) Measuring the performance of schedulability tests. Real-Time Syst 30(1- 2):129-154.

Digital Library

[9]

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.

[10]

Burns A, Wellings AJ (2009) Real-time systems and programming languages, 4th edn. Addison-Wesley/Longman, Reading/Harlow.

[11]

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.

[12]

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.

[13]

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).

[14]

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.

[15]

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.

[16]

Davis RI, Burns A (2011) A survey of hard real-time scheduling algorithms for multiprocessor systems. ACM Comput Surv (accepted).

[17]

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).

[18]

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.

[19]

Hoang H, Buttazzo GC, Jonsson M, Karlsson S (2006) Computing the minimum EDF feasible deadline in periodic systems. In: RTCSA, pp 125-134.

[20]

Johnson DS (1974) Near-optimal bin-packing algorithms. PhD thesis, Department of Mathematics, MIT.

[21]

Kato S, Yamasaki N (2007) Real-time scheduling with task splitting on multiprocessors. In: RTCSA, pp 441-450.

[22]

Kato S, Yamasaki N (2008a) Portioned static-priority scheduling on multiprocessors. In: IPDPS, pp 1-12.

[23]

Kato S, Yamasaki N (2008b) Portioned EDF-based scheduling on multiprocessors. In: EMSOFT, pp 139- 148.

[24]

Kato S, Yamasaki N (2009) Semi-partitioned fixed-priority scheduling on multiprocessors. In: IEEE realtime and embedded technology and applications symposium, pp 23-32.

[25]

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.

Digital Library

[26]

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 realtime systems, pp 239-248.

[27]

Liu CL, Layland JW(1973) Scheduling algorithms for multiprogramming in a hard real-time environment. JACM 20(1):46-61.

Digital Library

[28]

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.

[29]

Ripoll I, Crespo A, Mok AK (1996) Improvement in feasibilty testing for real-time tasks. Real-Time Syst 11(1):19-39.

Digital Library

[30]

Spuri M (1996) Analysis of deadline schedule real-time systems. Technical Report 2772, INRIA, France.

[31]

Yao AC (1980) New algorithms for bin packing. Journal of the ACM 27(2).

[32]

Zhang F, Burns A (2008a) Schedulability analysis for real-time systems with EDF scheduling. Technical Report YCS 426, University of York.

[33]

Zhang F, Burns A (2008b) Schedulability analysis for real-time systems with EDF scheduling. IEEE Trans Comput 58(9):1250-1258.

[34]

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.

Cited By

Yang CWang HZhang JZuo L(2022)Semi-partitioned scheduling of mixed-criticality system on multiprocessor platformsThe Journal of Supercomputing10.1007/s11227-021-04101-y78:5(6386-6410)Online publication date: 1-Apr-2022
https://dl.acm.org/doi/10.1007/s11227-021-04101-y
Casini DBiondi AButtazzo G(2021)Task Splitting and Load Balancing of Dynamic Real-Time Workloads for Semi-Partitioned EDFIEEE Transactions on Computers10.1109/TC.2020.303828670:12(2168-2181)Online publication date: 1-Dec-2021
https://dl.acm.org/doi/10.1109/TC.2020.3038286
Hobbs CTong ZBakita JAnderson J(2021)Statically optimal dynamic soft real-time semi-partitioned schedulingReal-Time Systems10.1007/s11241-020-09359-857:1-2(97-140)Online publication date: 1-Apr-2021
https://dl.acm.org/doi/10.1007/s11241-020-09359-8
Show More Cited By

Index Terms

Index terms have been assigned to the content through auto-classification.

Recommendations

Optimal rate-based scheduling on multiprocessors

The PD² Pfair/ERfair scheduling algorithm is the most efficient known algorithm for optimally scheduling periodic tasks on multiprocessors. In this paper, we prove that PD² is also optimal for scheduling "rate-based" tasks whose processing steps may be ...
Mixed Pfair/ERfair scheduling of asynchronous periodic tasks
Abstract
Pfair scheduling was proposed by Baruah, Cohen, Plaxton, and Varvel as a non-work-conserving way of optimally and efficiently scheduling periodic tasks on a multiprocessor. In this paper, we introduce a work-conserving variant of Pfair scheduling ...
Practical Aspects of Slot-Based Task-Splitting Dispatching in Its Schedulability Analysis
RTCSA '11: Proceedings of the 2011 IEEE17th International Conference on Embedded and Real-Time Computing Systems and Applications - Volume 01

Consider the problem of scheduling a set of sporadic tasks on a multiprocessor system to meet deadlines using a task splitting scheduling algorithm. Task-splitting (also called semi partitioning) scheduling algorithms assign most tasks to just one ...

Comments

Information & Contributors

Information

Published In

cover image Real-Time Systems

Real-Time Systems Volume 48, Issue 1

January 2012

133 pages

ISSN:0922-6443

Issue’s Table of Contents

Copyright © Copyright © 2012 Springer Science+Business Media, LLC.

Publisher

Kluwer Academic Publishers

United States

Publication History

Published: 01 January 2012

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

17
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 06 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Yang CWang HZhang JZuo L(2022)Semi-partitioned scheduling of mixed-criticality system on multiprocessor platformsThe Journal of Supercomputing10.1007/s11227-021-04101-y78:5(6386-6410)Online publication date: 1-Apr-2022
https://dl.acm.org/doi/10.1007/s11227-021-04101-y
Casini DBiondi AButtazzo G(2021)Task Splitting and Load Balancing of Dynamic Real-Time Workloads for Semi-Partitioned EDFIEEE Transactions on Computers10.1109/TC.2020.303828670:12(2168-2181)Online publication date: 1-Dec-2021
https://dl.acm.org/doi/10.1109/TC.2020.3038286
Hobbs CTong ZBakita JAnderson J(2021)Statically optimal dynamic soft real-time semi-partitioned schedulingReal-Time Systems10.1007/s11241-020-09359-857:1-2(97-140)Online publication date: 1-Apr-2021
https://dl.acm.org/doi/10.1007/s11241-020-09359-8
Mascitti ACucinotta TMarinoni M(2020)An adaptive, utilization-based approach to schedule real-time tasks for ARM big.LITTLE architecturesACM SIGBED Review10.1145/3412821.341282417:1(18-23)Online publication date: 27-Jul-2020
https://dl.acm.org/doi/10.1145/3412821.3412824
Guo ZYang KYao FAwad AHung CCerny TShin DBechini A(2020)Inter-task cache interference aware partitioned real-time schedulingProceedings of the 35th Annual ACM Symposium on Applied Computing10.1145/3341105.3374014(218-226)Online publication date: 30-Mar-2020
https://dl.acm.org/doi/10.1145/3341105.3374014
Derafshi DNorollah AKhosroanjam MBeitollahi H(2020)HRHS: A High-Performance Real-Time Hardware SchedulerIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2019.295213631:4(897-908)Online publication date: 16-Jan-2020
https://dl.acm.org/doi/10.1109/TPDS.2019.2952136
Hobbs CTong ZAnderson JErmont JSong YGill C(2019)Optimal soft real-time semi-partitioned scheduling made simple (and dynamic)Proceedings of the 27th International Conference on Real-Time Networks and Systems10.1145/3356401.3356402(112-122)Online publication date: 6-Nov-2019
https://dl.acm.org/doi/10.1145/3356401.3356402
Sheikh SPasha M(2018)Energy-Efficient Multicore Scheduling for Hard Real-Time SystemsACM Transactions on Embedded Computing Systems10.1145/329138717:6(1-26)Online publication date: 24-Dec-2018
https://dl.acm.org/doi/10.1145/3291387
Vanga MGujarati ABrandenburg BOliveira RFelber PHu Y(2018)TableauProceedings of the Thirteenth EuroSys Conference10.1145/3190508.3190557(1-16)Online publication date: 23-Apr-2018
https://dl.acm.org/doi/10.1145/3190508.3190557
Casini DAbeni LBiondi ACucinotta TButtazzo GBini EPagetti C(2017)Constant bandwidth servers with constrained deadlinesProceedings of the 25th International Conference on Real-Time Networks and Systems10.1145/3139258.3139285(68-77)Online publication date: 4-Oct-2017
https://dl.acm.org/doi/10.1145/3139258.3139285
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents