Article

Global deadline-monotonic scheduling of arbitrary-deadline sporadic task systems

Authors:

Sanjoy Baruah,

Nathan FisherAuthors Info & Claims

OPODIS'07: Proceedings of the 11th international conference on Principles of distributed systems

Pages 204 - 216

Published: 17 December 2007 Publication History

Abstract

The multiprocessor Deadline-Monotonic scheduling of sporadic task systems is studied. A new sufficient schedulability test is presented and proved correct. It is shown that this test offers non-trivial quantitative guarantees, including a processor speedup bound.

References

[1]

Mok, A.K.: Fundamental Design Problems of Distributed Systems for The Hard-Real-Time Environment. PhD thesis, Laboratory for Computer Science, Massachusetts Institute of Technology (1983), Available as Technical Report No. MIT/LCS/TR-297

Digital Library

Google Scholar

[2]

Baruah, S., Mok, A., Rosier, L.: Preemptively scheduling hard-real-time sporadic tasks on one processor. In: Proceedings of the 11th Real-Time Systems Symposium, Orlando, Florida, pp. 182-190. IEEE Computer Society Press, Los Alamitos (1990).

Google Scholar

[3]

Leung, J., Whitehead, J.: On the complexity of fixed-priority scheduling of periodic, realtime tasks. Performance Evaluation 2, 237-250 (1982).

Crossref

Google Scholar

[4]

Buttazzo, G.C.: Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications, Second edn. (2005).

Digital Library

Google Scholar

[5]

Baker, T.P., Fisher, N., Baruah, S.: Algorithms for determining the load of a sporadic task system. Technical Report TR-051201, Department of Computer Science, Florida State University (2005).

Google Scholar

[6]

Fisher, N., Baker, T., Baruah, S.: Algorithms for determining the demand-based load of a sporadic task system. In: Proceedings of the International Conference on Real-time Computing Systems and Applications, Sydney, Australia, IEEE Computer Society Press, Los Alamitos (2006).

Digital Library

Google Scholar

[7]

Klein, M., Ralya, T., Pollak, B., Obenza, R., Harbour, M.G.: A Practitioner's Handbook for Real-Time Analysis: Guide to Rate Monotonic Analysis for Real-Time Systems. Kluwer Academic Publishers, Boston (1993).

Digital Library

Google Scholar

[8]

Audsley, N.C., Burns, A., Davis, R.I., Tindell, K.W., Wellings, A.J.: Fixed priority preemptive scheduling: An historical perspective. Real-Time Systems 8, 173-198 (1995).

Digital Library

Google Scholar

[9]

Sha, L., Abdelzaher, T., Årzén, K.E., Cervin, A., Baker, T., Burns, A., Buttazzo, G., Caccamo, M., Lehoczky, J., Mok, A.K.: Real-time scheduling theory: A historical perspective. Real-Time Systems: The International Journal of Time-Critical Computing 28(2-3), 101- 155 (2004).

Digital Library

Google Scholar

[10]

Baker, T.P.: An analysis of fixed-priority schedulability on a multiprocessor. Real-Time Systems: The International Journal of Time-Critical Computing 32(1-2), 49-71 (2006).

Digital Library

Google Scholar

[11]

Bertogna, M., Cirinei, M., Lipari, G.: New schedulability tests for real-time tasks sets scheduled by deadline monotonic on multiprocessors. In: Proceedings of the 9th International Conference on Principles of Distributed Systems, Pisa, Italy, IEEE Computer Society Press, Los Alamitos (2005).

Digital Library

Google Scholar

[12]

Fisher, N., Baruah, S.: Global static-priority scheduling of sporadic task systems on multiprocessor platforms. In: Proceeding of the IASTED International Conference on Parallel and Distributed Computing and Systems, Dallas, TX, IASTED (November 2006).

Google Scholar

[13]

Baruah, S.: Schedulability analysis of global deadline-monotonic scheduling (submission, 2007).

