Article

Efficient Feasibility Analysis for Real-Time Systems with EDF Scheduling

Authors:

Karsten Albers,

Frank SlomkaAuthors Info & Claims

DATE '05: Proceedings of the conference on Design, Automation and Test in Europe - Volume 1

Pages 492 - 497

https://doi.org/10.1109/DATE.2005.128

Published: 07 March 2005 Publication History

Get Access

Abstract

This paper presents new fast exact feasibility tests for uniprocessor real-time systems using preemptive EDF scheduling.Task sets which are accepted by previously described sufficient tests will be evaluated in nearly the same time as with the old tests by the new algorithms. Many task sets are not accepted by the earlier tests despite them beeing feasible.These task sets will be evaluated by the new algorithms a lot faster than with known exact feasibility tests.Therefore it is possible to use them for many applications for which only sufficient test are suitable.Additionally this paper shows that the best previous known sufficient test, the best known feasibility bound and the best known approximation algorithm can be derived from these new tests.In result this leads to an integrated schedulability theory for EDF.

References

[1]

{1} K. Albers, F. Slomka. An Event Stream Driven Approximation for the Analysis of Real-Time Systems, IEEE Proceedings of the 16th Euromicro Conference on Real-Time Systems, pp. 187-195, 2004.

Digital Library

Google Scholar

[2]

{2} S. Baruah, D. Chen, S. Gorinsky, A. Mok. Generalized Multiframe Tasks. The International Journal of Time-Critical Computing Systems, 17, 5-22, 1999.

Digital Library

Google Scholar

[3]

{3} S. Baruah, A. Mok, L. Rosier. Preemptive Scheduling Hard-Real-Time Sporadic Tasks on One Processor. Proceedings of the Real-Time Systems Symposium, 182-190, 1990.

Google Scholar

[4]

{4} E. Bini, G. Buttazzo. Biasing Effects in Schedulability Measures. IEEE Proceedings of the 16th Euromicro Conference on Real-Time Systems, pp. 196-203, 2004.

Digital Library

Google Scholar

[5]

{5} E. Bini, G. Buttazzo. The Space of Rate Monotonic Schedulability . Proceedings of the 23th IEEE Real-Time Systems Symposium, 2002.

Digital Library

Google Scholar

[6]

{6} J. Y. Le Boudec, P. Thiran. Network Calculus - A Theory of deterministic Queuing Systems for the Internet. LNCS 2050, Springer Verlag, 2001.

Digital Library

Google Scholar

[7]

{7} S. Chakraborty, S. Künzli, L. Thiele. A. Herkersdorf, P. Sagmeister. Performace Evaluation of Network Processor Architectures: Combining Simulation with Analytical Estimation , Computer Networks, Vol. 41, No. 5, pp. 641-665, 2003.

Digital Library

Google Scholar

[8]

{8} S. Chakraborty, S. Künzli, L. Thiele. Approximate Schedulability Analysis. 23rd IEEE Real-Time Systems Symposium (RTSS), IEEE Press, 159-168, 2002.

Digital Library

Google Scholar

[9]

{9} M. Devi. An Improved Schedulability Test for Uniprocessor Periodic Task Systems. Proceedings of the 15th Euromicro Conference on Real-Time Systems, 2003.

Google Scholar

[10]

{10} L George, N. Rivierre, M. Spuri. Preemptive and Non-Preemptive Real-Time Uni-Processor Scheduling. Rapport de Recherche RR-2966, INRIA, France, 1996.

Google Scholar

[11]

{11} K. Gresser. Echtzeitnachweis Ereignisgesteuerter Realzeitsysteme . Dissertation (in german), VDI Verlag, Düsseldorf, 10(286), 1993.

Google Scholar

[12]

{12} C. Liu, J. Layland. Scheduling Algorithms for Multiprogramming in Hard Real-Time Environments. Journal of the ACM, 20(1), 46-61, 1973.

Digital Library

Google Scholar

