Adaptive Local Assignment Algorithm for Scheduling Soft-Aperiodic Tasks on Multiprocessors

With the emergence of multiprocessors, embedded systems are nowadays capable of handling diverse and complicated applications. Besides static workloads such as periodic tasks, dynamic workloads such as aperiodic tasks happen more frequently and become challenging to researchers to deal with. In this study, an effective scheduling approach for aperiodic tasks in multiprocessors is presented. An adaptive Local Assignment Algorithm with the integration of servers is introduced to schedule mixture systems of periodic and aperiodic tasks. Servers are dedicatedly preserved for aperiodic tasks at runtime. This scheduling scheme guarantees the schedulability of 100% without significantly increasing the time complexity. Simulation results show that the proposed mechanism effectively improves the responsiveness of aperiodic tasks while maintaining relatively low runtime overhead. In addition, it causes much fewer scheduler invocations in comparison with the existing algorithms.

[1]  Kiyofumi Tanaka,et al.  A Novel Task-to-Processor Assignment Approach for Optimal Multiprocessor Real-Time Scheduling , 2018, 2018 IEEE 12th International Symposium on Embedded Multicore/Many-core Systems-on-Chip (MCSoC).

[2]  Sanjoy K. Baruah,et al.  Proportionate progress: a notion of fairness in resource allocation , 1993, STOC '93.

[3]  Sanjoy K. Baruah,et al.  Priority-Driven Scheduling of Periodic Task Systems on Multiprocessors , 2003, Real-Time Systems.

[4]  Björn B. Brandenburg,et al.  Global Scheduling Not Required: Simple, Near-Optimal Multiprocessor Real-Time Scheduling with Semi-Partitioned Reservations , 2016, 2016 IEEE Real-Time Systems Symposium (RTSS).

[5]  Scott A. Brandt,et al.  DP-FAIR: A Simple Model for Understanding Optimal Multiprocessor Scheduling , 2010, 2010 22nd Euromicro Conference on Real-Time Systems.

[6]  Rami G. Melhem,et al.  Multiple-resource periodic scheduling problem: how much fairness is necessary? , 2003, RTSS 2003. 24th IEEE Real-Time Systems Symposium, 2003.

[7]  Scott A. Brandt,et al.  RUN: Optimal Multiprocessor Real-Time Scheduling via Reduction to Uniprocessor , 2011, 2011 IEEE 32nd Real-Time Systems Symposium.

[8]  Alan Burns,et al.  Partitioned EDF scheduling for multiprocessors using a C=D task splitting scheme , 2011, Real-Time Systems.

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

[10]  James H. Anderson,et al.  On the Scalability of Real-Time Scheduling Algorithms on Multicore Platforms: A Case Study , 2008, 2008 Real-Time Systems Symposium.

[11]  Binoy Ravindran,et al.  An Optimal Real-Time Scheduling Algorithm for Multiprocessors , 2006, 2006 27th IEEE International Real-Time Systems Symposium (RTSS'06).

[12]  James H. Anderson,et al.  Integrating a periodic and recurrent tasks on fair-scheduled multiprocessors , 2002, Proceedings 14th Euromicro Conference on Real-Time Systems. Euromicro RTS 2002.