Parallel computing persentation

Introduction to Parallel Computing
Parallel Computing-
 Traditionally, software has been written for serial computation:
o To be run on a single computer having a single Central Processing Unit
(CPU);
o A problem is broken into a discrete series of instructions.
o Instructions are executed one after another.
o Only one instruction may execute at any moment in time.
For example:
 In the simplest sense, parallel computing is the simultaneous use of multiple
compute resources to solve a computational problem:
o To be run using multiple CPUs
o A problem is broken into discrete parts that can be solved concurrently
o Each part is further broken down to a series of instructions
o Instructions from each part execute simultaneously on different CPUs

 The compute resources might be:
o A single computer with multiple processors;
o An arbitrary number of computers connected by a network;
o A combination of both.
 The computational problem should be able to:
o Be broken apart into discrete pieces of work that can be solved
simultaneously;
o Execute multiple program instructions at any moment in time;
o Be solved in less time with multiple compute resources than with a
single compute resource.
Uses for Parallel Computing:
 Science and Engineering
 Industrial and Commercial

Why Use Parallel Computing?
Main Reasons:
1.Save time and/or money: In theory, throwing more resources at a task will shorten its time
to completion, with potential cost savings. Parallel computers can be built from cheap,
commodity components.
2.Solve larger problems: Many problems are so large and/or complex that it is impractical
or impossible to solve them on a single computer, especially given limited computer
memory.
3.Provide concurrency: A single compute resource can only do one thing at a time.
Multiple computing resources can be doing many things simultaneously. For example, the
Access Grid provides a global collaboration network where people from around the world
can meet and conduct work "virtually".
4.Use of non-local resources: Using compute resources on a wide area network, or even the
Internet when local compute resources are scarce.
5.Limits to serial computing: Both physical and practical reasons pose significant
constraints to simply building ever faster serial computers:
a. Transmission speeds - the speed of a serial computer is directly dependent upon
how fast data can move through hardware. Absolute limits are the speed of light (30
cm/nanosecond) and the transmission limit of copper wire (9 cm/nanosecond).
Increasing speeds necessitate increasing proximity of processing elements.
b. Limits to miniaturization - processor technology is allowing an increasing number
of transistors to be placed on a chip. However, even with molecular or atomic-level
components, a limit will be reached on how small components can be.
c. Economic limitations - it is increasingly expensive to make a single processor
faster. Using a larger number of moderately fast commodity processors to achieve the
same (or better) performance is less expensive.
d. Current computer architectures are increasingly relying upon hardware level
parallelism to improve performance:
 Multiple execution units
 Pipelined instructions
 Multi-core

USE OF PARALLEL COMPUTING-
The Future:
 During the past 20+ years, the trends indicated by ever faster networks,
distributed systems, and multi-processor computer architectures (even at the
desktop level) clearly show that parallelism is the future of computing.
 In this same time period, there has been a greater than 1000x increase in
supercomputer performance, with no end currently in sight.
 The race is already on for Exascale Computing!
Flynn's Classical Taxonomy
 There are different ways to classify parallel computers. For example:
 One of the more widely used classifications, in use since 1966, is called Flynn's
Taxonomy.
 Flynn's taxonomy distinguishes multi-processor computer architectures
according to how they can be classified along the two independent dimensions
of Instruction and Data. Each of these dimensions can have only one of two
possible states: Single or Multiple.
 The matrix below defines the 4 possible classifications according to Flynn:

S I S D
Single Instruction, Single Data
S I M D
Single Instruction, Multiple Data
M I S D
Multiple Instruction, Single Data
M I M D
Multiple Instruction, Multiple Data
1.Single Instruction, Multiple Data (SIMD):
 A type of parallel computer
 Single Instruction: All processing units execute the same instruction at any given clock
cycle
 Multiple Data: Each processing unit can operate on a different data element
 Best suited for specialized problems characterized by a high degree of regularity, such as
