Date: 2020. 04.10 (Fri) 15:00

Locate: EB5. 533 and Zoom

Presenter: Sihyeong Park

Title: Tightening Contention Delays While Scheduling Parallel Applications on Multi-core Architectures

Author: Benjamin Rouxel, Steven  Derrien, Isabelle  Puaut

Abstract: Multi-core systems are increasingly interesting candidates for executing parallel real-time applications, in avionic, space or automotive industries, as they provide both computing capabilities and power efficiency. However, ensuring that timing constraints are met on such platforms is challenging, because some hardware resources are shared between cores.

Assuming worst-case contentions when analyzing the schedulability of applications may result in systems mistakenly declared unschedulable, although the worst-case level of contentions can never occur in practice. In this paper, we present two contention-aware scheduling strategies that produce a time-triggered schedule of the application’s tasks. Based on knowledge of the application’s structure, our scheduling strategies precisely estimate the effective contentions, in order to minimize the overall makespan of the schedule. An Integer Linear Programming (ILP) solution of the scheduling problem is presented, as well as a heuristic solution that generates schedules very close to ones of the ILP (5% longer on average), with a much lower time complexity. Our heuristic improves by 19% the overall makespan of the resulting schedules compared to a worst-case contention baseline.

Link: https://dl.acm.org/doi/abs/10.1145/3126496

Article source: //eslab.cnu.ac.kr/en/Mobile/186-Tightening-Contention-Delays-While-Scheduling-Parallel-Applications-on-Multi-core-Architectures.html