Abstract
Parallel globally adaptive algorithms for numerical integration provide a simple example of algorithms that exploit control parallelism. In this paper we consider the implementation of such algorithms on two distributed memory machines — the KSR-1 which supports a shared memory programming model and the Intel iPSC/860 which supports a message passing programming model. We investigate how the characteristics of the different machines affect the choice of implementation and thereby the performances of the algorithms.
The first author acknowledges the support of the NATO Collaborative Research Grant 920037.
Both authors acknowledge the support of the EEC Esprit Basic Research Action Programme, Project 6634 (APPARC).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Bokhari, S. H. (1990) Communication overhead on the Intel iPSC-860 hypercube, ICASE interim report 10, ICASE, NASA Langley Research Center, Hampton, Virginia.
Bull, J. M. and Freeman, T. L. (1994) Parallel Globally Adaptive Quadrature on the KSR-1, to appear in Advances in Computational Mathematics.
Bull, J. M. and Freeman, T. L. (1994) Parallel Algorithms and Interval Selection Strategies for Globally Adaptive Quadrature, to appear in Proceedings of PARLE'94.
Bull, J. M. and Freeman, T. L. (1994) Parallel Algorithms for Numerical Integration in One and Several Dimensions, submitted to Proceedings of CWI — RUU Symposium on Massively Parallel Computing and Applications, ed H. te Riele and H. Van der Vorst, CWI Tracts, Amsterdam.
Genz, A. C. and Malik, A. A. (1980) Remarks on Algorithm 006: An Adaptive Algorithm for Numerical Integration over an N-dimensional Rectangular Region, J. Comput. Appl. Math. 6, pp. 295–302.
Hockney, R. (1992) A Framework for Benchmark Performance Analysis, Supercomputer, 48, pp. 9–22.
Intel (1991) iPSC/2 and iPSC/860 Programmer's Reference Manual, Order No. 311708-004, Intel Scientific Computers, Beaverton, OR.
K.S.R. (1991) KSR Fortran Programming, Kendall Square Research, Waltham, Mass.
K.S.R. (1993) KSR Parallel Programming, Kendall Square Research, Waltham, Mass.
Lapenga, M. and D'Alessio, A. (1993) A Scalable Parallel Algorithm for the Adaptive Multidimensional Quadrature, pp. 933–936 of [14].
N.A.G. (1991) N.A.G. Fortran Library Manual, Mark 15, N.A.G. Ltd., Oxford.
Piessens, R., de Doncker, E., Überhuber, C. and Kahaner, D. (1983) QUADPACK, A Subroutine Package for Automatic Integration, Springer-Verlag.
Ramachandran, U., Shah, G., Ravikumar, S., and Muthukumarasamy, J. (1993) Scalability Study of the KSR-1, Technical Report No. GIT-CC 93/03, College of Computing, Georgia Institute of Technology, Atlanta.
Sinovec, R. F., Keyes, D. E., Leuze, M. R., Petzold, L. R. and Reed, D. A. (eds.) (1993) Proceedings of the Sixth SIAM Conference on Parallel Processing, SIAM, Philadelphia.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Freeman, T.L., Bull, J.M. (1994). Shared memory and message passing implementations of parallel algorithms for numerical integration. In: Dongarra, J., Waśniewski, J. (eds) Parallel Scientific Computing. PARA 1994. Lecture Notes in Computer Science, vol 879. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030150
Download citation
DOI: https://doi.org/10.1007/BFb0030150
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58712-5
Online ISBN: 978-3-540-49050-0
eBook Packages: Springer Book Archive