graphics/image processing.
 Synchronous (lockstep) and deterministic execution
 Two varieties: Processor Arrays and Vector Pipelines
 Examples:
o Processor Arrays: Connection Machine CM-2, MasPar MP-1 & MP-2, ILLIAC
IV
o Vector Pipelines: IBM 9000, Cray X-MP, Y-MP & C90, Fujitsu VP, NEC SX-2,
Hitachi S820, ETA10
 Most modern computers, particularly those with graphics processor units (GPUs) employ
SIMD instructions and execution units.
2.Multiple Instruction, Single Data (MISD):
 A type of parallel computer
 Multiple Instruction: Each processing unit operates on the data independently via
separate instruction streams.
 Single Data: A single data stream is fed into multiple processing units.
 Few actual examples of this class of parallel computer have ever existed. One is the
experimental Carnegie-Mellon C.mmp computer (1971).
 Some conceivable uses might be:
o multiple frequency filters operating on a single signal stream
o multiple cryptography algorithms attempting to crack a single coded message.

3.Single Instruction, Single Data (SISD):
 A serial (non-parallel) computer
 Single Instruction: Only one instruction stream is being
acted on by the CPU during any one clock cycle
 Single Data: Only one data stream is being used as input
during any one clock cycle
 Deterministic execution
 This is the oldest and even today, the most common type of
computer
 Examples: older generation mainframes, minicomputers
and workstations; most modern day PCs.
Some General Parallel Terminology
a. Supercomputing / High Performance Computing (HPC)
Using the world's fastest and largest computers to solve large problems.
b. Node
A standalone "computer in a box". Usually comprised of multiple
CPUs/processors/cores. Nodes are networked together to comprise a
supercomputer.
c. CPU / Socket / Processor / Core
This varies, depending upon who you talk to. In the past, a CPU (Central
Processing Unit) was a singular execution component for a computer. Then,
multiple CPUs were incorporated into a node. Then, individual CPUs were
subdivided into multiple "cores", each being a unique execution unit. CPUs
with multiple cores are sometimes called "sockets" - vendor dependent. The
result is a node with multiple CPUs, each containing multiple cores. The
nomenclature is confused at times.
d. Task
A logically discrete section of computational work. A task is typically a
program or program-like set of instructions that is executed by a processor. A
parallel program consists of multiple tasks running on multiple processors.
e. Pipelining
Breaking a task into steps performed by different processor units, with inputs
streaming through, much like an assembly line; a type of parallel computing.

f. Shared Memory
From a strictly hardware point of view, describes a computer architecture
where all processors have direct (usually bus based) access to common physical
memory. In a programming sense, it describes a model where parallel tasks all
have the same "picture" of memory and can directly address and access the
same logical memory locations regardless of where the physical memory
actually exists.
g. Symmetric Multi-Processor (SMP)
Hardware architecture where multiple processors share a single address space
and access to all resources; shared memory computing.
h. Distributed Memory
In hardware, refers to network based memory access for physical memory that
is not common. As a programming model, tasks can only logically "see" local
machine memory and must use communications to access memory on other
machines where other tasks are executing.
i. Communications
Parallel tasks typically need to exchange data. There are several ways this can be
accomplished, such as through a shared memory bus or over a network, however the
actual event of data exchange is commonly referred to as communications regardless
of the method employed.
j. Synchronization
The coordination of parallel tasks in real time, very often associated with
communications. Often implemented by establishing a synchronization point
within an application where a task may not proceed further until another task(s)
reaches the same or logically equivalent point.
k. Granularity
In parallel computing, granularity is a qualitative measure of the ratio of
computation to communication.
l. Observed Speedup
Observed speedup of a code which has been parallelized, defined as:
One of the simplest and most widely used indicators for a parallel program's
performance.
m. Parallel Overhead

The amount of time required to coordinate parallel tasks, as opposed to doing
useful work.
n. Massively Parallel
Refers to the hardware that comprises a given parallel system - having many
processors. The meaning of "many" keeps increasing, but currently, the largest
parallel computers can be comprised of processors numbering in the hundreds
of thousands.
o. Embarrassingly Parallel
Solving many similar, but independent tasks simultaneously; little to no need
for coordination between the tasks.
p. Scalability
Refers to a parallel system's (hardware and/or software) ability to demonstrate a
proportionate increase in parallel speedup with the addition of more processors.
Parallel Computer Memory Architectures
1.Shared Memory
General Characteristics:
 Shared memory parallel computers vary widely, but generally have in common the ability
for all processors to access all memory as global address space.
 Multiple processors can operate independently but share the same memory resources.
 Changes in a memory location effected by one processor are visible to all other
processors.
 Shared memory machines can be divided into two main classes based upon memory
access times: UMA and NUMA.
Uniform Memory Access (UMA):
 Most commonly represented today by Symmetric Multiprocessor (SMP) machines
 Identical processors
 Equal access and access times to memory
 Sometimes called CC-UMA - Cache Coherent UMA. Cache coherent means if one
processor updates a location in shared memory, all the other processors know about the
update. Cache coherency is accomplished at the hardware level.
Non-Uniform Memory Access (NUMA):
 Often made by physically linking two or more SMPs
 One SMP can directly access memory of another SMP
 Not all processors have equal access time to all memories

 Memory access across link is slower
 If cache coherency is maintained, then may also be called CC-NUMA - Cache Coherent
NUMA.
Advantages:
 Global address space provides a user-friendly programming perspective to
memory
 Data sharing between tasks is both fast and uniform due to the proximity of
memory to CPUs
Disadvantages:
 Primary disadvantage is the lack of scalability between memory and CPUs.
Adding more CPUs can geometrically increases traffic on the shared memory-
CPU path, and for cache coherent systems, geometrically increase traffic
associated with cache/memory management.
 Programmer responsibility for synchronization constructs that ensure "correct"
access of global memory.
 Expense: it becomes increasingly difficult and expensive to design and produce
shared memory machines with ever increasing numbers of processors.
2.Distributed Memory
General Characteristics:
 Like shared memory systems, distributed memory systems vary widely but
share a common characteristic. Distributed memory systems require a
communication network to connect inter-processor memory.

 Processors have their own local memory. Memory addresses in one processor
do not map to another processor, so there is no concept of global address space
across all processors.
 Because each processor has its own local memory, it operates independently.
Changes it makes to its local memory have no effect on the memory of other
processors. Hence, the concept of cache coherency does not apply.
 When a processor needs access to data in another processor, it is usually the
task of the programmer to explicitly define how and when data is
communicated. Synchronization between tasks is likewise the programmer's
responsibility.
 The network "fabric" used for data transfer varies widely, though it can can be
as simple as Ethernet.
Advantages:
 Memory is scalable with the number of processors. Increase the number of
processors and the size of memory increases proportionately.
 Each processor can rapidly access its own memory without interference and
without the overhead incurred with trying to maintain cache coherency.
 Cost effectiveness: can use commodity, off-the-shelf processors and
networking.
Disadvantages:
 The programmer is responsible for many of the details associated with data
communication between processors.
 It may be difficult to map existing data structures, based on global memory, to
this memory organization.
 Non-uniform memory access (NUMA) times

3.Hybrid Distributed-Shared Memory
 The largest and fastest computers in the world today employ both shared and
distributed memory architectures.
 The shared memory component can be a cache coherent SMP machine and/or
graphics processing units (GPU).
 The distributed memory component is the networking of multiple SMP/GPU
machines, which know only about their own memory - not the memory on
another machine. Therefore, network communications are required to move
data from one SMP/GPU to another.
 Current trends seem to indicate that this type of memory architecture will
continue to prevail and increase at the high end of computing for the
foreseeable future.
 Advantages and Disadvantages: whatever is common to both shared and
distributed memory architectures.
Parallel Programming Models
1.Overview
 There are several parallel programming models in common use:
