We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
STATIC ANALYSIS FOR DIVIDE-AND-CONQUER PATTERN DISCOVERY.
- Authors
KOZSIK, Tamás; TÓTH, Melinda; BOZÓ, István; HORVÁTH, Zoltán
- Abstract
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.
- Subjects
ERLANG (Computer program language); PROGRAMMING languages; AUTOMATION; ALGORITHMS; COMPUTER systems
- Publication
Computing & Informatics, 2016, Vol 35, Issue 4, p764
- ISSN
1335-9150
- Publication type
Article