Google Scholar

Cited By

View all

Zhou QLi JLi G(2021)Excluding Parallel Execution to Improve Global Fixed Priority Response Time AnalysisACM Transactions on Embedded Computing Systems10.1145/347703520:5s(1-24)Online publication date: 23-Sep-2021
https://dl.acm.org/doi/10.1145/3477035
Han DLi GZhou QLi JYang YHu X(2021)An Efficient Execution Framework of Two-Part Execution Scenario AnalysisACM Transactions on Design Automation of Electronic Systems10.1145/346547427:1(1-24)Online publication date: 13-Sep-2021
https://dl.acm.org/doi/10.1145/3465474
Baruah SBonifaci VMarchetti-Spaccamela AStiller S(2010)Improved multiprocessor global schedulability analysisReal-Time Systems10.1007/s11241-010-9096-346:1(3-24)Online publication date: 1-Sep-2010
https://dl.acm.org/doi/10.1007/s11241-010-9096-3
Show More Cited By

Recommendations

An analysis of global edf schedulability for arbitrary-deadline sporadic task systems

Recent results on the global multiprocessor edf scheduling of sporadic task systems are, for the most part, applicable only to task systems in which each task's relative deadline parameter is constrained to be no larger than its minimum inter-arrival ...
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 ...
Global EDF Schedulability Analysis of Arbitrary Sporadic Task Systems
ECRTS '08: Proceedings of the 2008 Euromicro Conference on Real-Time Systems

Recent results on the global multiprocessor EDFscheduling of sporadic task systems are, for the mostpart, applicable only to task systems in which eachtask’s relative deadline parameter is constrained to beno larger than its period. This paper ...

Comments

Information & Contributors

Information

Published In

OPODIS'07: Proceedings of the 11th international conference on Principles of distributed systems

December 2007

457 pages

ISBN:354077095X

Editors:
Eduardo Tovar
Polytechnic Institute of Porto, ISEP, Department of Computer Engineering, Porto, Portugal
,
Philippas Tsigas
Chalmers University of Technology, Department of Computer Science & Engineering, Göteborg, Sweden
,
Hacène Fouchal
GRIMAAG, Université des Antilles et de Guyane, Guadeloupe, France

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 17 December 2007

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
3
Total Downloads

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

Reflects downloads up to 25 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Zhou QLi JLi G(2021)Excluding Parallel Execution to Improve Global Fixed Priority Response Time AnalysisACM Transactions on Embedded Computing Systems10.1145/347703520:5s(1-24)Online publication date: 23-Sep-2021
https://dl.acm.org/doi/10.1145/3477035
Han DLi GZhou QLi JYang YHu X(2021)An Efficient Execution Framework of Two-Part Execution Scenario AnalysisACM Transactions on Design Automation of Electronic Systems10.1145/346547427:1(1-24)Online publication date: 13-Sep-2021
https://dl.acm.org/doi/10.1145/3465474
Baruah SBonifaci VMarchetti-Spaccamela AStiller S(2010)Improved multiprocessor global schedulability analysisReal-Time Systems10.1007/s11241-010-9096-346:1(3-24)Online publication date: 1-Sep-2010
https://dl.acm.org/doi/10.1007/s11241-010-9096-3
Fisher NGoossens JBaruah S(2010)Optimal online multiprocessor scheduling of sporadic real-time tasks is impossibleReal-Time Systems10.1007/s11241-010-9092-745:1-2(26-71)Online publication date: 1-Jun-2010
https://dl.acm.org/doi/10.1007/s11241-010-9092-7

Abstract

References

Cited By

Recommendations

An analysis of global edf schedulability for arbitrary-deadline sporadic task systems

Global EDF-based scheduling with laxity-driven priority promotion

Global EDF Schedulability Analysis of Arbitrary Sporadic Task Systems

Comments

Information

Published In

Sponsors

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Share

Share this Publication link

Share on social media

Affiliations