AutopaR: An Automatic Parallelization Tool for Recursive Calls
Proceedings of the International Conference on Parallel Processing Workshops
Institute of Electrical and Electronics Engineers Inc.
159 - 165
MetadataShow full item record
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/28430
Manycore systems are becoming more and more powerful with the integration of hundreds of cores on a single chip. However, writing parallel programs on these manycore systems has become a problem since the amount of available parallel tools and applications are limited. Although exploiting parallelism in software is possible, it requires different design decisions, significant programmer effort and is error prone. Different libraries and tools try to make the transition to parallelism easier, however there is no concrete system to make it transparent to software developer. To this end, our proposed tool is a step forward to improve the current state. Our approach, Autopar, specifically aims at achieving automatic parallelization of recursive applications using static program analysis. It first decides on the recursive functions of a given program. Then, it performs analysis and collects information about these recursive functions. Our analysis module automatically collects program information without requiring any modification in the program design or developer involvement. Finally, it achieves automatic parallelization by introducing necessary OpenMP pragmas in appropriate places in the application. © 2014 IEEE.
Showing items related by title, author, creator and subject.
A recursive approach to reconstruction of sparse signals [Seyrek sinyallerin geri çatimina özyineli bir yaklaşim] Teke O.; Arikan, O.; Gurbuz, A.C. (IEEE Computer Society, 2014)Compressive Sensing (CS) theory details how a sparsely represented signal in a known basis can be reconstructed using less number of measurements. In many practical systems, the observation signal has a sparse representation ...
Aykanat, C.; Cambazoglu, B.B.; Uçar, B. (2008)K-way hypergraph partitioning has an ever-growing use in parallelization of scientific computing applications. We claim that hypergraph partitioning with multiple constraints and fixed vertices should be implemented using ...
Utilization of the recursive shortest spanning tree algorithm for video-object segmentation by 2-D affine motion modeling Tuncel, E.; Onural, L. (IEEE, 2000-08)A novel video-object segmentation algorithm is proposed, which takes the previously estimated 2-D dense motion vector field as input and uses the generalized recursive shortest spanning tree method to approximate each ...