Combining Hard Periodic and Soft Aperiodic Real-Time Task Scheduling on Heterogeneous Compute Resources

Effectively scheduling tasks on heterogeneous resources is critical to maximizing the overall benefit of those resources in system-on-a-chip architectures. In this paper we focus on scheduling soft a periodic tasks alongside periodic tasks with hard deadline constraints on heterogeneous real-time systems. We introduce a method to improve a periodic task responsiveness without breaking periodic task deadline guarantees, by first scheduling periodic tasks offline, then dynamically scheduling a periodic tasks in the remaining resource slack time. Experimental results indicate that the quality of a periodic task scheduling depends highly on the slack distribution within and across resources after periodic task scheduling, and on the flexibility of the a periodic task scheduler to rearrange these compute slacks to accommodate incoming a periodic tasks.

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

[2]  Jesús Labarta,et al.  An Efficient Scheme to Allocate Soft-Aperiodic Tasks in Multiprocessor Hard Real-Time Systems , 2002, PDPTA.

[3]  Sanjoy K. Baruah,et al.  Task assignment on uniform heterogeneous multiprocessors , 2005, 17th Euromicro Conference on Real-Time Systems (ECRTS'05).

[4]  Parameswaran Ramanathan,et al.  Dynamic priority scheduling of periodic and aperiodic tasks in hard real-time systems , 2005, Real-Time Systems.

[5]  Giorgio C. Buttazzo,et al.  Optimal Deadline Assignment for Scheduling Soft Aperiodic Tasks in Hard Real-Time Environments , 1999, IEEE Trans. Computers.

[6]  Tong Li,et al.  Operating system support for overlapping-ISA heterogeneous multi-core architectures , 2010, HPCA - 16 2010 The Sixteenth International Symposium on High-Performance Computer Architecture.

[7]  Ladislau Bölöni,et al.  A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems , 2001, J. Parallel Distributed Comput..

[8]  Jane W.-S. Liu,et al.  Algorithms and optimality of scheduling soft aperiodic requests in fixed-priority preemptive systems , 2004, Real-Time Systems.

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

[10]  Norman P. Jouppi,et al.  Heterogeneous chip multiprocessors , 2005, Computer.

[11]  Lui Sha,et al.  Aperiodic task scheduling for Hard-Real-Time systems , 2006, Real-Time Systems.

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

[13]  A. Crespo,et al.  Soft aperiodic task scheduling on hard real-time multiprocessor systems , 1999, Proceedings Sixth International Conference on Real-Time Computing Systems and Applications. RTCSA'99 (Cat. No.PR00306).

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

[15]  Parameswaran Ramanathan,et al.  Dynamic Binding and Scheduling of Firm-Deadline Tasks on Heterogeneous Compute Resources , 2010, 2010 IEEE 16th International Conference on Embedded and Real-Time Computing Systems and Applications.

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

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

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

[19]  Hongyi Zhou,et al.  Dynamic Scheduling of Hard Real-Time Tasks and Real-Time Threads , 1992, IEEE Trans. Software Eng..

[20]  Norman P. Jouppi,et al.  Core architecture optimization for heterogeneous chip multiprocessors , 2006, 2006 International Conference on Parallel Architectures and Compilation Techniques (PACT).

[21]  Shinpei 加藤 真平 Kato REAL-TIME SCHEDULING OF PERIODIC AND APERIODIC TASKS ON MULTIPROCESSOR SYSTEMS , 2008 .

[22]  John P. Lehoczky,et al.  Algorithms for scheduling hard aperiodic tasks in fixed-priority systems using slack stealing , 1994, 1994 Proceedings Real-Time Systems Symposium.

[23]  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.

[24]  Ismael Ripoll,et al.  An Optimal Algorithm for Scheduling Soft Aperiodic Tasks in Dynamic-Priority Preemptive Systems , 1997, IEEE Trans. Software Eng..

[25]  John P. Lehoczky,et al.  On-line scheduling of hard deadline aperiodic tasks in fixed-priority systems , 1993, 1993 Proceedings Real-Time Systems Symposium.

[26]  Amar Shan,et al.  Heterogeneous processing: a strategy for augmenting moore's law , 2006 .

[27]  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.

[28]  John A. Stankovic,et al.  Applicability of simulated annealing methods to real-time scheduling and jitter control , 1995, Proceedings 16th IEEE Real-Time Systems Symposium.

[29]  S. Baruah,et al.  Task partitioning upon heterogeneous multiprocessor platforms , 2004, Proceedings. RTAS 2004. 10th IEEE Real-Time and Embedded Technology and Applications Symposium, 2004..

[30]  Kang G. Shin,et al.  Combined Task and Message Scheduling in Distributed Real-Time Systems , 1999, IEEE Trans. Parallel Distributed Syst..

[31]  Jay K. Strosnider,et al.  ENHANCED APERIODIC RESPONSIVENESS IN HARD REAL-TIME ENVIRONMENTS. , 1987, RTSS 1987.