o Shared Memory (without threads)
o Threads
o Distributed Memory / Message Passing
o Data Parallel
o Hybrid
o Single Program Multiple Data (SPMD)

o Multiple Program Multiple Data (MPMD)
 Parallel programming models exist as an abstraction above hardware and
memory architectures.
2.Shared Memory Model (without threads)
 In this programming model, tasks share a common address space, which they
read and write to asynchronously.
 Various mechanisms such as locks / semaphores may be used to control access
to the shared memory.
 An advantage of this model from the programmer's point of view is that the
notion of data "ownership" is lacking, so there is no need to specify explicitly
the communication of data between tasks. Program development can often be
simplified.
 An important disadvantage in terms of performance is that it becomes more
difficult to understand and manage data locality.
o Keeping data local to the processor that works on it conserves memory
accesses, cache refreshes and bus traffic that occurs when multiple
processors use the same data.
o Unfortunately, controlling data locality is hard to understand and beyond
the control of the average user.
3.Threads Model
 This programming model is a type of shared memory programming.
 In the threads model of parallel programming, a single process can have
multiple, concurrent execution paths.
 Perhaps the most simple analogy that can be used to describe threads is the
concept of a single program that includes a number of subroutines.
4. Distributed Memory / Message Passing Model

 This model
demonstrates
the following
characteristics:
o A set of
tasks that
use their
own
local
memory
during
computat
ion.
Multiple
tasks can
reside on
the same physical machine and/or across an arbitrary number of
machines.
o Tasks exchange data through communications by sending and receiving
messages.
o Data transfer usually requires cooperative operations to be performed by
each process. For example, a send operation must have a matching
receive operation.
5.Data Parallel
Model
 The data parallel
model demonstrates
the following
characteristics:
o Most of the
parallel work
focuses on
performing
operations on
a data set. The
data set is
typically

organized into a common structure, such as an array or cube.
o A set of tasks work collectively on the same data structure, however,
each task works on a different partition of the same data structure.
o Tasks perform the same operation on their partition of work, for
example, "add 4 to every array element".
 On shared memory architectures, all tasks may have access to the data structure
through global memory. On distributed memory architectures the data structure
is split up and resides as "chunks" in the local memory of each task.
6.Hybrid Model
 A hybrid
model
combines
more than
one of the
previously
described
programm
ing
models.
 Currently,
a common
example
of a
hybrid model is the combination of the message passing model (MPI) with the
threads model .
 This hybrid model lends itself well to the increasingly common hardware
environment of clustered multi/many-core machines.
 Another similar and increasingly popular example of a hybrid model is using
MPI with GPU (Graphics Processing Unit) programming.
7.SPMD and MPMD
Single Program Multiple Data (SPMD):

 SPMD is actually a "high level" programming model that can be built upon any
combination of the
previously mentioned
parallel programming
models.
 SINGLE PROGRAM:
All tasks execute their
copy of the same
program simultaneously. This program can be threads, message passing, data
parallel or hybrid.
 MULTIPLE DATA: All tasks may use different data
 SPMD programs usually have the necessary logic programmed into them to
allow different tasks to branch or conditionally execute only those parts of the
program they are designed to execute. That is, tasks do not necessarily have to
execute the entire program - perhaps only a portion of it.
 The SPMD model, using message passing or hybrid programming, is probably
the most commonly used parallel programming model for multi-node clusters.
Multiple Program Multiple Data (MPMD):
 Like SPMD, MPMD is actually a "high level" programming model that can be
built upon any
combination of the
previously mentioned
parallel programming
models.
 MULTIPLE
PROGRAM: Tasks
..may execute different programs simultaneously. The programs can be threads,
message passing, data parallel or hybrid.
 MULTIPLE DATA: All tasks may use different data
 MPMD applications are not as common as SPMD applications, but may be
better suited for certain types of problems, particularly those that lend
themselves better to functional decomposition than domain decomposition .
1.Automatic vs. Manual Parallelization

 Designing and developing parallel programs has characteristically been a very
