Basic HTML version of Foils prepared 13 February 2000

Foil 31 Data Parallelism in Algorithms

From Methodology of Computational Science CPS615 Computational Science -- Spring Semester 2000. by Geoffrey C. Fox
1 Data-parallel algorithms exploit the parallelism inherent in many large data structures.
  • A problem is an (identical) algorithm applied to multiple points in data "array"
  • Usually iterate over such "updates"
2 Features of Data Parallelism
  • Scalable parallelism -- can often get million or more way parallelism
  • Hard to express when "geometry" irregular or dynamic
3 Note data-parallel algorithms can be expressed by ALL programming models (Message Passing, HPF like, openMP like)
in Table To:

© 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 Thu Mar 16 2000