2026-07-24T05:15:42Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:10762 2024-03-06T10:46:38Z ddc:004 open_access

Hiding Communication Delays in Contention-Free Execution for SPM-Based Multi-Core Architectures Rouxel, Benjamin Skalistis, Stefanos Derrien, Steven Puaut, Isabelle Real-time Systems Contention-Free Scheduling SPM multi-core architecture Multi-core systems using ScratchPad Memories (SPMs) are attractive architectures for executing time-critical embedded applications, because they provide both predictability and performance. In this paper, we propose a scheduling technique that jointly selects SPM contents off-line, in such a way that the cost of SPM loading/unloading is hidden. Communications are fragmented to augment hiding possibilities. Experimental results show the effectiveness of the proposed technique on streaming applications and synthetic task-graphs. The overlapping of communications with computations allows the length of generated schedules to be reduced by 4% on average on streaming applications, with a maximum of 16%, and by 8% on average for synthetic task graphs. We further show on a case study that generated schedules can be implemented with low overhead on a predictable multi-core architecture (Kalray MPPA). Schloss Dagstuhl – Leibniz-Zentrum für Informatik Benjamin Rouxel and Stefanos Skalistis and Steven Derrien and Isabelle Puaut 2019 Is Part Of LIPIcs, Volume 133, 31st Euromicro Conference on Real-Time Systems (ECRTS 2019) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ECRTS.2019.25 urn:nbn:de:0030-drops-107626 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ECRTS.2019.25 eng https://creativecommons.org/licenses/by/3.0/legalcode