Multithreaded code from synchronous programs: extracting independent threads for OpenMP

Authors:
Daniel Baudisch;Jens Brandt;Klaus Schneider
Affiliations:
University of Kaiserslautern, Germany;University of Kaiserslautern, Germany;University of Kaiserslautern, Germany
Venue:
Proceedings of the Conference on Design, Automation and Test in Europe
Year:
2010

Citing 4
Cited 2

The ESTEREL Synchronous Programming Language and its Mathematical Semantics

Seminar on Concurrency, Carnegie-Mellon University
Concurrency in Synchronous Systems

Formal Methods in System Design
Separate compilation for synchronous programs

Proceedings of th 12th International Workshop on Software and Compilers for Embedded Systems
A Verified Compiler for Synchronous Programs with Local Declarations

Electronic Notes in Theoretical Computer Science (ENTCS)

Extending synchronization constructs in openMP to exploit pipeline parallelism on heterogeneous multi-core

ICA3PP'11 Proceedings of the 11th international conference on Algorithms and architectures for parallel processing - Volume Part II
Multi-threaded code generation from Signal program to OpenMP

Frontiers of Computer Science: Selected Publications from Chinese Universities

Quantified Score

Hi-index	0.00

Visualization

Abstract

Synchronous languages offer a deterministic model of concurrency at the level of actions. However, essentially all compilers for synchronous languages compile these actions into a single thread by sophisticated methods to guarantee dynamic schedules for the sequential execution of these actions. In this paper, we present the compilation of synchronous programs to multi-threaded OpenMP-based C programs. We thereby start at the level of synchronous guarded actions which is a comfortable intermediate language for synchronous languages. In addition to the explicit parallelism given in the source program, our method also exploits the implicit parallelism which is due to the underlying synchronous model of computation and the data dependencies of the guarded actions. We show how viable tasks can be constructed from the actions of a program and show the feasibility of our approach by a small example.