Inserting Placeholder Slack to Improve Run-Time Scheduling of Non-preemptible Real-Time Tasks in Heterogeneous Systems

This paper proposes a method to pre-schedule slack windows in a non-preemptive heterogeneous system that executes a mix of hard-periodic and soft-aperiodic tasks. The goal is to improve the acceptance rate and waiting time of aperiodic tasks without violating periodic task deadlines. The method creates an offline schedule of periodic tasks and pre-scheduled slack that models the estimated characteristics of the aperiodic tasks. At runtime, the local schedulers use this offline schedule to guide their decisions to adjust periodic task instance start times and to schedule aperiodic tasks arriving from the global scheduler. We evaluate several dynamic local schedulers. Our results show that token-based dynamic schedulers are particularly effective for reducing waiting time and increasing acceptance rate when attempting to maintain aperiodic task execution fairness.

[1]  Robert G. Gallager,et al.  Discrete Stochastic Processes , 1995 .

[2]  Ashok K. Agrawala,et al.  Scheduling aperiodic and sporadic tasks in hard real-time systems , 1997 .

[3]  Marco Spuri,et al.  Scheduling aperiodic tasks in dynamic priority systems , 1996, Real-Time Systems.

[4]  Paul Muhlethaler,et al.  Optimality and non-preemptive real-time scheduling revisited , 1995 .

[5]  Parameswaran Ramanathan,et al.  Combining Hard Periodic and Soft Aperiodic Real-Time Task Scheduling on Heterogeneous Compute Resources , 2011, 2011 International Conference on Parallel Processing.

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

[7]  Jiafu Wan,et al.  A Two-level Hierarchical Scheduling Scheme for Hybrid Tasks in Priority-Based Preemptive Systems , 2008, 2008 IEEE International Conference on Networking, Sensing and Control.

[8]  Gerhard Fohler,et al.  Joint scheduling of distributed complex periodic and hard aperiodic tasks in statically scheduled systems , 1995, Proceedings 16th IEEE Real-Time Systems Symposium.

[9]  Hai Jin,et al.  A hybrid scheduling scheme for hard, soft and non-real-time tasks , 2006, Ninth IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC'06).

[10]  Moonju Park,et al.  A Combined Approach to Improve the Response Time of Soft Aperiodic Tasks , 2009, 2009 Software Technologies for Future Dependable Distributed Systems.

[11]  Marco Spuri,et al.  Preemptive and Non-Preemptive Real-Time UniProcessor Scheduling , 1996 .

[12]  Maryline Chetto,et al.  Some Results of the Earliest Deadline Scheduling Algorithm , 1989, IEEE Transactions on Software Engineering.

[13]  Joël Goossens,et al.  Limitation of the hyper-period in real-time periodic task set generation , 2001 .

[14]  Charles U. Martel,et al.  On non-preemptive scheduling of period and sporadic tasks , 1991, [1991] Proceedings Twelfth Real-Time Systems Symposium.

[15]  Gerhard Fohler,et al.  Online Admission of Non-Preemptive Aperiodic Tasks in Offline Schedules , 2010 .