Time-predictable parallel programming models
Visualitza/Obre
Estadístiques de LA Referencia / Recolecta
Inclou dades d'ús des de 2022
Cita com:
hdl:2117/108151
Tipus de documentText en actes de congrés
Data publicació2017-05-04
EditorBarcelona Supercomputing Center
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya
Abstract
Embedded Computing (EC) systems are increas-ingly concerned with providing higher performance in real-time while HPC applications require huge amounts of information to be processed within a bounded amount of time. Addressing this convergence and mixed set of requirements needs suitable programming methodologies to exploit the massively parallel computation capabilities of the available platforms in a pre-dictable way. OpenMP has evolved to deal with the programma-bility of heterogeneous many-cores, with mature support for fine-grained task parallelism. Unfortunately, while these features are very relevant for EC heterogeneous systems, often modeled as periodic task graphs, both the OpenMP programming interface and the execution model are completely agnostic to any timing requirement that the target applications may have. The goal of our work is to enable the use of the OpenMP parallel programming model in real-time embedded systems, such that many-cores architectures can be adopted in critical real-time embedded systems. To do so, it is required to guarantee the timing behavior of OpenMP applications.
CitacióSerrano, M. A.; Quiñones, E. Time-predictable parallel programming models. A: BSC Severo Ochoa International Doctoral Symposium (4th: 2017: Barcelona). "Book of abstracts". Barcelona: Barcelona Supercomputing Center, 2017, p. 108-109.
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
Time-predictable_parallel_programming_models.pdf | 679,7Kb | Visualitza/Obre |