Birla Institute of Technology & Science, Pilani  Hyderabad
Parallel Computing
CS F422

Fall 2014
Suppose it takes 3 units of time to assemble a widget.
Furthermore, suppose the assembly consists of three steps A, B, and C and each step requires exactly
one unit of time.
What is the amount of time to build n widgets sequentially, using pipelined assem
Birla Institute of Technology & Science, Pilani  Hyderabad
Parallel Computing
CS F422

Fall 2014
Strassen algorithm
From Wikipedia, the free encyclopedia
In the mathematical discipline of linear algebra, the Strassen algorithm, named after Volker Strassen, is an algorithm used
for matrix multiplication. It is faster than the standard matrix multiplic
Birla Institute of Technology & Science, Pilani  Hyderabad
Parallel Computing
CS F422

Fall 2014
Parallel Graph Coloring
Slides adapted by S Gokul Kannan
Courtesy: Illinious State University
1
Presentation Overview
Problem Description
Basic Algorithm
Parallel Strategy
Performance
2
Problem Description
A "graph" is a collection of vertices or 'nodes'
Birla Institute of Technology & Science, Pilani  Hyderabad
Parallel Computing
CS F422

Fall 2014
PRAM Algorithms
Prefix Sums
Slides adapted by S Gokul Kannan
1
Topics
Prefix sum on CREW PRAM
Prefix sum on EREW PRAM
Costoptimal Prefix Sum computation
List Packing
2
Definition: Prefix Sums
Given a set of n values a1, a2,
an and an associative operati
Birla Institute of Technology & Science, Pilani  Hyderabad
Parallel Computing
CS F422

Fall 2014
PRAM Algorithm
Slides adapted by S Gokul Kannan
PREORDER TREE
TRAVERSAL
Preorder Tree Traversal
Reduce a complicatedlooking problem into simpler one for which a
fast parallel algorithm is already known.
Recursive Algorithm
PREORDER.TRAVERSAL (nodeptr)
b
Birla Institute of Technology & Science, Pilani  Hyderabad
Parallel Computing
CS F422

