Departmental Papers (CIS)

Date of this Version

4-2019

Document Type

Conference Paper

Comments

IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS 2019), Montreal, Canada, April 2019

Abstract

This paper presents CaM, a holistic cache and memory bandwidth resource allocation strategy for multicore real-time systems. CaM is designed for partitioned scheduling, where tasks are mapped onto cores, and the shared cache and memory bandwidth resources are partitioned among cores to reduce resource interferences due to concurrent accesses. Based on our extension of LITMUSRT with Intel’s Cache Allocation Technology and MemGuard, we present an experimental evaluation of the relationship between the allocation of cache and memory bandwidth resources and a task’s WCET. Our resource allocation strategy exploits this relationship to map tasks onto cores, and to compute the resource allocation for each core. By grouping tasks with similar characteristics (in terms of resource demands) to the same core, it enables tasks on each core to fully utilize the assigned resources. In addition, based on the tasks’ execution time behaviors with respect to their assigned resources, we can determine a desirable allocation that maximizes schedulability under resource constraints. Extensive evaluations using real-world benchmarks show that CaM offers near optimal schedulability performance while being highly efficient, and that it substantially outperforms existing solutions.

Subject Area

CPS Real-Time, CPS Theory

Volume

IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS 2019)

Share

COinS
 

Date Posted:07 May 2019

This document has been peer reviewed.