Professional Documents
Culture Documents
M M M M: M M M M M M
M M M M: M M M M M M
Overview
Concepts and Terminology Parallel Computer Memory Architectures Parallel Programming Models Designing Parallel Programs Parallel Algorithm Examples Conclusion
SERIAL COMPUTING
PARALLEL COMPUTING
Compiler analyzes code and identifies opportunities for parallelism Analysis includes attempting to compute whether or not the parallelism actually improves performance. Loops are the most frequent target for automatic parallelism.
A Parallelizable Problem:
Calculate the potential energy for each of several thousand independent conformations of a molecule. When done find the minimum energy conformation.
DOMAIN DECOMPOSITION
In this type of partitioning,the data associated with a problem is decomposed.
Perform a function on a 2D array. Single processor iterates through each element in the array Assign each processor a partition of the array. Each process iterates through its own partition.
Conclusion
Parallel computing is fast. There are many different approaches and models of parallel computing. Parallel computing is the future of computing.
QUESTIONS ??
THANK YOU