[13]

{13} R. Pellizzoni, G. Lipari. A New Sufficient Feasibility Test for Asynchronous Real-Time Periodic Task Sets. Proceeding of the 16th Euromicro Conference on Real-Time Systems, pp. 204-211, 2004.

Digital Library

Google Scholar

[14]

{14} J. A. Stankovic, M. Spuri, K. Ramamritham, G. C. Buttazzo. Deadline Scheduling for Real-Time Systems EDF and Related Algorithms. Kluwer Academic Publishers, 1998.

Digital Library

Google Scholar

Cited By

View all

Kuo CLu YHung CSaid L(2018)Scheduling algorithms for dynamical real-time tasks on multiprocessor systemsProceedings of the 2018 Conference on Research in Adaptive and Convergent Systems10.1145/3264746.3264758(213-218)Online publication date: 9-Oct-2018
https://dl.acm.org/doi/10.1145/3264746.3264758
Nguyen TTran NLe VRichard PAuguin Mde Simone RDavis RGrolleau E(2013)Approximation scheme for real-time tasks under fixed-priority scheduling with deferred preemptionProceedings of the 21st International conference on Real-Time Networks and Systems10.1145/2516821.2516831(265-274)Online publication date: 16-Oct-2013
https://dl.acm.org/doi/10.1145/2516821.2516831
Bamakhrama MStefanov TJerraya ACarloni LChang NFummi F(2012)Managing latency in embedded streaming applications under hard-real-time schedulingProceedings of the eighth IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis10.1145/2380445.2380464(83-92)Online publication date: 7-Oct-2012
https://dl.acm.org/doi/10.1145/2380445.2380464
Show More Cited By

Recommendations

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 ...
Schedulability Analysis for Real-Time Systems with EDF Scheduling

Real-time scheduling is the theoretical basis of real-time systems engineering. Earliest Deadline First (EDF) is an optimal scheduling algorithm for uniprocessor real-time systems. Existing results on an exact schedulability test for EDF task systems ...
Non-migratory feasibility and migratory schedulability analysis of multiprocessor real-time systems

The multiprocessor scheduling of collections of real-time jobs is considered. Sufficient tests are derived for feasibility analysis of a collection of sporadic jobs where job migration between processors is forbidden. The fixed-priority scheduling of ...

Comments

Information & Contributors

Information

Published In

DATE '05: Proceedings of the conference on Design, Automation and Test in Europe - Volume 1

March 2005

630 pages

ISBN:0769522882

Publisher

IEEE Computer Society

United States

Publication History

Published: 07 March 2005

Check for updates

Qualifiers

Article

Conference

DATE05

Sponsor:

SIGDA

DATE05: Design, Automation and Test in Europe

March 7 - 11, 2005

Acceptance Rates

Overall Acceptance Rate 518 of 1,794 submissions, 29%

Upcoming Conference

DATE '25

Sponsor:
sigda

Design, Automation and Test in Europe

March 31 - April 2, 2025

Lyon , France

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

11
Total Citations
View Citations
15
Total Downloads

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

