Basic HTML version of Foils prepared August 7 98

Foil 16 Data Parallelism in Algorithms

From DoD HPF Training -- 1. Introduction to HPF DoD Training and Others -- 1995-98. by Chuck Koelbel -- Rice University
1 Data-parallel algorithms exploit the parallelism inherent in many large data structures.
  • Many elements in structure ¤ many update operations
  • Example: Red-Black Relaxation
    • All red points can be updated in parallel
2 Analysis:
  • Scalable parallelism
  • Synchronization and locality may be suspect
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 Sun Aug 9 1998