Ariadne — Directive-based parallelism extraction from recursive functions

Mastoras, Aristeidis; Manis, George

doi:10.1016/j.jpdc.2015.07.009

Cited by 2 publications

(2 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Gupta et al [6] propose an approach to optimize recursive task parallel programs through lessening task creation and termination overhead. Adriadne [10] is a compiler that retrieves, from recursive functions, directive-based parallelism. It applies either: (1) recursion elimination, (2) parallel-reduction removing recursion such that workload is distributed to independent tasks, or (3) thread-safe recursive functions parallelization involving independent recursive calls.…”

Section: Related Workmentioning

confidence: 99%

“…Indeed, recursive programs generally suffer from not being as easily handled as other code structures like loops, for automatic optimization and parallelization. In the literature dealing with recursion optimization, either recursive functions are handled directly «as they are» [5,10], or are firstly transformed into loops [1]. Although such approaches may provide significant performance improvements, they do not capture cases where recursive codes can be rewritten as affine loops, which are the most convenient loops for efficient data locality and parallelization optimizations.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Rec2Poly: Converting Recursions to Polyhedral Optimized Loops Using an Inspector-Executor Strategy

Kobeissi

Ketterlin

Clauss

2020

Lecture Notes in Computer Science

View full text Add to dashboard Cite

In this paper, we propose Rec2Poly, a framework which detects automatically if recursive programs may be transformed into affine loops that are compliant with the polyhedral model. If successful, the replacing loops can then take advantage of advanced loop optimizing and parallelizing transformations as tiling or skewing. Rec2Poly is made of two main phases: an offline profiling phase and an inspector-executor phase. In the profiling phase, the original recursive program, which has been instrumented, is run. Whenever possible, the trace of collected information is used to build equivalent affine loops from the runtime behavior. Then, an inspector-executor program is automatically generated, where the inspector is made of a light version of the original recursive program, whose aim is reduced to the generation and verification of the information which is essential to ensure the correctness of the equivalent affine loop program. The collected information is mainly related to the touched memory addresses and the control flow of the socalled "impacting" basic blocks of instructions. Moreover, in order to exhibit the lowest possible time-overhead, the inspector is implemented as a parallel process where several memory buffers of information are verified simultaneously. Finally, the executor is made of the equivalent affine loops that have been optimized and parallelized.

show abstract

Section: Related Workmentioning

confidence: 99%