doi: 10.7873/DATE.2015.0778

OpenMP and Timing Predictability: A Possible Union?

Roberto Vargas1, Eduardo Quinones2 and Andrea Marongiu3

1Barcelona Supercomputing Center (BSC) and Technical University of Catalonia (UPC), Spain.

2Barcelona Supercomputing Center (BSC), Spain.

3Swiss Federal Institute of Technology in Zurich (ETHZ), Switzerland.


Next-generation many-core embedded platforms have the chance of intercepting a converging need for high performance and predictability. Programming methodologies for such platforms will have to promote predictability as a first-class design constraint, along with features for massive parallelism exploitation. OpenMP, increasingly adopted in the embedded systems domain, has recently evolved to deal with the programmability of heterogeneous many-cores, with mature support for fine-grained task parallelism. While tasking is potentially very convenient for coding real-time applications modeled as periodic task graphs, OpenMP adopts an execution model completely agnostic to any timing requirement that the target application may have. In this position paper we reason about the suitability of the current OpenMP v4 specification and execution model to provide timing guarantees in many-cores.

Full Text (PDF)