• Citer

Communication and Shared Memory Efficient Mapping Techniques of Real-Time DAGs upon Clustered Multicore Platforms

par Schuh, Matheus;Maiza, Claire;Raymond, Pascal;Ferres, Bruno;Goossens, Joël ;De Dinechin, Benoit Dupont
Référence Proceedings of Real-Time and Network Systems
Publication A Paraître, 2025-11-05

Article révisé par les pairs

• Accès en ligne
• Détails
• Contenu
• Statistiques

Résumé :

When it comes to mapping and scheduling Real-Time applications on parallel platforms, the Directed Acyclic Graphs (DAGs) processing model is commonly used. In this paper, we leverage the structural properties of DAG-based applications to optimize their deployment in clustered multicore processors. We assume a constant communication time between clusters and partitioned banked memory inside clusters.Our main contribution is a novel mapping (and ordering) heuristic that accounts for both communication size and DAG topology, while respecting memory constraints. Compared to the classic list scheduling-based mapping algorithm HLFET, when our approach succeeds in finding a mapping,it achieves a reduction of up to 75% in the global DAG response time and leads to better scheduling in 80% of the cases.