Reflects downloads up to 09 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Kuo CLu YHung CSaid L(2018)Scheduling algorithms for dynamical real-time tasks on multiprocessor systemsProceedings of the 2018 Conference on Research in Adaptive and Convergent Systems10.1145/3264746.3264758(213-218)Online publication date: 9-Oct-2018
https://dl.acm.org/doi/10.1145/3264746.3264758
Nguyen TTran NLe VRichard PAuguin Mde Simone RDavis RGrolleau E(2013)Approximation scheme for real-time tasks under fixed-priority scheduling with deferred preemptionProceedings of the 21st International conference on Real-Time Networks and Systems10.1145/2516821.2516831(265-274)Online publication date: 16-Oct-2013
https://dl.acm.org/doi/10.1145/2516821.2516831
Bamakhrama MStefanov TJerraya ACarloni LChang NFummi F(2012)Managing latency in embedded streaming applications under hard-real-time schedulingProceedings of the eighth IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis10.1145/2380445.2380464(83-92)Online publication date: 7-Oct-2012
https://dl.acm.org/doi/10.1145/2380445.2380464
Eisenbrand FRothvoß TCharikar M(2010)EDF-schedulability of synchronous periodic task systems is coNP-hardProceedings of the twenty-first annual ACM-SIAM symposium on Discrete algorithms10.5555/1873601.1873684(1029-1034)Online publication date: 17-Jan-2010
https://dl.acm.org/doi/10.5555/1873601.1873684
Viehl APressler MBringmann ORosenstiel WBenini LDe Micheli GAl-Hashimi BMueller W(2009)White box performance analysis considering static non-preemptive software schedulingProceedings of the Conference on Design, Automation and Test in Europe10.5555/1874620.1874746(513-518)Online publication date: 20-Apr-2009
https://dl.acm.org/doi/10.5555/1874620.1874746
Yang COrailoglu ABenini LDe Micheli GAl-Hashimi BMueller W(2009)Towards no-cost adaptive MPSoC static schedules through exploitation of logical-to-physical core mapping latitudeProceedings of the Conference on Design, Automation and Test in Europe10.5555/1874620.1874637(63-68)Online publication date: 20-Apr-2009
https://dl.acm.org/doi/10.5555/1874620.1874637
Masrur ADrössler SFärber GSciuto D(2008)Improvements in polynomial-time feasibility testing for EDFProceedings of the conference on Design, automation and test in Europe10.1145/1403375.1403624(1033-1038)Online publication date: 10-Mar-2008
https://dl.acm.org/doi/10.1145/1403375.1403624
Lipskoch HAlbers KSlomka F(2007)Fast calculation of permissible slowdown factors for hard real-time systemsProceedings of the 17th international conference on Integrated Circuit and System Design: power and timing modeling, optimization and simulation10.5555/2391795.2391854(495-504)Online publication date: 3-Sep-2007
https://dl.acm.org/doi/10.5555/2391795.2391854
Viehl ASchwarz MBringmann ORosenstiel WHa SChoi KDutt NTeich J(2007)Probabilistic performance risk analysis at system-levelProceedings of the 5th IEEE/ACM international conference on Hardware/software codesign and system synthesis10.1145/1289816.1289862(185-190)Online publication date: 30-Sep-2007
https://dl.acm.org/doi/10.1145/1289816.1289862
Yang COrailoglu AHa SChoi KDutt NTeich J(2007)Predictable execution adaptivity through embedding dynamic reconfigurability into static MPSoC schedulesProceedings of the 5th IEEE/ACM international conference on Hardware/software codesign and system synthesis10.1145/1289816.1289824(15-20)Online publication date: 30-Sep-2007
https://dl.acm.org/doi/10.1145/1289816.1289824
Show More Cited By

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.

Cited By

Index Terms

Recommendations

Utilization Bounds for EDF Scheduling on Real-Time Multiprocessor Systems

Schedulability Analysis for Real-Time Systems with EDF Scheduling

Non-migratory feasibility and migratory schedulability analysis of multiprocessor real-time systems

Comments

Published In

Sponsors

Publisher

Publication History

Check for updates

Qualifiers

Conference

Acceptance Rates

Upcoming Conference

Other Metrics

Article Metrics

Other Metrics

Cited By

Login options

Full Access

PDF

eReader

Abstract

References

Cited By

Index Terms

Recommendations

Utilization Bounds for EDF Scheduling on Real-Time Multiprocessor Systems

Schedulability Analysis for Real-Time Systems with EDF Scheduling

Non-migratory feasibility and migratory schedulability analysis of multiprocessor real-time systems

Comments

Information

Published In

Sponsors

Publisher

Publication History

Check for updates

Qualifiers

Conference

Acceptance Rates

Upcoming Conference

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Get Access

Login options

Full Access

View options

PDF

eReader

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations