Recursion-driven parallel code generation for multi-core platforms

Abstract

Abstract-We present Huckleberry, a tool for automatically generating parallel implementations for multi-core platforms from sequential recursive divide-and-conquer programs. The recursive programming model is a good match for parallel systems because it highlights the temporal and spatial locality of data use. Recursive algorithms are used by Huckleberry's code generator not only to automatically divide a problem up into smaller tasks, but also to derive lower-level parts of the implementation, such as data distribution and inter-core synchronization mechanisms. We apply Huckleberry to a multicore platform based on the Cell BE processor and show how it generates parallel code for a variety of sequential benchmarks.

Ariadne — Directive-based parallelism extraction from recursive functions

“…This form of parallelism is the most 555 commonly supported. Even though other models extract this form of parallelism automatically [11,12,13,14], Ariadne requires a directive to be provided by the programmer. This is a different approach.…”

“…They apply techniques for speculative run-time parallelization when the compile-time analysis is not sufficient for parallelism extraction. Huck-850 leberry [13] is a tool that automatically generates parallel code for multi-core platforms, again derived from divide and conquer algorithms.…”

Parallel Biological Sequence Comparison on Heterogeneous High Performance Computing Platforms with BSP++

“…In this scenario, programmers need to study the programming interface of the target platform and reprogram the entire application. For this reason, parallel programming languages, tools and cross-compilers have been proposed such as [9], [3], [12], [8] and [10] that are able to generate code for multiple platforms.…”