research-article

A Response-Time Bound in Fixed-Priority Scheduling with Arbitrary Deadlines

Authors:

Enrico Bini,

Thi Huyen Châu Nguyen,

Pascal Richard,

Sanjoy K. BaruahAuthors Info & Claims

IEEE Transactions on Computers, Volume 58, Issue 2

Pages 279 - 286

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

Published: 01 February 2009 Publication History

Publisher Site

Abstract

Since worst case response times must be determined repeatedly during the interactive design of real-time application systems, repeated exact computation of such response times would slow down the design process considerably. In this research, we identify three desirable properties of estimates of the exact response times: continuity with respect to system parameters, efficient computability, and approximability. We derive a technique possessing these properties for estimating the worst-case response time of sporadic task systems that are scheduled using fixed priorities upon a preemptive uniprocessor.

Cited By

View all

Zhao YZeng HSangiovanni-Vincentelli ASztipanovits JZhu Q(2019)Optimization techniques for time-critical cyber-physical systemsProceedings of the Workshop on Design Automation for CPS and IoT10.1145/3313151.3313168(41-50)Online publication date: 15-Apr-2019
https://dl.acm.org/doi/10.1145/3313151.3313168
Peng CZeng H(2018)Response time analysis of digraph real-time tasks scheduled with static priorityReal-Time Systems10.1007/s11241-017-9290-754:1(91-131)Online publication date: 1-Jan-2018
https://dl.acm.org/doi/10.1007/s11241-017-9290-7
Grass WNguyen T(2018)Improved response-time bounds in fixed priority scheduling with arbitrary deadlinesReal-Time Systems10.1007/s11241-017-9282-754:1(1-30)Online publication date: 1-Jan-2018
https://dl.acm.org/doi/10.1007/s11241-017-9282-7
Show More Cited By

Index Terms

A Response-Time Bound in Fixed-Priority Scheduling with Arbitrary Deadlines
1. Mathematics of computing
  1. Mathematical analysis
    1. Functional analysis
      1. Approximation
2. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis
      1. Scheduling algorithms
    2. Online algorithms
      1. Online learning algorithms
        Scheduling algorithms
  2. Theory and algorithms for application domains
    1. Machine learning theory
      1. Reinforcement learning
        Sequential decision making

Recommendations

Modified Rate-Monotonic Algorithm for Scheduling Periodic Jobs with Deferred Deadlines

The deadline of a request is the time instant at which its execution must complete. The deadline of the request in any period of a job with deferred deadline is some time instant after the end of the period. The authors describe a semi-static priority-...
Schedulability Analysis of Global Scheduling Algorithms on Multiprocessor Platforms

Research on real-time scheduling algorithms for multiprocessor systems is a hot topic, due to the recent popularity of multicore hardware platforms. When executing applications with dynamic requirements on symmetric multiprocessor platforms, a ...
Multiprocessor Scheduling of Unit-Time Jobs with Arbitrary Release Times and Deadlines

We present a polynomial time algorithm for constructing an optimal schedule, if a feasible schedule exists, for tthe following multimachine scheduling problem. There are n unit-time jobs, with arbitrary release times and deadlines, and m identical ...

Comments

Information & Contributors

Information

Published In

cover image IEEE Transactions on Computers

IEEE Transactions on Computers Volume 58, Issue 2

February 2009

144 pages

ISSN:0018-9340

Issue’s Table of Contents

Publisher

IEEE Computer Society

United States

Publication History

Published: 01 February 2009

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

19
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

View all

Zhao YZeng HSangiovanni-Vincentelli ASztipanovits JZhu Q(2019)Optimization techniques for time-critical cyber-physical systemsProceedings of the Workshop on Design Automation for CPS and IoT10.1145/3313151.3313168(41-50)Online publication date: 15-Apr-2019
https://dl.acm.org/doi/10.1145/3313151.3313168
Peng CZeng H(2018)Response time analysis of digraph real-time tasks scheduled with static priorityReal-Time Systems10.1007/s11241-017-9290-754:1(91-131)Online publication date: 1-Jan-2018
https://dl.acm.org/doi/10.1007/s11241-017-9290-7
Grass WNguyen T(2018)Improved response-time bounds in fixed priority scheduling with arbitrary deadlinesReal-Time Systems10.1007/s11241-017-9282-754:1(1-30)Online publication date: 1-Jan-2018
https://dl.acm.org/doi/10.1007/s11241-017-9282-7
Honorat ATran HBesnard LGautier TTalpin JBouakaz ABini EPagetti C(2017)ADFGProceedings of the 25th International Conference on Real-Time Networks and Systems10.1145/3139258.3139267(158-167)Online publication date: 4-Oct-2017
https://dl.acm.org/doi/10.1145/3139258.3139267
Kim S(2017)Efficient exact Boolean schedulability tests for fixed priority preemption threshold schedulingJournal of Systems and Software10.1016/j.jss.2017.09.008134:C(153-169)Online publication date: 1-Dec-2017
https://dl.acm.org/doi/10.1016/j.jss.2017.09.008
(2017)Exact speedup factors for linear-time schedulability tests for fixed-priority preemptive and non-preemptive schedulingInformation Processing Letters10.1016/j.ipl.2016.08.001117:C(1-5)Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.1016/j.ipl.2016.08.001
Niyizamwiyitira CLundberg LChbeir RManolopoulos YMammana VModena ETraina ASalviano OBadr YAndres F(2015)Period assignment in real-time scheduling of multiple virtual machinesProceedings of the 7th International Conference on Management of computational and collective intElligence in Digital EcoSystems10.1145/2857218.2857262(180-187)Online publication date: 25-Oct-2015
https://dl.acm.org/doi/10.1145/2857218.2857262
Huang WChen JForget J(2015)Response time bounds for sporadic arbitrary-deadline tasks under global fixed-priority scheduling on multiprocessorsProceedings of the 23rd International Conference on Real Time and Networks Systems10.1145/2834848.2834849(215-224)Online publication date: 4-Nov-2015
https://dl.acm.org/doi/10.1145/2834848.2834849
Thi Huyen Chau Nguyen Richard PGrolleau E(2015)An fptas for Response Time Analysis of Fixed Priority Real-Time Tasks with Resource AugmentationIEEE Transactions on Computers10.1109/TC.2014.234617864:7(1805-1818)Online publication date: 1-Jul-2015
https://dl.acm.org/doi/10.1109/TC.2014.2346178
Bini E(2015)The Quadratic Utilization Upper Bound for Arbitrary Deadline Real-Time TasksIEEE Transactions on Computers10.1109/TC.2013.20964:2(593-599)Online publication date: 12-Jan-2015
https://dl.acm.org/doi/10.1109/TC.2013.209
Show More Cited By

Abstract

Cited By

Index Terms

Recommendations

Modified Rate-Monotonic Algorithm for Scheduling Periodic Jobs with Deferred Deadlines

Schedulability Analysis of Global Scheduling Algorithms on Multiprocessor Platforms

Multiprocessor Scheduling of Unit-Time Jobs with Arbitrary Release Times and Deadlines

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations