k2Q: A Quadratic-Form Response Time and Schedulability Analysis Framework for Utilization-Based Analysis

In this paper, we present a general response-time analysis and schedulability-test framework, called k2Q (k to Q). It provides automatic constructions of closed-form quadratic bounds or utilization bounds for a wide range of applications in real-time systems under fixed-priority scheduling. The key of the framework is a k-point schedulability test or a k-point response time analysis that is based on the utilizations and the execution times of k-1 higher-priority tasks. The natural condition of k2Q is a quadratic form for testing the schedulability or analyzing the response time. The response time analysis and the schedulability analysis provided by the framework can be viewed as a ``blackbox'' interface that can result in sufficient utilization-based analysis. Since the framework is independent from the task and platform models, it can be applied to a wide range of applications.

[1]  Sudarshan K. Dhall,et al.  On a Real-Time Scheduling Problem , 1978, Oper. Res..

[2]  Giuseppe Lipari,et al.  New Schedulability Tests for Real-Time Task Sets Scheduled by Deadline Monotonic on Multiprocessors , 2005, OPODIS.

[3]  Hiroaki Takada,et al.  Schedulability of Generalized Multiframe Task Sets with Static Priority Scheduling , 1997 .

[4]  Jian-Jia Chen,et al.  Evaluate and Compare Two Uitlization-Based Schedulability-Test Frameworks for Real-Time Systems , 2015, ArXiv.

[5]  Giorgio C. Buttazzo,et al.  Rate Monotonic Analysis: The Hyperbolic Bound , 2003, IEEE Trans. Computers.

[6]  John P. Lehoczky,et al.  The rate monotonic scheduling algorithm: exact characterization and average case behavior , 1989, [1989] Proceedings. Real-Time Systems Symposium.

[7]  James H. Anderson,et al.  Task Scheduling with Self-Suspensions in Soft Real-Time Multiprocessor Systems , 2009, 2009 30th IEEE Real-Time Systems Symposium.

[8]  Wang Yi,et al.  The Digraph Real-Time Task Model , 2011, 2011 17th IEEE Real-Time and Embedded Technology and Applications Symposium.

[9]  Wang Yi,et al.  Approximate Response Time Analysis of Real-Time Task Graphs , 2014, 2014 IEEE Real-Time Systems Symposium.

[10]  Giorgio C. Buttazzo,et al.  Schedulability analysis of periodic fixed priority systems , 2004, IEEE Transactions on Computers.

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

[12]  Sang Hyuk Son,et al.  New Strategies for Assigning Real-Time Tasks to Multiprocessor Systems , 1995, IEEE Trans. Computers.

[13]  Ching-Chih Han,et al.  A better polynomial-time schedulability test for real-time fixed-priority scheduling algorithms , 1997, Proceedings Real-Time Systems Symposium.

[14]  Andrea Parri,et al.  A Quadratic-Time Response Time Upper Bound with a Tightness Property , 2015, 2015 IEEE Real-Time Systems Symposium.

[15]  Theodore P. Baker,et al.  Multiprocessor EDF and deadline monotonic schedulability analysis , 2003, RTSS 2003. 24th IEEE Real-Time Systems Symposium, 2003.

[16]  Sanjoy K. Baruah,et al.  Generalized Multiframe Tasks , 1999, Real-Time Systems.

[17]  Aloysius Ka-Lau Mok,et al.  Fundamental design problems of distributed systems for the hard-real-time environment , 1983 .

[18]  Sanjoy K. Baruah,et al.  Static-priority scheduling on multiprocessors , 2001, Proceedings 22nd IEEE Real-Time Systems Symposium (RTSS 2001) (Cat. No.01PR1420).

[19]  Robert I. Davis,et al.  Quantifying the Sub-optimality of Uniprocessor Fixed Priority Pre-emptive Scheduling for Sporadic Tasksets with Arbitrary Deadlines , 2009 .

[20]  Sanjoy K. Baruah,et al.  Improved multiprocessor global schedulability analysis , 2010, Real-Time Systems.

[21]  Chenyang Lu,et al.  A utilization bound for aperiodic tasks and priority driven scheduling , 2004, IEEE Transactions on Computers.

[22]  Jian-Jia Chen,et al.  k2U: A General Framework from k-Point Effective Schedulability Analysis to Utilization-Based Tests , 2015, 2015 IEEE Real-Time Systems Symposium.

[23]  Cynthia A. Phillips,et al.  Optimal Time-Critical Scheduling via Resource Augmentation , 1997, STOC '97.

[24]  Tom Roseman.  Rate monotonic analysis , 1992, TRI-Ada '92.

[25]  Chenyang Lu,et al.  Analysis of Federated and Global Scheduling for Parallel Real-Time Tasks , 2014, 2014 26th Euromicro Conference on Real-Time Systems.

[26]  Enhanced utilization bounds for QoS management , 2004, IEEE Transactions on Computers.

[27]  David G. Luenberger,et al.  Linear and nonlinear programming , 1984 .

[28]  Wang Yi,et al.  New Response Time Bounds for Fixed Priority Multiprocessor Scheduling , 2009, 2009 30th IEEE Real-Time Systems Symposium.

[29]  Lothar Thiele,et al.  Approximate schedulability analysis , 2002, 23rd IEEE Real-Time Systems Symposium, 2002. RTSS 2002..

[30]  Theodore P. Baker,et al.  An Analysis of Fixed-Priority Schedulability on a Multiprocessor , 2006, Real-Time Systems.

[31]  Tei-Wei Kuo,et al.  Efficient Online Schedulability Tests for Real-Time Systems , 2003, IEEE Trans. Software Eng..

[32]  Alan Burns,et al.  Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems , 2010, Real-Time Systems.

[33]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[34]  Wang Yi,et al.  Hardness Results for Static Priority Real-Time Scheduling , 2012, 2012 24th Euromicro Conference on Real-Time Systems.

[35]  Sanjoy K. Baruah,et al.  Jitter concerns in periodic task systems , 1997, Proceedings Real-Time Systems Symposium.

[36]  Jian-Jia Chen,et al.  Bursty-Interference Analysis Techniques for Analyzing Complex Real-Time Task Models , 2014, 2014 IEEE Real-Time Systems Symposium.

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

[38]  Alan Burns,et al.  Efficient Exact Schedulability Tests for Fixed Priority Real-Time Systems , 2008, IEEE Transactions on Computers.

[39]  Sanjoy K. Baruah.  The Non-cyclic Recurring Real-Time Task Model , 2010, 2010 31st IEEE Real-Time Systems Symposium.

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

[41]  Robert I. Davis,et al.  Schedulability tests for tasks with Variable Rate-dependent Behaviour under fixed priority scheduling , 2014, 2014 IEEE 19th Real-Time and Embedded Technology and Applications Symposium (RTAS).

[42]  Sanjoy K. Baruah,et al.  A fully polynomial-time approximation scheme for feasibility analysis in static-priority systems with arbitrary relative deadlines , 2005, 17th Euromicro Conference on Real-Time Systems (ECRTS'05).

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