research-article

Open access

Response time bounds for sporadic arbitrary-deadline tasks under global fixed-priority scheduling on multiprocessors

Authors:

Wen-Hung Huang,

Jian-Jia ChenAuthors Info & Claims

RTNS '15: Proceedings of the 23rd International Conference on Real Time and Networks Systems

Pages 215 - 224

https://doi.org/10.1145/2834848.2834849

Published: 04 November 2015 Publication History

Abstract

In this paper, we study the problem of scheduling arbitrary-deadline real-time sporadic task sets on a multiprocessor system under global fixed-priority scheduling. Two contributions are made in this paper. First, it has been shown that the existing response time analysis in arbitrary-deadline systems is flawed: the response time may be larger than the derived bound. This paper provides a revised analysis resolving the problems with the original approach, and then propose a corresponding schedulability test. Secondly, we derive a linear-time upper bound on the response time of arbitrary-deadline tasks in multiprocessor systems. To the best of our knowledge, this is the first work presenting a linear-time response time upper bound for arbitrary-deadline sporadic tasks in multiprocessor systems. Empirically, this linear-time response time bound is shown to be highly effective in terms of the number of task sets that are deemed schedulable.

References

[1]

B. Andersson, S. Baruah, and J. Jonsson. Static-priority scheduling on multiprocessors. In Real-Time Systems Symposium (RTSS 2001), pages 193--202, 2001.

Digital Library

[2]

B. Andersson and J. Jonsson. Fixed-priority preemptive multiprocessor scheduling: to partition or not to partition. In Real-Time Computing Systems and Applications, 2000. Proceedings. Seventh International Conference on, pages 337--346. IEEE, 2000.

Digital Library

[3]

T. P. Baker. Multiprocessor edf and deadline monotonic schedulability analysis. In IEEE Real-Time Systems Symposium, pages 120--129, 2003.

Digital Library

[4]

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

Digital Library

[5]

T. P. Baker and M. Cirinei. Brute-force determination of multiprocessor schedulability for sets of sporadic hard-deadline tasks. In Principles of Distributed Systems, 11th International Conference, OPODIS 2007, Guadeloupe, French West Indies, December 17-20, 2007. Proceedings, pages 62--75, 2007.

Digital Library

[6]

S. Baruah, V. Bonifaci, A. Marchetti-Spaccamela, and S. Stiller. Improved multiprocessor global schedulability analysis. Real-Time Systems, 46(1):3--24, 2010.

Digital Library

[7]

S. Baruah and N. Fisher. Global fixed-priority scheduling of arbitrary-deadline sporadic task systems. In Distributed Computing and Networking, pages 215--226. Springer, 2008.

Digital Library

[8]

S. K. Baruah. Techniques for multiprocessor global schedulability analysis. In Proceedings of the 28th IEEE Real-Time Systems Symposium, pages 119--128, 2007.

Digital Library

[9]

M. Bertogna and M. Cirinei. Response-time analysis for globally scheduled symmetric multiprocessor platforms. In Real-Time Systems Symposium, pages 149--160, 2007.

Digital Library

[10]

M. Bertogna, M. Cirinei, and G. Lipari. Improved schedulability analysis of edf on multiprocessor platforms. In Euromicro Conference on Real-Time Systems (ECRTS), pages 209--218, 2005.

Digital Library

[11]

M. Bertogna, M. Cirinei, and G. Lipari. New schedulability tests for real-time task sets scheduled by deadline monotonic on multiprocessors. In Principles of Distributed Systems, pages 306--321. Springer, 2006.

Digital Library

[12]

E. Bini. The quadratic utilization upper bound for arbitrary deadline real-time tasks. Computers, IEEE Transactions on, 64(2):593--599, 2015.

[13]

E. Bini and G. C. Buttazzo. Schedulability analysis of periodic fixed priority systems. Computers, IEEE Transactions on, 53(11):1462--1473, 2004.

Digital Library

[14]

E. Bini and G. C. Buttazzo. Measuring the performance of schedulability tests. Real-Time Systems, 30(1-2):129--154, 2005.

Digital Library

[15]

E. Bini, T. H. C. Nguyen, P. Richard, and S. K. Baruah. A response-time bound in fixed-priority scheduling with arbitrary deadlines. IEEE Transactions on Computers, 58(2):279, 2009.

Digital Library

[16]

M. Blum, R. W. Floyd, V. Pratt, R. L. Rivest, and R. E. Tarjan. Time bounds for selection. Journal of computer and system sciences, 7(4):448--461, 1973.

Digital Library

[17]

R. I. Davis and A. Burns. Response time upper bounds for fixed priority real-time systems. In Real-Time Systems Symposium, 2008, pages 407--418. IEEE, 2008.

Digital Library

[18]

R. I. Davis and A. Burns. Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems. Real-Time Systems, 47(1):1--40, 2011.

Digital Library

[19]

R. I. Davis and A. Burns. A survey of hard real-time scheduling for multiprocessor systems. ACM Computing Surveys (CSUR), 43(4):35, 2011.

Digital Library

[20]

R. I. Davis, A. Zabos, and A. Burns. Efficient exact schedulability tests for fixed priority real-time systems. Computers, IEEE Transactions on, 57(9):1261--1276, 2008.

Digital Library

[21]

G. Geeraerts, J. Goossens, and M. Lindström. Multiprocessor schedulability of arbitrary-deadline sporadic tasks: complexity and antichain algorithm. Real-Time Systems, 49(2):171--218, 2013.

Digital Library

[22]

N. Guan, M. Stigge, W. Yi, and G. Yu. New response time bounds for fixed priority multiprocessor scheduling. In Real-Time Systems Symposium, 2009, RTSS 2009. 30th IEEE, pages 387--397. IEEE, 2009.

Digital Library

[23]

J. P. Lehoczky. Fixed priority scheduling of periodic task sets with arbitrary deadlines. In Real Time Systems Symposium, pages 201--209, 1990.

[24]

C. L. Liu and J. W. Layland. Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of the ACM (JACM), 20(1):46--61, 1973.

Digital Library

[25]

A. K. Mok. Fundamental design problems of distributed systems for the hard-real-time environment. 1983.

[26]

C. A. Phillips, C. Stein, E. Torng, and J. Wein. Optimal time-critical scheduling via resource augmentation. In Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, pages 140--149. ACM, 1997.

Digital Library

[27]

M. Sjodin and H. Hansson. Improved response-time analysis calculations. In Real-Time Systems Symposium, 1998. Proceedings., The 19th IEEE, pages 399--408. IEEE, 1998.

Digital Library

[28]

Y. Sun and G. Lipari. A weak simulation relation for real-time schedulability analysis of global fixed priority scheduling using linear hybrid automata. In 22nd International Conference on Real-Time Networks and Systems, RTNS '14, Versaille, France, October 8--10, 2014, page 35, 2014.

Digital Library

[29]

Y. Sun, G. Lipari, N. AGuan, W. Yi, et al. Improving the response time analysis of global fixed-priority multiprocessor scheduling. In IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA), pages 1--9, 2014.

[30]

K. Tindell, A. Burns, and A. J. Wellings. An extendible approach for analyzing fixed priority hard real-time tasks. Real-Time Systems, 6(2):133--151, 1994.

Digital Library

Cited By

Han DLi GZhou QLi JYang YHu X(2022)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: 31-Jan-2022
https://dl.acm.org/doi/10.1145/3465474
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: 17-Sep-2021
https://dl.acm.org/doi/10.1145/3477035
Zhou QLi GZhou CLi J(2021)Limited Busy Periods in Response Time Analysis for Tasks Under Global EDF SchedulingIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2020.299426540:2(232-245)Online publication date: Feb-2021
https://doi.org/10.1109/TCAD.2020.2994265
Show More Cited By

Response time bounds for sporadic arbitrary-deadline tasks under global fixed-priority scheduling on multiprocessors
1. Computer systems organization
  1. Embedded and cyber-physical systems
2. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis
    2. Online algorithms
      1. Online learning algorithms
  2. Theory and algorithms for application domains
    1. Machine learning theory
      1. Reinforcement learning

Recommendations

Global fixed-priority scheduling of arbitrary-deadline sporadic task systems
ICDCN'08: Proceedings of the 9th international conference on Distributed computing and networking

Fixed Task Priority (FTP) scheduling algorithms are priority-driven scheduling algorithms in which all jobs generated by each recurrent task are restricted to have the same priority. The multiprocessor FTP scheduling of sporadic task systems is studied ...
Preference-oriented fixed-priority scheduling for periodic real-time tasks

A preference priority assignment (PPA) scheme that explicitly incorporates the ASAP and ALAP execution preferences of periodic real-time tasks is proposed.An online dual-queue based preference-oriented fixed- priority (POFP) scheduler is proposed 4, ...
Global deadline-monotonic scheduling of arbitrary-deadline sporadic task systems
OPODIS'07: Proceedings of the 11th international conference on Principles of distributed systems

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

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

RTNS '15: Proceedings of the 23rd International Conference on Real Time and Networks Systems

November 2015

320 pages

ISBN:9781450335911

DOI:10.1145/2834848

General Chair:
Julien Forget
Université de Lille, France

Copyright © 2015 Owner/Author.

Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 04 November 2015

Check for updates

Qualifiers

Research-article

Funding Sources

DFG

Conference

RTNS '15

RTNS '15: 23rd International Conference on Real-Time Networks and Systems

November 4 - 6, 2015

Lille, France

Acceptance Rates

RTNS '15 Paper Acceptance Rate 31 of 66 submissions, 47%;

Overall Acceptance Rate 119 of 255 submissions, 47%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

11
Total Citations
View Citations
328
Total Downloads

Downloads (Last 12 months)45
Downloads (Last 6 weeks)9

Reflects downloads up to 23 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Han DLi GZhou QLi JYang YHu X(2022)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: 31-Jan-2022
https://dl.acm.org/doi/10.1145/3465474
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: 17-Sep-2021
https://dl.acm.org/doi/10.1145/3477035
Zhou QLi GZhou CLi J(2021)Limited Busy Periods in Response Time Analysis for Tasks Under Global EDF SchedulingIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2020.299426540:2(232-245)Online publication date: Feb-2021
https://doi.org/10.1109/TCAD.2020.2994265
Chen JNelissen GHuang WYang MBrandenburg BBletsas KLiu CRichard PRidouard FAudsley NRajkumar RNiz DBrüggen G(2019)Many suspensions, many problemsReal-Time Systems10.1007/s11241-018-9316-955:1(144-207)Online publication date: 1-Jan-2019
https://dl.acm.org/doi/10.1007/s11241-018-9316-9
Sun YDi Natale MHaddad HWainwright RChbeir R(2018)Assessing the pessimism of current multicore global fixed-priority schedulability analysisProceedings of the 33rd Annual ACM Symposium on Applied Computing10.1145/3167132.3167195(575-583)Online publication date: 9-Apr-2018
https://dl.acm.org/doi/10.1145/3167132.3167195
Zhou QLi GLi JDeng C(2018)Execution-Efficient Response Time Analysis on Global Multiprocessor PlatformsIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2018.284376329:12(2785-2797)Online publication date: 1-Dec-2018
https://doi.org/10.1109/TPDS.2018.2843763
Ueter Nvon der Bruggen GChen JLi JAgrawal K(2018)Reservation-Based Federated Scheduling for Parallel Real-Time Tasks2018 IEEE Real-Time Systems Symposium (RTSS)10.1109/RTSS.2018.00061(482-494)Online publication date: Dec-2018
https://doi.org/10.1109/RTSS.2018.00061
Biondi ASun Y(2018)On the ineffectiveness of 1/m-based interference bounds in the analysis of global EDF and FIFO schedulingReal-Time Systems10.1007/s11241-018-9303-154:3(515-536)Online publication date: 1-Jul-2018
https://dl.acm.org/doi/10.1007/s11241-018-9303-1
Zhou QLi GLi J(2017)Improved Carry-in Workload Estimation for Global Multiprocessor SchedulingIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2017.267919528:9(2527-2538)Online publication date: 1-Sep-2017
https://doi.org/10.1109/TPDS.2017.2679195
Chen Jvon der Bruggen GHuang WLiu C(2017)State of the art for scheduling and analyzing self-suspending sporadic real-time tasks2017 IEEE 23rd International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA)10.1109/RTCSA.2017.8046321(1-10)Online publication date: Aug-2017
https://doi.org/10.1109/RTCSA.2017.8046321
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

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

Figures

Tables

Media

View Table of Conten