A. Genz (1982), Numerical Multiple Integration on Parallel Computers, Computer Physics Communications, 26, pp. 349--352. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Parallel Globally Adaptive Algorithms for Multi-dimensional.. - Bull, Freeman (1994) (Correct)
....parallelism can be exploited in globally adaptive quadrature. Each application of the quadrature rule pair to an interval requires a number of evaluations of the integrand which can be executed in parallel; this fine grain parallelism is well suited to SIMD machines and vector processors Genz [9] considers the approximation of multiple integrals on an ICL DAP and Mascagni [17] considers the same problem on a Connection Machine; Gladwell [13] considers the vectorisation of the NAG routine D01AKF on a CRAY 1. However this parallelism may be too fine grained (depending, of course, on the ....
A. Genz (1982), Numerical Multiple Integration on Parallel Computers, Computer Physics Communications, 26, pp. 349--352.
Parallel Algorithms For Globally Adaptive Quadrature - Bull (1997) (Correct)
....For MIMD architectures, other sources of overhead, such as synchronisation and communication, may also be a problem for this approach, as we shall see in Chapter 5. Parallelism at this level is, however generally well suited to vector architectures (see [22] and array processors (see [18] and [34] and variants of library routines (such as D01AUF in the NAG library) are designed to exploit this. For efficient parallel algorithms on MIMD machines, it is necessary to exploit coarser grained parallelism. To do this, Algorithm CP is modified by, at each stage, identifying a set of ....
Genz, A., (1982) Numerical multiple integration on parallel computers, Computer Physics Communications, vol. 26, pp. 349--352.
Parallel Algorithms For Globally Adaptive Quadrature - Bull (1997) (Correct)
....For MIMD architectures, other sources of overhead, such as synchronisation and communication, may also be a problem for this approach, as we shall see in Chapter 5. Parallelism at this level is, however generally well suited to vector architectures (see [22] and array processors (see [18] and [34] and variants of library routines (such as D01AUF in the NAG library) are designed to exploit this. For efficient parallel algorithms on MIMD machines, it is necessary to exploit coarser grained parallelism. To do this, Algorithm CP is modified by, at each stage, identifying a set of ....
Genz, A., (1982) Numerical multiple integration on parallel computers, Computer Physics Communications, vol. 26, pp. 349--352.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC