Programming and Timing Analysis of Parallel Programs on Multicores

Abstract : Multicore processors provide better power-performance trade-offs compared to single-core processors. Consequently, they are rapidly penetrating market segments which are both safety critical and hard real-time in nature. However, designing time-predictable embedded applications over multicores remains a considerable challenge. This paper proposes the ForeC language for the deterministic parallel programming of embedded applications on multicores. ForeC extends C with a minimal set of constructs adopted from synchronous languages. To guarantee the worst-case performance of ForeC programs, we offer a very precise reachability- based timing analyzer. To the best of our knowledge, this is the first attempt at the efficient and deterministic parallel programming of multicores using a synchronous C-variant. Experimentation with large multicore programs revealed an average over-estimation of only 2% for the computed worst-case execution times (WCETs). By reducing our representation of the programs state-space, we reduced the analysis time for the largest program (with 43, 695 reachable states) by a factor of 342, to only 7 seconds.
Document type :
Conference papers
Complete list of metadatas

Cited literature [21 references]  Display  Hide  Download

https://hal.inria.fr/hal-00842402
Contributor : Alain Girault <>
Submitted on : Tuesday, July 9, 2013 - 11:15:21 AM
Last modification on : Thursday, October 11, 2018 - 8:48:04 AM
Long-term archiving on : Wednesday, April 5, 2017 - 8:15:25 AM

File

yip-acsd13.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00842402, version 1

Collections

Citation

Eugene Yip, Partha Roop, Morteza Biglari-Abhari, Alain Girault. Programming and Timing Analysis of Parallel Programs on Multicores. International Conference on Application of Concurrency to System Design, ACSD'13, Jul 2013, Barcelona, Spain. pp.167--176. ⟨hal-00842402⟩

Share

Metrics

Record views

397

Files downloads

689