Full Index for Basic foilset 
| Data decomposition - divide the data into pieces with equal amounts of processing required. |
| Distribute data blocks among processors - shown here on a MIMD distributed memory or SIMD machine. |
| Each processor runs a traditional sequential program implementing the Fortran90 program, looping over the subarray in its own memory. |
| If an array element A(i) is used with an array element B(j) which happens to be on another processor, communication will be used. |
)(focus style:
) Denote Foils where Image Critical
)(focus style:
) Denote Foils where HTML is sufficient
Introduction to High Performance Fortran (HPF)
Parallel Implementations of Fortran90
Example Program: a PDE solver, the solution of LaPlace's Equation
Grid Decomposition
Implementation of the Gauss-Jordan Program
Load Imbalance arises after i iterations over columns:
Load Balancing for Regular Gaussian Elimination during Forward Reduction Full WebWisdom URL and this Foilset Search
This contains all WebWisdom links preceded by those referenced in this foilset