Abstract
One of the problems with using Parallel Paradigms to pro- gram 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 compre- hension, 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.
This work has been partly supported by MURST, Italy (Project MOSAICO) and by the Italian Regional Government (Regione Campania, L. 41/94).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
P. Brinch Hansen, “Model programs for computational science: a programming methodology for multicomputers”, Concurrency: Practice and Experience, 5(5), pp. 407–423, Aug. 1993.
M. I. Cole, Algorithmic Skeletons: Structured Management of Parallel Computation, MIT Press, Cambridge, MA, 1989.
I. Foster and M. Xu, “Libraries for Parallel Paradigm Integration”, in Toward Teraflop Computing and New Grand Challenge Applications, Nova Science, 1994.
J. Darlington, A. J. Field, P. G. Harrison, P. H. J. Kelly, D. W. N. Sharp, Q. Wu and R. L. Whie, “Parallel Programming Using Skeleton Functions”, in PARLE’93, LNCS 694, pp. 146–160, Springer-Verlag, 1993.
Message Passing Interface Forum. Document for a Standard Message-Passing Interface. Technical Report No. CS-93-214, University of Tennessee, 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aversa, R., Di Martino, B. (1999). Experiences on Parallelization of Divide and Conquer Algorithms with Parallel Paradigms* . In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 1999. Lecture Notes in Computer Science, vol 1662. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48387-X_49
Download citation
DOI: https://doi.org/10.1007/3-540-48387-X_49
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66363-8
Online ISBN: 978-3-540-48387-8
eBook Packages: Springer Book Archive