manual process. The programmer is typically responsible for both identifying
and actually implementing parallelism.
 Very often, manually developing parallel codes is a time consuming, complex,
error-prone and iterative process.
 For a number of years now, various tools have been available to assist the
programmer with converting serial programs into parallel programs. The most
common type of tool used to automatically parallelize a serial program is a
parallelizing compiler or pre-processor.
 A parallelizing compiler generally works in two different ways:
o Fully Automatic
o Programmer Directed
 If you are beginning with an existing serial code and have time or budget
constraints, then automatic parallelization may be the answer.
2.Understand the Problem and the Program
 Undoubtedly, the first step in developing parallel software is to first understand
the problem that you wish to solve in parallel. If you are starting with a serial
program, this necessitates understanding the existing code also.
 Before spending time in an attempt to develop a parallel solution for a problem,
determine whether or not the problem is one that can actually be parallelized.
3.Partitioning
 One of the first steps in designing a parallel program is to break the problem
into discrete "chunks" of work that can be distributed to multiple tasks. This is
known as decomposition or partitioning.
 There are two basic ways to partition computational work among parallel
tasks: domain decomposition and functional decomposition.
a. Domain Decomposition:
 In this type of partitioning, the data associated with a problem is decomposed.
Each parallel task then works on a portion of of the data.

b. Ecosystem Modeling
Each program calculates the population of a given group, where each group's
growth depends on that of its neighbors. As time progresses, each process
calculates its current state, then exchanges information with the neighbor
populations.
c. Signal Processing
An audio signal data set is passed through four distinct computational filters.
Each filter is a separate process. The first segment of data must pass through
the first filter before progressing to the second. When it does, the second
segment of data passes through the first filter. By the time the fourth segment
of data is in the first filter, all four tasks are busy.

d. Climate Modeling
Each model component can be thought of as a separate task. Arrows represent
exchanges of data between components during computation: the atmosphere
model generates wind velocity data that are used by the ocean model, the ocean
model generates sea surface temperature data that are used by the atmosphere
model, and so on.
4.Communications
Who Needs Communications?
The need for communications between tasks depends upon your problem:
 We DON'T need communications
o Some types of problems can be decomposed and executed in parallel
with virtually no need for tasks to share data. For example, imagine an
image processing operation where every pixel in a black and white
image needs to have its color reversed. The image data can easily be
distributed to multiple tasks that then act independently of each other to
do their portion of the work.

o These types of problems are often called embarrassingly
parallel because they are so straight-forward. Very little inter-task
communication is required.
 We need communications
o Most parallel applications are not quite so simple, and do require tasks to
share data with each other.
Dependency factors:
 Cost of communications
o Inter-task communication virtually always implies overhead.
o Machine cycles and resources that could be used for computation are
instead used to package and transmit data.
o Communications frequently require some type of synchronization
between tasks, which can result in tasks spending time "waiting" instead
of doing work.
o Competing communication traffic can saturate the available network
bandwidth, further aggravating performance problems.
 Latency vs. Bandwidth
o latency is the time it takes to send a minimal (0 byte) message from
point A to point B. Commonly expressed as microseconds.
o bandwidth is the amount of data that can be communicated per unit of
time. Commonly expressed as megabytes/sec or gigabytes/sec.
o Sending many small messages can cause latency to dominate
communication overheads. Often it is more efficient to package small
messages into a larger message, thus increasing the effective
communications bandwidth.
 Visibility of communications
o With the Message Passing Model, communications are explicit and
generally quite visible and under the control of the programmer.
o With the Data Parallel Model, communications often occur transparently
to the programmer, particularly on distributed memory architectures. The
programmer may not even be able to know exactly how inter-task
communications are being accomplished.
 scope of communications
o Knowing which tasks must communicate with each other is critical
during the design stage of a parallel code. Both of the two scopings
described below can be implemented synchronously or asynchronously.
o Point-to-point - involves two tasks with one task acting as the
sender/producer of data, and the other acting as the receiver/consumer.

