Degree
Master of Science
Program
Computer Science
Supervisor
Dr.Marc Moreno Maza
Abstract
This thesis describes the implementation of MetaFork, a meta-language for concurrency platforms targeting multicore architectures. First of all, MetaFork is a multithreaded language based on the fork-join model of concurrency: it allows the programmer to express parallel algorithms assuming that tasks are dynamically scheduled at run-time. While MetaFork makes no assumption about the run-time system, it formally defines the serial C-elision of a MetaFork program. In addition, MetaFork is a suite of source-to-source compilers permitting the automatic translation of multithreaded programs between programming languages based on the fork-join model. Currently, this compilation framework supports the OpenMP and CilkPlus concurrency platforms. The implementation of those compilers explicitly manages parallelism according to the directives specified in MetaFork, OpenMP and CilkPlus. We evaluate experimentally the benefits of MetaFork. First, we show that this framework can be used to perform comparative implementation of a given multi- threaded algorithm so as to narrow performance bottlenecks in one implementation of this algorithm. Secondly, we show that the translation of hand written and highly optimized code within MetaFork generally produces code with similar performance as the original.
Recommended Citation
Shekar, Sushek, "On the Interoperability of Programming Languages based on the Fork-Join Parallelism Model" (2013). Electronic Thesis and Dissertation Repository. 1848.
https://ir.lib.uwo.ca/etd/1848
Included in
Computer and Systems Architecture Commons, Programming Languages and Compilers Commons, Software Engineering Commons