Foilset Search Full Index for Basic foilset

Parallel Computation Illustrated with Adaptive Integration

Given by Nancy J McCracken at CPS615 Basic Simulation Track for Computational Science on Fall Semester 95. Foils prepared 22 February 98

This talk assumes the material found in the CPS615 lecture notes, Introduction to Numerical Integration.
Going on from the static data decomposition for integration on page 27 of those notes, we examine further parallel algorithms for computing adaptive Romberg (recursive Simpson) integration.
The data decomposition and remapping techniques discussed are generally applicable to parallel adaptive algorithms for other applications.

Table of Contents for Parallel Computation Illustrated with Adaptive Integration

There are two types of foils -- html and image which are each available in basic and JavaScript enabled "focused" style
(basic:)(focus style:) Denote Foils where Image Critical
(basic:)(focus style:) Denote Foils where HTML is sufficient
1 Computing Techniques for Adaptive Integration
2 Computing Techniques for Adaptive Integration
3 Sequential Romberg Integration
4 Program for Romberg Integration
Parallel Romberg Integration
5 Parallel Romberg Integration, Continued
6 Adaptive Parallel Romberg - CommAll Version
At each iteration, data is decomposed again by all processors.
7 Adaptive Parallel Romberg - program initialization
Adaptive Parallel Romberg - compute integral iteration and communicate values to all processors
Adaptive Parallel Romberg - recompute decomposition
Adaptive Parallel Romberg - Neighbors Version
At each iteration, processors average load with neighbors
8 More discussion of Neighbors version
Full WebWisdom URL and this Foilset Search
This contains all WebWisdom links preceded by those referenced in this foilset
© Northeast Parallel Architectures Center, Syracuse University, npac@npac.syr.edu

If you have any comments about this server, send e-mail to webmaster@npac.syr.edu.

Page produced by wwwfoil on Sun Feb 22 1998