Static Analysis for Divide-and-Conquer Pattern Discovery
Keywords:
Erlang, divide-and-conquer, pattern, parallelizationAbstract
Routines implementing divide-and-conquer algorithms are good candidates for parallelization. Their identifying property is that such a routine divides its input into "smaller" chunks, calls itself recursively on these smaller chunks, and combines the outputs into one. We set up conditions which characterize a wide range of d&c routine definitions. These conditions can be verified by static program analysis. This way d&c routines can be found automatically in existing program texts, and their parallelization based on semi-automatic refactoring can be facilitated. We work out the details in the context of the Erlang programming language.Downloads
Download data is not yet available.
Downloads
Published
2017-02-07
How to Cite
Kozsik, T., Tóth, M., Bozó, I., & Horváth, Z. (2017). Static Analysis for Divide-and-Conquer Pattern Discovery. Computing and Informatics, 35(4), 764–791. Retrieved from http://147.213.75.17/ojs/index.php/cai/article/view/3377
Issue
Section
Special Section Articles