SRMSWCET, BAREILLY

STUDY ON PARALLEL COMPUTING

( GUO-LIANG CHEN, GUANG -ZHONG SUN,YUNQUAN ZHANG AND ZE-YAOMO)

PRESENTED TO MR. ROHIT JOHRI

PRESENTED BYAYUSHI GAUR

CONTENTS
INTRODUCTION BASIC USES

CONCEPTS COMPUTER ARCHITECTURE

OF PARALLEL COMPUTING

PARALLEL

PARALLEL

PROGRAMMING MODELS
PARALLEL PROGRAMS

DESIGNING

APPLICATIONS CONCLUSION

REFERENCES

INTRODUCTION
In the simplest sense, parallel computing is the simultaneous use of multiple compute resources to solve a computational problem.

REAL WORLD IS MASSIVELY PARALLEL

parallel computing is much better suited for modeling, simulating and understanding complex, real world phenomena. In the natural world, many complex, events are happening at the same time.

USES OF PARALLEL COMPUTING

SCIENCE
Atmosphere, Physics Biology Chemistry Geology,

AND ENGINEERING
Earth, Environment

Seismology Engineering Engineering Science

Mechanical Electrical

Computer Defense

INDUSTRIAL AND COMMERCIAL

Databases, Web

data mining

search engines imaging design and economic modeling of national and multi-national

Medical

Pharmaceutical Financial

Management

corporations
Advanced

graphics and virtual reality

work environments.

Collaborative

WHY USE PARALLEL COMPUTING

Save

time and/or money larger problems

Solve

Provide
Use

concurrency

of resources

HARDWARE PLATFORM OF PARALLEL COMPUTING

COMMON

PARALLEL COMPUTER ARCHITECTURE

SUPERCOMPUTER SHARED

ARCHITECTURE

MEMORY
MEMORY

DISTRIBUTED

COMMOM PARALLEL ARCHITECTURE

Cheap Three

and Convenient.

type of Parallel Computers based on this architecture :

Desktop Multiprocessors Symmetric Multiprocessor

Cluster of Workstation

SUPERCOMPUTER ARCHITECTURE
High Main oMPP oPVP oDSM

performance & high Cost

architectures are :

SHARED MEMORY
Shared

memory parallel computers vary widely.

Multiple

processors can operate independently but share the same memory resources.
Historically,

shared memory machines have been classified as UMA and NUMA, based upon memory access times

DISTRIBUTED MEMORY
Like

shared memory systems, distributed memory systems vary widely but share a common characteristic.
Processors

have their own local memory. Memory addresses in one processor do not map to another processor.
Because

each processor has its own local memory, it operates independently.

THEORETICAL BASE OF PARALLEL COMPUTING: PARALLEL ALGORITHMS

PARALLEL COMPUTATION MODEL :
First

generation parallel computation

model Second generation parallel computation model Third generation parallel computation model

DESIGN AND IMPLEMENTATION OF PARALLEL ALGORITHMS :

Policy

Method
Implementation

PERFORMANCE EVALUTION OF PARALLEL ALGORITHM :

Speed

Up Efficiency Scalability

SOFTWARE SUPPORT OF PARALLEL COMPUTING : PARALLEL

PROGRAMMING

PARALLEL

PROGRAMMING

MODELS: Shared Variable Message Passing Unified Model

PARALLEL

BENCHMARK

PARALLEL APPLICATIONS AND ENABLING TECHNOLOGIES

Computational

fluid dynamics (CFD) Particle Transportation Other Applications Environment and Energy Chemistry Biology

CONCLUSION
Parallel There

computing is fast.

are many different approaches and models of parallel computing.

Parallel

computing is the future of computing.