Automatic parallelization of recursive functions using quantifier elimination

Akimasa Morihata, Kiminori Matsuzaki

Research output: Chapter in Book/Report/Conference proceedingConference contribution

23 Citations (Scopus)


Although the recent popularity of parallel-computing environments has called for parallel programs, it is difficult for nonspecialists to develop those that are efficient. What is required are parallelization methods that can automatically generate efficient parallel programs from sequential ones. In this paper, we propose an automatic method of parallelization for recursive functions. The key is a quantifier-eliminationbased derivation of an operator that shrinks function closures representing partial computations. Once we obtain such an operator, we can split the input structure and perform computation on each part in parallel. Our method has several features: it does not require any human help, it guarantees computational efficiency of generated programs, and it deals with complicated recursive functions such as those that are nonlinear recursive, non-self recursive, and accumulative.

Original languageEnglish
Title of host publicationFunctional and Logic Programming - 10th International Symposium, FLOPS 2010, Proceedings
Number of pages16
Publication statusPublished - 2010 Dec 1
Event10th International Symposium on Functional and Logic Programming, FLOPS 2010 - Sendai, Japan
Duration: 2010 Apr 192010 Apr 21

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6009 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other10th International Symposium on Functional and Logic Programming, FLOPS 2010

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Automatic parallelization of recursive functions using quantifier elimination'. Together they form a unique fingerprint.

Cite this