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).
@InProceedings{rouxel_et_al:LIPIcs.ECRTS.2019.25, author = {Rouxel, Benjamin and Skalistis, Stefanos and Derrien, Steven and Puaut, Isabelle}, title = {{Hiding Communication Delays in Contention-Free Execution for SPM-Based Multi-Core Architectures}}, booktitle = {31st Euromicro Conference on Real-Time Systems (ECRTS 2019)}, pages = {25:1--25:24}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-110-8}, ISSN = {1868-8969}, year = {2019}, volume = {133}, editor = {Quinton, Sophie}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ECRTS.2019.25}, URN = {urn:nbn:de:0030-drops-107626}, doi = {10.4230/LIPIcs.ECRTS.2019.25}, annote = {Keywords: Real-time Systems, Contention-Free Scheduling, SPM multi-core architecture} }
Feedback for Dagstuhl Publishing