Fall 2014
Sorting Algorithms
Ananth Grama, Anshul Gupta, George Karypis, and Vipin Kumar
To accompany the text `Introduction to Parallel Computing',
Addison Wesley, 2003.
Slides adapted by S Gokul Kannan
Topic Overview
Issues in Sorting on Parallel Computers
Sort
Birla Institute of Technology & Science, Pilani  Hyderabad
Parallel Computing
CS F422

Fall 2014
PRAM Algorithms
List Ranking
Slides adapted by S Gokul Kannan
1
LIST RANKING
2
Linked List Ranking
Given a linked list, stored in an array,
compute the distance of each element
from the end (either end) of the list.
Problem is similar to prefix sums,
us
Birla Institute of Technology & Science, Pilani  Hyderabad
Parallel Computing
CS F422

Fall 2014
PRAM Algorithm
Slides adapted by S Gokul Kannan
MERGING TWO SORTED LISTS
Introduction
Many PRAM algorithms achieve low time complexity by performing
more operations than an optimal RAM algorithm.
Serial Algorithm = O(n)
Algorithm
Assume distinct values
Birla Institute of Technology & Science, Pilani  Hyderabad
Parallel Computing
CS F422

Fall 2014
Department of Computer Science and Information Systems
11th September, 2014
NOTICE
SUB: CS C422/CS F422 Parallel Computing Test1 Notice
Dear CS C422/CS F422 Students,
Parallel Computing (CS C422/CS F422) Test1 is a Closed Book exam. The following
chapte
Birla Institute of Technology & Science, Pilani  Hyderabad
Parallel Computing
CS F422

Fall 2014
Graph Algorithms
Ananth Grama, Anshul Gupta, George
Karypis, and Vipin Kumar
To accompany the text `Introduction to Parallel Computing', Addison Wesley, 2003
Slides adapted by Gokul Kannan S
(Original version of the slides belong to Ananth Grama and Alexa
Birla Institute of Technology & Science, Pilani  Hyderabad
Parallel Computing
CS F422

Fall 2014
BIRLA INSTITUTE OF TECHNOLOGY & SCIENCE, PILANI
Hyderabad Campus
FIRST SEMESTER 2014  2015
COURSE HANDOUT (PART II)
01082014
In addition to Part I (General Handout for all courses appended to the timetable) this portion gives further
specific details r
Birla Institute of Technology & Science, Pilani  Hyderabad
Parallel Computing
CS F422

Fall 2014
Graph Algorithms
Ananth Grama, Anshul Gupta, George
Karypis, and Vipin Kumar
To accompany the text `Introduction to Parallel Computing', Addison Wesley, 2003
Slides adapted by Gokul Kannan S
(Original version of the slides belong to Ananth Grama and Alexa
Birla Institute of Technology & Science, Pilani  Hyderabad
Parallel Computing
CS F422

Fall 2014
Graph Algorithms
Ananth Grama, Anshul Gupta, George
Karypis, and Vipin Kumar
To accompany the text `Introduction to Parallel Computing', Addison Wesley, 2003
Slides adapted by Gokul Kannan S
(Original version of the slides belong to Ananth Grama and Alexa
Birla Institute of Technology & Science, Pilani  Hyderabad
Parallel Computing
CS F422

Fall 2014
Graph Algorithms
Ananth Grama, Anshul Gupta, George
Karypis, and Vipin Kumar
To accompany the text `Introduction to Parallel Computing', Addison Wesley, 2003
Slides adapted by Gokul Kannan S
(Original version of the slides belong to Ananth Grama and Alexa
Birla Institute of Technology & Science, Pilani  Hyderabad
Parallel Computing
CS F422

Fall 2014
Dense Matrix Algorithms
Ananth Grama, Anshul Gupta,
George Karypis, and Vipin Kumar
To accompany the text Introduction to Parallel Computing,
Addison Wesley, 2003.
Slides adapted by S Gokul Kannan
Topic Overview
MatrixVector Multiplication
MatrixMatri
Birla Institute of Technology & Science, Pilani  Hyderabad
Parallel Computing
CS F422

Fall 2014
Sorting Algorithms
Ananth Grama, Anshul Gupta, George Karypis, and Vipin Kumar
To accompany the text `Introduction to Parallel Computing',
Addison Wesley, 2003.
Slides adapted by Gokul Kannan S
Topic Overview
Issues in Sorting on Parallel Computers
Sort
Birla Institute of Technology & Science, Pilani  Hyderabad
Parallel Computing
CS F422

Fall 2014
Sorting Algorithms
Ananth Grama, Anshul Gupta, George Karypis, and Vipin Kumar
To accompany the text `Introduction to Parallel Computing',
Addison Wesley, 2003.
Slides adapted by Gokul Kannan S
(Original version of the slides belong to Ananth Grama and Al
Birla Institute of Technology & Science, Pilani  Hyderabad
Parallel Computing
CS F422

Fall 2014
Sorting Algorithms
Ananth Grama, Anshul Gupta, George Karypis, and Vipin Kumar
To accompany the text `Introduction to Parallel Computing',
Addison Wesley, 2003.
Slides adapted by Gokul Kannan S
(Original version of the slides belong to Ananth Grama and Al
Birla Institute of Technology & Science, Pilani  Hyderabad
Parallel Computing
CS F422

Fall 2014
Dense Matrix Algorithms
Slides adapted by S Gokul Kannan
To accompany the text Introduction to Parallel Computing,
Addison Wesley, 2003.
Topic Overview
MatrixVector Multiplication
MatrixMatrix Multiplication
Matix Algorithms: Introduction
Due to thei
Birla Institute of Technology & Science, Pilani  Hyderabad
Parallel Computing
CS F422

Fall 2014
Sorting Algorithms
Ananth Grama, Anshul Gupta, George Karypis, and Vipin Kumar
To accompany the text `Introduction to Parallel Computing',
Addison Wesley, 2003.
Slides adapted by Gokul Kannan S
(Original version of the slides belong to Ananth Grama and Al
Birla Institute of Technology & Science, Pilani  Hyderabad
Parallel Computing
CS F422

Fall 2014
Parallel Computing Platforms
Adapted from slides of (Ananth Grama, Anshul Gupta, George Karypis, and Vipin
Kumar)
Topic Overview
Implicit Parallelism: Trends in Microprocessor
Architectures
Limitations of Memory System Performance
Dichotomy of Parallel
Birla Institute of Technology & Science, Pilani  Hyderabad
Parallel Computing
CS F422

Fall 2014
Analytical Modeling of Parallel Systems
Ananth Grama, Anshul Gupta, George Karypis, and Vipin Kumar
To accompany the text `Introduction to Parallel Computing',
Addison Wesley, 2003.
Slides adapted by S Gokul Kannan
Topic Overview
Sources of Overhead in P
Birla Institute of Technology & Science, Pilani  Hyderabad
Parallel Computing
CS F422

Fall 2014
Analytical Modeling of Parallel Systems
Ananth Grama, Anshul Gupta, George Karypis, and Vipin Kumar
To accompany the text `Introduction to Parallel Computing',
Addison Wesley, 2003.
Slides adapted by S Gokul Kannan
Topic Overview
Sources of Overhead in P
Birla Institute of Technology & Science, Pilani  Hyderabad
Parallel Computing
CS F422

Fall 2014
Analytical Modeling of Parallel Systems
Ananth Grama, Anshul Gupta, George Karypis, and Vipin Kumar
To accompany the text `Introduction to Parallel Computing',
Addison Wesley, 2003.
Slides adapted by S Gokul Kannan
Topic Overview
Sources of Overhead in P
Birla Institute of Technology & Science, Pilani  Hyderabad
Parallel Computing
CS F422

Fall 2014
Principles of Parallel Algorithm Design
Ananth Grama, Anshul Gupta, George Karypis, and Vipin Kumar
To accompany the text Introduction to Parallel Computing,
Addison Wesley, 2003.
Slides adapted by S Gokul Kannan
Chapter Overview: Algorithms and Concurren
Birla Institute of Technology & Science, Pilani  Hyderabad
Parallel Computing
CS F422

Fall 2014
Principles of Parallel Algorithm Design
Ananth Grama, Anshul Gupta, George Karypis, and Vipin Kumar
To accompany the text Introduction to Parallel Computing,
Addison Wesley, 2003.
Adapted by S Gokul Kannan
Chapter Overview: Algorithms and Concurrency
Int
Birla Institute of Technology & Science, Pilani  Hyderabad
Parallel Computing
CS F422

Fall 2014
Parallel Computing Platforms
Adapted from slides of (Ananth Grama, Anshul Gupta, George Karypis, and Vipin
Kumar)
Topic Overview
Implicit Parallelism: Trends in Microprocessor
Architectures
Limitations of Memory System Performance
Dichotomy of Parallel