research-article

Handling Transients of Dynamic Real-Time Workload Under EDF Scheduling

Authors:

Alessandro Biondi,

Giorgio ButtazzoAuthors Info & Claims

IEEE Transactions on Computers, Volume 68, Issue 6

Pages 820 - 835

https://doi.org/10.1109/TC.2018.2882451

Published: 01 June 2019 Publication History

Abstract

Real-time dynamic workload consists of tasks that can arbitrarily join and leave the system at run-time. To avoid incurring deadline misses, tasks that request to join the system must pass an admission test, which has to cope with potential scheduling transients originated by the residual effect of the tasks that previously left the system. This phenomenon may require some tasks to suffer an admission delay before being accepted for execution. This paper focuses on uniprocessor earliest-deadline first (EDF) scheduling with constrained deadlines and explicitly considers methods for handling scheduling transients in the presence of dynamic real-time workload. A generalized analysis framework is first presented to overcome several limitations of the existing approaches (including the support for overlapping transients), and is then used to derive methods for computing bounds on the admission delays incurred by tasks. Building on such results, an on-line protocol is proposed to handle the admission control of a dynamic workload, which also comes with a variant that can execute in polynomial time to favor its practical application. Furthermore, the paper shows how the presented analysis can be used off-line for analyzing mode-changes among static task sets. Experimental results are finally presented to evaluate the proposed algorithms.

References

[1]

T. Cucinotta, L. Abeni, L. Palopoli, and G. Lipari, “ A robust mechanism for adaptive scheduling of multimedia applications,” ACM Trans. Embedded Comput. Syst., vol. Volume 10, no. Issue 4, 2011, Art. no. .

Digital Library

[2]

K. Konstanteli, T. Cucinotta, K. Psychas, and T. Varvarigou, “ Admission control for elastic cloud services,” in Proc. IEEE 5th Int. Conf. Cloud Comput., Jun.</conf-date>pp.24</fpage>––29</lpage>, <conf-date>2012, pp. <fpage>41<lpage>48.

Digital Library

[3]

G. Buttazzo, G. Lipari, M. Caccamo, and L. Abeni, “ Elastic scheduling for flexible workload management,” IEEE Trans. Comput., vol. Volume 51, no. Issue 3, pp. 289–302, 2002.

Digital Library

[4]

K. W. Tindell, A. Burns, and A. J. Wellings, “ Mode changes in priority preemptively scheduled systems,” in Proc. Real-Time Syst. Symp., Dec.</conf-date>pp.2</fpage>––4</lpage>, <conf-date>1992, pp. <fpage>100<lpage>109.

[5]

B. Brandenburg and M. Gul, “ Global scheduling not required: Simple, near-optimal multiprocessor real-time scheduling with semi-partitioned reservations,” in Proc. 37th IEEE Real-Time Syst. Symp., Nov. 29 - Dec. 2, 2016, pp. 99–110.

[6]

D. Casini, A. Biondi, and G. Buttazzo, “ Semi-partitioned scheduling of dynamic real-time workload: A practical approach based on analysis-driven load balancing,” in Proc. 29th Euromicro Conf. Real-Time Syst., Jun. 27–30, 2017, pp. 13:1–13:23.

[7]

G. Fohler, “ Realizing changes of operational modes with a pre run-time scheduled hard real-time system,” Responsive Comput. Syst., vol. Volume 7, pp. 287–300, 1993.

[8]

Q. Guangming, “ An earlier time for inserting and/or accelerating tasks,” Real-Time Syst., vol. Volume 41, pp. 181–194, 2009.

Digital Library

[9]

P. Rattanatamrong and J. A. B. Fortes, “ Mode transition for online scheduling of adaptive real-time systems on multiprocessors,” in Proc. IEEE 17th Int. Conf. Embedded Real-Time Comput. Syst. Appl., Aug.</conf-date>pp.28</fpage>––31</lpage>, <conf-date>2011, vol. Volume 1, pp. <fpage>25<lpage>32.

Digital Library

[10]

B. Andersson, “ Uniprocessor EDF scheduling with mode change,” in Proc. 12th Int. Conf. Principles Distrib. Syst., Dec. 15–18, 2008, pp. 572–577.

Digital Library

[11]

V. Nelis, J. Goossens, and B. Andersson, “ Two protocols for scheduling multi-mode real-time systems upon identical multiprocessor platforms,” in Proc. 21st Euromicro Conf. Real-Time Syst., Jul. 1–3, 2009, pp. 151–160.

Digital Library

[12]

V. Nelis, J. Marinho, B. Andersson, and S. M. Petters, “ Global-EDF scheduling of multimode real-time systems considering mode independent tasks,” in Proc. 23rd Euromicro Conf. Real-Time Syst., Jul.</conf-date>pp.6</fpage>––8</lpage>, <conf-date>2011, pp. <fpage>205<lpage>214.

Digital Library

[13]

L. Phan, I. Lee, and O. Sokolsky, “ Compositional analysis of multimode systems,” in Proc. 22st Euromicro Conf. Real-Time Syst., Jul. 6–9, 2010, pp. 197–206.

Digital Library

