Capacity Sharing and Stealing in Dynamic Server-based Real-Time Systems

This paper proposes a dynamic scheduler that supports the coexistence of guaranteed and non-guaranteed bandwidth servers to efficiently handle soft-tasks' overloads by making additional capacity available from two sources: (i) residual capacity allocated but unused when jobs complete in less than their budgeted execution time; (ii) stealing capacity from inactive non-isolated servers used to schedule best-effort jobs. The effectiveness of the proposed approach in reducing the mean tardiness of periodic jobs is demonstrated through extensive simulations. The achieved results become even more significant when tasks' computation times have a large variance.

[1]  Nuno Pereira,et al.  A few what-ifs on using statistical analysis of stochastic simulation runs to extract timeliness properties , 2004 .

[2]  Theodore P. Baker,et al.  Aperiodic servers in a deadline scheduling environment , 2005, Real-Time Systems.

[3]  Scott A. Brandt,et al.  Improving soft real-time performance through better slack reclaiming , 2005, 26th IEEE International Real-Time Systems Symposium (RTSS'05).

[4]  Sanjoy K. Baruah,et al.  Greedy reclamation of unused bandwidth in constant-bandwidth servers , 2000, Proceedings 12th Euromicro Conference on Real-Time Systems. Euromicro RTS 2000.

[5]  Marco Spuri,et al.  Efficient aperiodic service under earliest deadline scheduling , 1994, 1994 Proceedings Real-Time Systems Symposium.

[6]  Alan Burns,et al.  Multiple Servers and Capacity Sharing for Implementing Flexible Scheduling , 2004, Real-Time Systems.

[7]  Alan Burns,et al.  Scheduling slack time in fixed priority pre-emptive systems , 1993, 1993 Proceedings Real-Time Systems Symposium.

[8]  Luís Nogueira,et al.  Dynamic Adaptation of Stability Periods for Service Level Agreements , 2006, 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'06).

[9]  Giuseppe Lipari,et al.  IRIS: a new reclaiming algorithm for server-based real-time systems , 2004, Proceedings. RTAS 2004. 10th IEEE Real-Time and Embedded Technology and Applications Symposium, 2004..

[10]  Harrick M. Vin,et al.  A hierarchial CPU scheduler for multimedia operating systems , 1996, OSDI '96.

[11]  Jane W.-S. Liu,et al.  Scheduling real-time applications in an open environment , 1997, Proceedings Real-Time Systems Symposium.

[12]  Luís Nogueira,et al.  Capacity Sharing and Stealing in Server-based Real-Time Systems , 2005 .

[13]  James W. Layland,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[14]  Luís Nogueira,et al.  Dynamic QoS-aware coalition formation , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

[15]  Harrick M. Vin,et al.  A hierarchial CPU scheduler for multimedia operating systems , 1996, OSDI '96.

[16]  Giorgio C. Buttazzo,et al.  Integrating multimedia applications in hard real-time systems , 1998, Proceedings 19th IEEE Real-Time Systems Symposium (Cat. No.98CB36279).

[17]  Luís Nogueira,et al.  Iterative Refinement Approach for QOS-Aware Service Configuration , 2006, DIPES.

[18]  Krithi Ramamritham,et al.  Integrated scheduling of multimedia and hard real-time tasks , 1996, 17th IEEE Real-Time Systems Symposium.

[19]  Shuichi Oikawa,et al.  Resource kernels: a resource-centric approach to real-time and multimedia systems , 2001, Electronic Imaging.

[20]  Lui Sha,et al.  Capacity sharing for overrun control , 2000, Proceedings 21st IEEE Real-Time Systems Symposium.

[21]  Stefan M. Petters,et al.  Experimental evaluation of code properties for WCET analysis , 2003, RTSS 2003. 24th IEEE Real-Time Systems Symposium, 2003.

[22]  Alan Burns,et al.  Rewriting History to Exploit Gain Time , 2004, 25th IEEE International Real-Time Systems Symposium.

[23]  Robert I. Davis.  Approximate Slack Stealing Algorithms for Fixed Priority Pre-emptive Systems , 1993 .

[24]  Giorgio C. Buttazzo,et al.  Efficient reclaiming in reservation-based real-time systems with variable execution times , 2005, IEEE Transactions on Computers.

[25]  Luís Nogueira,et al.  Time-bounded distributed QoS-aware service configuration in heterogeneous cooperative environments , 2009, J. Parallel Distributed Comput..

[26]  John P. Lehoczky,et al.  An optimal algorithm for scheduling soft-aperiodic tasks in fixed-priority preemptive systems , 1992, [1992] Proceedings Real-Time Systems Symposium.

[27]  Peter Csaba Ölveczky,et al.  Formal Simulation and Analysis of the CASH Scheduling Algorithm in Real-Time Maude , 2006, FASE.