Improved Schedulability Tests for Global Fixed-Priority Scheduling

In this paper, global fixed-priority multiprocessor scheduling of a set of sporadic real-time tasks is addressed. First, we propose a priority-assignment policy, called ISM-US, for implicit-deadline task systems. Policy ISM-US assigns slack monotonic priorities to a subset of the given task set and other tasks are assigned the highest fixed priority. We prove that the schedulability utilization bound for policy ISM-US is higher than the corresponding bound for any other existing schedulability test for implicit-deadline sporadic task systems. Second, we propose improvements to two state-of-the-art iterative schedulability tests for constrained-deadline sporadic task systems. Our improved schedulability tests, called HP-RTA-LC and HP-DA-LC, are based on a hybrid-priority assignment policy and are shown to dominate the two existing state-of-the-art tests, RTA-LC and DA-LC, respectively.

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

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

[3]  Sanjoy K. Baruah,et al.  The partitioned scheduling of sporadic tasks according to static-priorities , 2006, 18th Euromicro Conference on Real-Time Systems (ECRTS'06).

[4]  Björn Andersson,et al.  The utilization bounds of partitioned and pfair static-priority scheduling on multiprocessors are 50% , 2003, 15th Euromicro Conference on Real-Time Systems, 2003. Proceedings..

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

[6]  Neil C. Audsley,et al.  On priority assignment in fixed priority scheduling , 2001, Inf. Process. Lett..

[7]  Jane W.-S. Liu,et al.  Validating timing constraints in multiprocessor and distributed real-time systems , 1994, 14th International Conference on Distributed Computing Systems.

[8]  S. Vestal.  Preemptive Scheduling of Multi-criticality Systems with Varying Degrees of Execution Time Assurance , 2007, RTSS 2007.

[9]  Giorgio C. Buttazzo,et al.  Measuring the Performance of Schedulability Tests , 2005, Real-Time Systems.

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

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

[12]  Alan Burns,et al.  Priority Assignment for Global Fixed Priority Pre-Emptive Scheduling in Multiprocessor Real-Time Systems , 2009, 2009 30th IEEE Real-Time Systems Symposium.

[13]  Giuseppe Lipari,et al.  Schedulability Analysis of Global Scheduling Algorithms on Multiprocessor Platforms , 2009, IEEE Transactions on Parallel and Distributed Systems.

[14]  Sanjoy K. Baruah.  Techniques for Multiprocessor Global Schedulability Analysis , 2007, 28th IEEE International Real-Time Systems Symposium (RTSS 2007).

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

[16]  Dong-Ik Oh,et al.  Utilization Bounds for N-Processor Rate Monotone Scheduling with Static Processor Assignment , 1998, Real-Time Systems.

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

[18]  Xue Liu,et al.  Integrating Adaptive Components: An Emerging Challenge in Performance-Adaptive Systems and a Server Farm Case-Study , 2007, 28th IEEE International Real-Time Systems Symposium (RTSS 2007).

[19]  Björn Andersson,et al.  Global Static-Priority Preemptive Multiprocessor Scheduling with Utilization Bound 38% , 2008, OPODIS.

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