Skip to main content

Two methods for load balanced distributed adaptive integration

  • Conference paper
  • First Online:
High-Performance Computing and Networking (HPCN-Europe 1996)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1067))

Included in the following conference series:

Abstract

Parallel subregion-adaptive integration often exhibits sequential behavior when applied to functions with difficult local problems such as boundary singularities. To correct this, one needs to balance the loads of the processors by providing all of them with a reasonably difficult part of the problem. In this paper, we present two distributed adaptive integration methods: one based on a global heap priority queue (distributed over the processors) which remains load balanced and assures that the subregions are processed according to their (global) priority (size of error) and one based on a local heap priority queue enhanced by receiverinitiated load balancing. We report results of both methods.

This project is sponsored in part by National Science Foundation under grant CCR-9405377.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Berntsen, T. O. Espelid, and A. Genz, An adaptive algorithm for the approximate calculation of multiple integrals, ACM Trans. Math. Softw., 17 (1991), pp. 437–451.

    Google Scholar 

  2. -, Algorithm 698: DCUHRE-an adaptive multidimensional integration routine for a vector of integrals, ACM Trans. Math. Softw., 17 (1991), pp. 452–456.

    Google Scholar 

  3. E. de Doncker, A. Gupta, P. Ealy, and K. Rathbun, Development of a parallel and distributed integration package — Part I, in Lecture Notes in Computer Science, vol. 919, 1995, pp. 229–234.

    Google Scholar 

  4. A. Gupta and A. Photiou, Load balanced priority queues on distributed memory machines, in Lecture Notes in Computer Science, Springer Verlag, vol. 817, 1994, pp. 689–700.

    Google Scholar 

  5. H. D. Shapiro, Increasing robustness in global adaptive quadrature through interval selection heuristics, ACM Transactions on Mathematical Software, 10 (1984), pp. 117–139.

    Google Scholar 

  6. S. Smith and R. Schnabel, Centralized and distributive dynamic scheduling for adaptive parallel algorithms, tech. rep., Department of Computer Science, University of Colorado at Boulder, Boulder, CO, 1991. CU-CS-516-91.

    Google Scholar 

  7. P. van Dooren and L. de Ridder, Algorithm 2, an adaptive algorithm for numerical integration over an n-dimensional cube, Journal of Computational and Applied Mathematics, 2 (1976), pp. 207–217.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Heather Liddell Adrian Colbrook Bob Hertzberger Peter Sloot

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

de Doncker, E., Ealy, P., Gupta, A. (1996). Two methods for load balanced distributed adaptive integration. In: Liddell, H., Colbrook, A., Hertzberger, B., Sloot, P. (eds) High-Performance Computing and Networking. HPCN-Europe 1996. Lecture Notes in Computer Science, vol 1067. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61142-8_597

Download citation

  • DOI: https://doi.org/10.1007/3-540-61142-8_597

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61142-4

  • Online ISBN: 978-3-540-49955-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics