A Quadratic-Time Response Time Upper Bound with a Tightness Property

The response time analysis (RTA) is one of the fundamental tools used to guarantee the schedulability of sets of real-time tasks scheduled by Fixed Priorities. Also, several analysis methods inspired by RTA have been successfully developed to address more sophisticated execution platforms (distributed systems, multiprocessor) and application models (DAGs). The major issue with RTA is its time complexity, which is NP-hard. Such a complexity shows up when the task set has high utilization and RTA needs to check all jobs until the first idle instant. In this paper, we propose a continuous upper bound to the response time with quadratic time complexity in the number of tasks. Such an upper bound is demonstrated to be tighter than previously proposed ones with linear time complexity. In addition, with two tasks only, we prove that the proposed bound is the tightest continuous function upper bounding the exact response time of sets of tasks with full utilization. Whether or not this property holds with more than two tasks is still an open problem.

[1]  Sanjoy K. Baruah,et al.  A Response-Time Bound in Fixed-Priority Scheduling with Arbitrary Deadlines , 2009, IEEE Transactions on Computers.

[2]  Alan Burns,et al.  Response Time Upper Bounds for Fixed Priority Real-Time Systems , 2008, 2008 Real-Time Systems Symposium.

[3]  John A. Clark,et al.  Holistic schedulability analysis for distributed hard real-time systems , 1994, Microprocess. Microprogramming.

[4]  Nathan Fisher,et al.  The Fully Polynomial-Time Approximation Scheme for Feasibility Analysis in Static-Priority Systems with Arbitrary Relative Deadlines Revisited , 2010 .

[5]  Robert I. Davis,et al.  Cache Related Pre-emption Delay Aware Response Time Analysis for Fixed Priority Pre-emptive Systems , 2011, RTSS.

[6]  Richard West,et al.  Mutable Protection Domains: Towards a Component-Based System for Dependable and Predictable Computing , 2007, RTSS 2007.

[7]  Alberto L. Sangiovanni-Vincentelli,et al.  Optimization of task allocation and priority assignment in hard real-time distributed systems , 2012, TECS.

[8]  Jan Åke Jönsson,et al.  Some Insights on Fixed-Priority Preemptive Non-Partitioned Multiprocessor Scheduling , 2000, RTSS 2000.

[9]  Nicole Megow,et al.  Polynomial-Time Exact Schedulability Tests for Harmonic Real-Time Tasks , 2013, 2013 IEEE 34th Real-Time Systems Symposium.

[10]  Johan J. Lukkien,et al.  Exploiting harmonic periods to improve linearly approximated response-time upper bounds , 2010, 2010 IEEE 15th Conference on Emerging Technologies & Factory Automation (ETFA 2010).

[11]  Enrico Bini,et al.  The Quadratic Utilization Upper Bound for Arbitrary Deadline Real-Time Tasks , 2015, IEEE Transactions on Computers.

[12]  Sanjoy K. Baruah,et al.  Efficient computation of response time bounds for preemptive uniprocessor deadline monotonic scheduling , 2011, Real-Time Systems.

[13]  Sanjoy K. Baruah,et al.  A fully polynomial-time approximation scheme for feasibility analysis in static-priority systems with bounded relative deadlines , 2006, J. Embed. Comput..

[14]  Mikael Sjödin,et al.  Improved response-time analysis calculations , 1998, Proceedings 19th IEEE Real-Time Systems Symposium (Cat. No.98CB36279).

[15]  Alan Burns,et al.  An extendible approach for analyzing fixed priority hard real-time tasks , 1994, Real-Time Systems.

[16]  Andy J. Wellings,et al.  Adding instruction cache effect to schedulability analysis of preemptive real-time systems , 1996, Proceedings Real-Time Technology and Applications.

[17]  Lui Sha,et al.  Budgeted generalized rate monotonic analysis for the partitioned, yet globally scheduled uniprocessor model , 2015, 21st IEEE Real-Time and Embedded Technology and Applications Symposium.

[18]  W. Tindell.  AN EXTENDIBLE APPROACH FOR ANALYSING FIXED PRIORITY HARD REAL-TIME TASKS , 1994 .

[19]  Frank Slomka,et al.  An event stream driven approximation for the analysis of real-time systems , 2004, Proceedings. 16th Euromicro Conference on Real-Time Systems, 2004. ECRTS 2004..

[20]  Pascal Richard,et al.  An fptas for Response Time Analysis of Fixed Priority Real-Time Tasks with Resource Augmentation , 2015, IEEE Transactions on Computers.

[21]  Alan Burns,et al.  Applying new scheduling theory to static priority pre-emptive scheduling , 1993, Softw. Eng. J..

[22]  Friedrich Eisenbrand,et al.  Static-Priority Real-Time Scheduling: Response Time Computation Is NP-Hard , 2008, 2008 Real-Time Systems Symposium.

[23]  Baruah Sanjoy,et al.  Partitioned Scheduling of Sporadic Task Systems: an ILP-based approach , 2008 .

[24]  J.C. Palencia Gutierrez,et al.  On the schedulability analysis for distributed hard real-time systems , 1997, Proceedings Ninth Euromicro Workshop on Real Time Systems.

[25]  Chung Laung Liu,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[26]  John P. Lehoczky,et al.  Fixed priority scheduling of periodic task sets with arbitrary deadlines , 1990, [1990] Proceedings 11th Real-Time Systems Symposium.

[27]  Paul K. Harten.  Response times in level-structured systems , 1987, TOCS.

[28]  Enrico Bini,et al.  Efficient computation of response time bounds under fixed-priority scheduling , 2007 .

[29]  Jian-Jia Chen,et al.  k2Q: A Quadratic-Form Response Time and Schedulability Analysis Framework for Utilization-Based Analysis , 2016, 2016 IEEE Real-Time Systems Symposium (RTSS).

[30]  Mathai Joseph,et al.  Finding Response Times in a Real-Time System , 1986, Comput. J..

[31]  Michele Cirinei,et al.  Response-Time Analysis for Globally Scheduled Symmetric Multiprocessor Platforms , 2007, 28th IEEE International Real-Time Systems Symposium (RTSS 2007).