Type-Aware Federated Scheduling for Typed DAG Tasks on Heterogeneous Multicore Platforms

Abstract

To utilize the performance benefits of heterogeneous multicore platforms in real-time systems, we need task models that expose the parallelism and heterogeneity of the workload, such as typed DAG tasks, as well as scheduling algorithms that effectively exploit this information. In this paper, we introduce type-aware federated scheduling algorithms for sporadic typed DAG tasks with implicit deadlines running on a heterogeneous multicore platform with two different types of cores. In type-aware federated scheduling, a task can be executed in one of the three strategies: Exclusive Allocation, Semi-Exclusive Allocation, and Sequential and Share. In Exclusive Allocation, clusters of cores of both core types are exclusively allocated to tasks, while cores of only one type are exclusively allocated to tasks in Semi-Exclusive Allocation. The workload of the other type from tasks in Semi-Exclusive Allocation and the workload from tasks in Sequential and Share share the cores that are not exclusively allocated to any task. We prove that our type-aware federated scheduling algorithm has a capacity augmentation bound of 7.25. We also show that no constant capacity augmentation bound can be obtained without Semi-Exclusive Allocation. Compared to the state of the art, the type-aware federated scheduling algorithm achieves better schedulability, especially for task sets with skewed workload.

Bounding the Response Time of DAG Tasks Using Long Paths

“…The second direction is to change the computing model of Graham's bound (i.e., the identical multi-core platform). Graham's bound has been adapted to uniform [14], heterogeneous [15], [26], [27] and unrelated [28] multi-core platforms. The third direction is to change the scheduling model of Graham's bound (i.e., the work-conserving scheduler).…”