o Collective - involves data sharing between more than two tasks, which
are often specified as being members in a common group, or collective.
Some common variations (there are more):
 Efficiency of communications
o Very often, the programmer will have a choice with regard to factors that
can affect communications performance. Only a few are mentioned here.
o Which implementation for a given model should be used? Using the
Message Passing Model as an example, one MPI implementation may be
faster on a given hardware platform than another.
o What type of communication operations should be used? As mentioned
previously, asynchronous communication operations can improve
overall program performance.
o Network media - some platforms may offer more than one network for
communications.
5.Data Dependencies
Definition:
 A dependence exists between program statements when the order of statement
execution affects the results of the program.
 A data dependence results from multiple use of the same location(s) in storage
by different tasks.
 Dependencies are important to parallel programming because they are one of
the primary inhibitors to parallelism.

6.Load Balancing
 Load balancing refers to the practice of distributing work among tasks so
that all tasks are kept busy all of the time. It can be considered a minimization
of task idle time.
 Load balancing is important to parallel programs for performance reasons. For
example, if all tasks are subject to a barrier synchronization point, the slowest
task will determine the overall performance.

7.Granularity
Computation / Communication Ratio:
 In parallel computing, granularity is a qualitative measure of the ratio of
computation to communication.
 Periods of computation are typically separated from periods of communication
by synchronization events.
Fine-grain Parallelism:
 Relatively small amounts of computational work are done
between communication events
 Low computation to communication ratio
 Facilitates load balancing
 Implies high communication overhead and less opportunity
for performance enhancement
 If granularity is too fine it is possible that the overhead
required for communications and synchronization between
tasks takes longer than the computation.
Coarse-grain Parallelism:
 Relatively large amounts of computational work are done
between communication/synchronization events
 High computation to communication ratio
 Implies more opportunity for performance increase
 Harder to load balance efficiently.
8.Performance Analysis and Tuning

 As with debugging, monitoring and analyzing parallel program execution is
significantly more of a challenge than for serial programs.
 A number of parallel tools for execution monitoring and program analysis are
available.
 Some are quite useful; some are cross-platform also.
Parallel Examples
1.Array Processing
 This example demonstrates calculations on 2-dimensional array elements, with the
computation on each array element being independent from other array elements.
 The serial program calculates one element at a time in sequential order.
 Serial code could be of the form:
 The calculation of elements is independent of one another - leads to an embarrassingly parallel
situation.
 The problem should be computationally intensive.
2.PI Calculation
 The value of PI can be calculated in a number of ways. Consider the following method of
approximating PI
1. Inscribe a circle in a square
2. Randomly generate points in the square
3. Determine the number of points in the square that are also in the circle
4. Let r be the number of points in the circle divided by the number of points in the
square
5. PI ~ 4 r
3.Simple Heat Equation

 Most problems in parallel computing require
communication among the tasks. A number of
common problems require communication with
"neighbor" tasks.
 The heat equation describes the temperature
change over time, given initial temperature
distribution and boundary conditions.
 A finite differencing scheme is employed to
solve the heat equation numerically on a square
region.
 The initial temperature is zero on the boundaries
and high in the middle.
 The boundary temperature is held at zero.
 For the fully explicit problem, a time stepping
algorithm is used. The elements of a 2-
dimensional array represent the temperature at
points on the square.
 The calculation of an element is dependent upon
neighbor element values.
 A serial program would contain code like:
4.1-D Wave Equation
 In this example, the amplitude along a uniform, vibrating string is calculated
after a specified amount of time has elapsed.
 The calculation involves:
o the amplitude on the y axis
o i as the position index along the x axis
o node points imposed along the string
o update of the amplitude at discrete time steps.

Parallel computing persentation

Parallel computing persentation

More Related Content

What's hot (20)

Viewers also liked (20)

Similar to Parallel computing persentation (20)

More from VIKAS SINGH BHADOURIA (20)

Recently uploaded (20)

Parallel computing persentation