Experiences on Parallelization of Divide and Conquer Algorithms with Parallel Paradigms

  • Authors:
  • Rocco Aversa;Beniamino Di Martino

  • Affiliations:
  • -;-

  • Venue:
  • PaCT '999 Proceedings of the 5th International Conference on Parallel Computing Technologies
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

One of the problems with using Parallel Paradigms to program parallel architectures is the choice of the paradigm which is best suited to the characteristics of the program to be developed/parallelized, and of the target architecture, in terms of performance of the parallel implementation. Another problem arising with parallelization of legacy codes is the attempt to minimize the effort needed for program comprehension, and thus to achieve the minimum restructuring of the sequential code when producing the parallel version. In this paper we address these issues for the Divide and Conquer class of algorithms/programs.