Hardware resources contention-aware scheduling of hard real-time multiprocessor systems
[EN] In hard real-time embedded systems, switching to multicores is a step that most application domains delay asmuch as possible. This is mainly due to the number of sources of indeterminism, which mainly involve sharedhardware resources, such as buses, caches, and memories. In this paper, a new ta...
| Autores: | , , , , |
|---|---|
| Formato: | artículo |
| Fecha de publicación: | 2021 |
| País: | España |
| Recursos: | Universitat Politècnica de València (UPV) |
| Repositorio: | RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia |
| Idioma: | inglés |
| OAI Identifier: | oai:riunet.upv.es:10251/183722 |
| Acesso em linha: | https://riunet.upv.es/handle/10251/183722 |
| Access Level: | acceso abierto |
| Palavra-chave: | Multicore Real-time Scheduling Memory contention MILP ARQUITECTURA Y TECNOLOGIA DE COMPUTADORES 09.- Desarrollar infraestructuras resilientes, promover la industrialización inclusiva y sostenible, y fomentar la innovación |
| Resumo: | [EN] In hard real-time embedded systems, switching to multicores is a step that most application domains delay asmuch as possible. This is mainly due to the number of sources of indeterminism, which mainly involve sharedhardware resources, such as buses, caches, and memories. In this paper, a new task model that considersthe interference that task execution causes in other tasks running on other cores due to memory contentionis proposed. We propose a scheduling algorithm that calculates the exact interference. We also analyse andcompare existing partitioning algorithms and propose three strategies to allocate tasks to cores to schedule asmany tasks as possible and minimise total interference. |
|---|