[14]

N. Fisher and M. Ahmed, “ Tractable real-time schedulability analysis for mode changes under temporal isolation,” in Proc. 9th IEEE Symp. Embedded Syst. Real-Time Multimedia, Oct.</conf-date>pp.13</fpage>––14</lpage>, <conf-date>2011, pp. <fpage>130<lpage>139.

[15]

N. Stoimenov, S. Perathoner, and L. Thiele, “ Reliable mode changes in real-time systems with fixed priority or EDF scheduling,” in Proc. Des. Autom. Test Eur. Conf. Exhib., Apr.</conf-date>pp.20</fpage>––24</lpage>, <conf-date>2009, pp. <fpage>99<lpage>104.

Digital Library

[16]

J. Lee and K. Shin, “ Schedulability analysis for a mode transition in real-time multi-core systems,” in Proc. IEEE 34th Real-Time Syst. Symp., Dec. 2013, pp. 11–20.

Digital Library

[17]

A. Block and J. H. Anderson, “ Accuracy versus migration overhead in real-time multiprocessor reweighting algorithms,” in Proc. 12th Int. Conf. Parallel Distrib. Syst., Jul.</conf-date>pp.12</fpage>––15</lpage>, <conf-date>2006, pp. <fpage>355<lpage>364.

Digital Library

[18]

J. Real and A. Crespo, “ Mode change protocols for real-time systems: A survey and a new proposal,” Real-Time Syst., vol. Volume 26, no. Issue 2, pp. 161–197, 2004.

Digital Library

[19]

L. Sha, R. Rajkumar, J. Lehoczky, and K. Ramamritham, “ Mode change protocols for priority-driven preemptive scheduling,” Real-Time Syst., vol. Volume 1, pp. 243–264, 1989.

Digital Library

[20]

M. Ahmed, N. Fisher, and D. Grosu, “ A parallel algorithm for EDF-Schedulability analysis of multi-modal real-time systems,” in Proc. IEEE Int. Conf. Embedded Real-Time Comput. Syst. Appl., Aug.</conf-date>pp.19</fpage>––22</lpage>, <conf-date>2012, pp. <fpage>154<lpage>163.

Digital Library

[21]

N. Stoimenov, L. Thiele, L. Santinelli, and G. Buttazzo, “ Resource adaptations with servers for hard real-time systems,” in Proc. 10th ACM Int. Conf. Embedded Softw., 2010, pp. 269–278.

Digital Library

[22]

L. Santinelli, G. Buttazzo, and E. Bini, “ Multi-moded resource reservations,” in Proc. 17th IEEE Real-Time Embedded Technol. Appl. Symp., Apr. 11–13, 2011, pp. 37–46.

Digital Library

[23]

P. Rattanatamrong and J. A. B. Fortes, “ Mode transition for online scheduling of adaptive real-time systems on multiprocessors,” in Proc. IEEE 17th Int. Conf. Embedded Real-Time Comput. Syst. Appl., Aug.</conf-date>pp.28</fpage>––31</lpage>, <conf-date>2011, pp. <fpage>25<lpage>32.

Digital Library

[24]

M. Bertogna, M. Cirinei, and G. Lipari, “ Schedulability analysis of global scheduling algorithms on multiprocessor platforms,” IEEE Trans. Parallel Distrib. Syst., vol. Volume 20, no. Issue 4, pp. 553–566, 2009.

Digital Library

[25]

H. Kopetz, R. Nossal, R. Hexel, A. Krger, D. Millinger, R. Pallierer, C. Temple, and M. Krug, “ Mode handling in the time-triggered architecture,” Control Eng. Practice, vol. Volume 6, no. Issue 1, pp. 61–66, 1998.

[26]

F. Heilmann, A. Syed, and G. Fohler, “ Mode-changes in COTS time-triggered network hardware without online reconfiguration,” SIGBED Rev., vol. Volume 13, no. Issue 4, pp. 55–60, 2016.

Digital Library

[27]

A. Block, J. H. Anderson, and G. Bishop, “ Fine-grained task reweighting on multiprocessors,” in Proc. 11th IEEE Int. Conf. Embedded Real-Time Comput. Syst. Appl., Jul.</conf-date>pp.17</fpage>––19</lpage>, <conf-date>2005, pp. <fpage>429<lpage>435.

Digital Library

[28]

B. Andersson and C. Ekelin, “ Exact admission-control for integrated aperiodic and periodic tasks,” in Proc. 11th IEEE Real Time Embedded Technol. Appl. Symp., Mar. 7–10, 2005, pp. 76–85.

Digital Library

[29]

A. Masrur, D. Mller, and M. Werner, “ Bi-level deadline scaling for admission control in mixed-criticality systems,” in Proc. IEEE 21st Int. Conf. Embedded Real-Time Comput. Syst. Appl., Aug. 19–21, 2015, pp. 100–109.

Digital Library

[30]

S. Baruah, V. Bonifaci, G. D'angelo, H. Li, A. Marchetti-Spaccamela, S. Van Der Ster, and L. Stougie, “ Preemptive uniprocessor scheduling of mixed-criticality sporadic task systems,” J. ACM, vol. Volume 62, no. Issue 2, 2015, Art. no. .

