On Computing Exact WCRT for DAG Tasks†

Most current real-time parallel applications can be modeled as a directed acyclic graph (DAG) task. Existing worst-case response time (WCRT) bounds (e.g., Graham's bound) derived for DAGs may be very pessimistic. No one precisely knows the gap between the WCRT bound and the actual WCRT. In this paper, we aim to derive the exact WCRT of a DAG task under the list scheduling upon multi-core platforms. We encode the WCRT analysis problem into a satisfaction modular theoretical (SMT) formulation based on insights into the list scheduling algorithm, and prove that our SMT program can solve the WCRT precisely, providing an accurate baseline to measure the tightness of the existing WCRT bounds. Experiments show that our method significantly improves the tightness of the WCRT bound, and is practically quite efficient, e.g., it can analyze DAGs with more than 40 vertices in a few seconds.

[1]  Geoffrey Nelissen,et al.  Response-Time Analysis of Limited-Preemptive Parallel DAG Tasks Under Global Scheduling , 2019, ECRTS.

[2]  Eduardo Tovar,et al.  An exact schedulability test for global FP using state space pruning , 2015, RTNS.

[3]  Weichen Liu,et al.  Response Time Bounds for Typed DAG Parallel Tasks on Heterogeneous Multi-Cores , 2018, IEEE Transactions on Parallel and Distributed Systems.

[4]  Sebastian Stiller,et al.  Feasibility Analysis in the Sporadic DAG Task Model , 2013, 2013 25th Euromicro Conference on Real-Time Systems.

[5]  Wang Yi,et al.  Real-Time Scheduling and Analysis of OpenMP Task Systems with Tied Tasks , 2017, 2017 IEEE Real-Time Systems Symposium (RTSS).

[6]  Frédéric Fauberteau,et al.  Global EDF scheduling of directed acyclic graphs on multiprocessor systems , 2013, RTNS '13.

[7]  Chenyang Lu,et al.  Analysis of Federated and Global Scheduling for Parallel Real-Time Tasks , 2014, 2014 26th Euromicro Conference on Real-Time Systems.

[8]  Chenyang Lu,et al.  Parallel Real-Time Scheduling of DAGs , 2014, IEEE Transactions on Parallel and Distributed Systems.

[9]  Eduardo Quiñones,et al.  OpenMP and timing predictability: A possible union? , 2015, 2015 Design, Automation & Test in Europe Conference & Exhibition (DATE).

[10]  Jian-Jia Chen,et al.  Reservation-Based Federated Scheduling for Parallel Real-Time Tasks , 2017, 2018 IEEE Real-Time Systems Symposium (RTSS).

[11]  Eduardo Quiñones,et al.  Timing characterization of OpenMP4 tasking model , 2015, 2015 International Conference on Compilers, Architecture and Synthesis for Embedded Systems (CASES).

[12]  Giorgio C. Buttazzo,et al.  Partitioned Fixed-Priority Scheduling of Parallel Tasks Without Preemptions , 2018, 2018 IEEE Real-Time Systems Symposium (RTSS).

[13]  José Carlos Fonseca,et al.  Response time analysis of sporadic DAG tasks under partitioned scheduling , 2016, 2016 11th IEEE Symposium on Industrial Embedded Systems (SIES).

[14]  Mitra Nasri,et al.  An Exact Schedulability Test for Non-Preemptive Self-Suspending Real-Time Tasks , 2019, 2019 Design, Automation & Test in Europe Conference & Exhibition (DATE).

[15]  Hui Zhang,et al.  Schedulability Analysis and Symbolic Verification Method for Heterogeneous Multicore Real-Time Systems , 2017 .

[16]  Andrea Parri,et al.  Response time analysis for G-EDF and G-DM scheduling of sporadic DAG-tasks with arbitrary deadline , 2015, RTNS.

[17]  Chenyang Lu,et al.  Outstanding Paper Award: Analysis of Global EDF for Parallel Tasks , 2013, 2013 25th Euromicro Conference on Real-Time Systems.

[18]  Eduardo Quiñones,et al.  Response-time analysis of DAG tasks under fixed priority scheduling with limited preemptions , 2016, 2016 Design, Automation & Test in Europe Conference & Exhibition (DATE).

[19]  Sanjoy K. Baruah,et al.  A Generalized Parallel Task Model for Recurrent Real-time Processes , 2012, 2012 IEEE 33rd Real-Time Systems Symposium.

[20]  Nan Guan,et al.  Calculating Response-Time Bounds for OpenMP Task Systems with Conditional Branches , 2019, 2019 IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS).

[21]  Wang Yi,et al.  Semi-Federated Scheduling of Parallel Real-Time Tasks on Multiprocessors , 2017, 2017 IEEE Real-Time Systems Symposium (RTSS).

[22]  Nan Guan,et al.  Real-Time Scheduling and Analysis of Synchronous OpenMP Task Systems with Tied Tasks , 2019, 2019 56th ACM/IEEE Design Automation Conference (DAC).

[23]  Wang Yi,et al.  A Capacity Augmentation Bound for Real-Time Constrained-Deadline Parallel Tasks Under GEDF , 2018, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[24]  Ronald L. Graham,et al.  Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

[25]  Sanjoy K. Baruah.  The federated scheduling of constrained-deadline sporadic DAG task systems , 2015, 2015 Design, Automation & Test in Europe Conference & Exhibition (DATE).

[26]  Eduardo Quiñones,et al.  Response-Time Analysis of DAG Tasks Supporting Heterogeneous Computing , 2018, 2018 55th ACM/ESDA/IEEE Design Automation Conference (DAC).

[27]  Serge Midonnet,et al.  A Stretching Algorithm for Parallel Real-time DAG Tasks on Multiprocessor Systems , 2014, RTNS.