Performance Evaluation of Parallel Computers-Parallel Processing-Lecture Slides, Slides of Parallel Computing and Programming

Prof. Bhairav Gupta delivered this lecture at Ankit Institute of Technology and Science for Parallel Processing course. It includes: Performance, Evaluation, Parallel, Computers, Hypercube, Overheads, Balance, Point, Interprocess, Intertask

Typology: Slides

2011/2012

Uploaded on 07/23/2012

paramita
paramita 🇮🇳

4.6

(16)

120 documents

1 / 23

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Performance Evaluation of Parallel
Computers
Example: Adding numbers on Hypercube
docsity.com
pf3
pf4
pf5
pf8
pf9
pfa
pfd
pfe
pff
pf12
pf13
pf14
pf15
pf16
pf17

Partial preview of the text

Download Performance Evaluation of Parallel Computers-Parallel Processing-Lecture Slides and more Slides Parallel Computing and Programming in PDF only on Docsity!

Performance Evaluation of Parallel

Computers

Example: Adding numbers on Hypercube

Performance Evaluation of Parallel Computers

Parallel SpeedUp Performance

Laws

  • Amdahl’s Law• Gustafson’s law• Sun & Li’s Law

Amdahl’s Law

Amdahl’s Law……cont’d

Gustafson’s law

Gustafson’s law…..cont’d

Performance

Measurement Tools

Performance Measurement Tools:

Utilization Displays

Performance Measurement Tools:

Communication Displays

Performance Measurement Tools:

Task Displays

From Previous Lecture:Algorithm for Prefix-Sum

on Hypercube

All-to-all broadcast on a Hypercube

All-to-all broadcast on a

d

-dimensional hypercube.

The Prefix-Sum Operation on Hypercube •^

The operation can be implemented using the all-to-allbroadcast kernel.

-^

We must account for the fact that in prefix sums thenode with label

k

uses information from only the

k

-node

subset whose labels are less than or equal to

k

•^

This is implemented using an additional result buffer.The content of an incoming message is added to theresult buffer only if the message comes from a node witha smaller label than the recipient node.

-^

The contents of the outgoing message (denoted byparentheses in the figure) are updated with everyincoming message.