Digital Library

[31]

X. Gu and A. Easwaran, “ Efficient schedulability test for dynamic-priority scheduling of mixed-criticality real-time systems,” ACM Trans. Embed. Comput. Syst., vol. Volume 17, no. Issue 1, 2018, Art. no. .

Digital Library

[32]

S. K. Baruah, L. E. Rosier, and R. R. Howell, “ Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor,” Real-Time Syst., vol. Volume 2, no. Issue 4, pp. 301–324, 1990.

Digital Library

[33]

J. Lelli, C. Scordino, L. Abeni, and D. Faggioli, “ Deadline scheduling in the Linux kernel,” Softw.: Practice Experience, vol. Volume 46, no. Issue 6, pp. 821–839, 2016.

Digital Library

[34]

“ AUTOSAR 4.2 OS specification,” 2015. {Online}. Available: http://www.autosar.org/

[35]

K. Tindell and A. Alonso, “ A very simple protocol for mode changes in priority preemptive systems,” <institution content-type=institution>Universidad Politecnica de Madrid</institution>, Madrid, Spain, 1996.

[36]

G. C. Buttazzo, Hard Real-Time Comput. Syst.: Predictable Scheduling Algorithms and Appl., Third Edition . Springer, 2011.

Digital Library

[37]

F. Zhang and A. Burns, “ Schedulability analysis for real-time systems with EDF scheduling,” IEEE Trans. Comput., vol. Volume 58, no. Issue 9, pp. 1250–1258, 2009.

Digital Library

[38]

M. Spuri, “ Analysis of deadline scheduled real-time systems,” <institution content-type=institution>INRIA</institution>, France, Rep. no., 1996.

[39]

N. Fisher, T. P. Baker, and S. Baruah, “ Algorithms for determining the demand-based load of a sporadic task system,” in Proc. 12th IEEE Int. Conf. Embedded Real-Time Comput. Syst. Appl., Aug.</conf-date>pp.16</fpage>––18</lpage>, <conf-date>2006, pp. <fpage>135<lpage>146.

Digital Library

[40]

E. Bini and G. Buttazzo, “ Measuring the performance of schedulability tests,” Real-Time Syst., vol. Volume 30, pp. 129–154, 2005.

Digital Library

Cited By

Cucinotta TAbeni L(2021)Migrating Constant Bandwidth Servers on Multi-CoresProceedings of the 29th International Conference on Real-Time Networks and Systems10.1145/3453417.3453441(155-164)Online publication date: 7-Apr-2021
https://dl.acm.org/doi/10.1145/3453417.3453441
Piva MColetta AMaselli GStankovic J(2021)Environment-driven Communication in Battery-free Smart BuildingsACM Transactions on Internet of Things10.1145/34487392:2(1-30)Online publication date: 22-Apr-2021
https://dl.acm.org/doi/10.1145/3448739
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

Index Terms

Handling Transients of Dynamic Real-Time Workload Under EDF Scheduling
1. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis
      1. Scheduling algorithms
  2. Theory and algorithms for application domains
    1. Machine learning theory
      1. Reinforcement learning
        Sequential decision making

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

Recommendations

Global EDF scheduling for parallel real-time tasks

As multicore processors become ever more prevalent, it is important for real-time programs to take advantage of intra-task parallelism in order to support computation-intensive applications with tight deadlines. In this paper, we consider the global ...
Utilization Bounds for EDF Scheduling on Real-Time Multiprocessor Systems

The utilization bound for earliest deadline first (EDF) scheduling is extended from uniprocessors to homogeneous multiprocessor systems with partitioning strategies. First results are provided for a basic task model, which includes periodic and ...
Global EDF-based scheduling with laxity-driven priority promotion

This paper presents an algorithm, called Earliest Deadline Critical Laxity (EDCL), for scheduling sporadic task systems on multiprocessors. EDCL is a derivative of the Earliest Deadline Zero Laxity (EDZL) algorithm. Each job is assigned a priority based ...

Comments

Information & Contributors

Information

Published In

cover image IEEE Transactions on Computers

IEEE Transactions on Computers Volume 68, Issue 6

June 2019

147 pages

ISSN:0018-9340

Issue’s Table of Contents

Copyright © 2019.

Publisher

IEEE Computer Society

United States

Publication History

Published: 01 June 2019

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
0
Total Downloads

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

Reflects downloads up to 28 Jul 2024

Other Metrics

View Author Metrics

Citations

Cited By

Cucinotta TAbeni L(2021)Migrating Constant Bandwidth Servers on Multi-CoresProceedings of the 29th International Conference on Real-Time Networks and Systems10.1145/3453417.3453441(155-164)Online publication date: 7-Apr-2021
https://dl.acm.org/doi/10.1145/3453417.3453441
Piva MColetta AMaselli GStankovic J(2021)Environment-driven Communication in Battery-free Smart BuildingsACM Transactions on Internet of Things10.1145/34487392:2(1-30)Online publication date: 22-Apr-2021
https://dl.acm.org/doi/10.1145/3448739
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

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