8/3/2019 CSIS_C422-sem2-11_12

1/3

BIRLA INSTITUTE OF TECHNOLOGY & SCIENCE, PILANI

K K BIRLA, GOA CAMPUS

SECOND SEMESTER 2011-2012

COURSE HANDOUT (PART-II)

In addition to Part I (General Handout for all courses append to the Time Table),

This portion gives further specific details regarding the course.

Course No. : CS/IS C422

Course Title : Parallel Computing

Instructor-in-Charge : Bharat Deshpande

Course Description:Introduction to parallel computing; Models of parallel computers; Interconnection

networks, basic communication operations; Introduction to parallel algorithms; Parallelprogramming paradigms; issues in implementing algorithms on parallel computers;

Parallel programming with message passing interface; Performance analysis; Scalabilityanalysis; Basic design technique for parallel algorithms; Parallel algorithms for selected

topics like sorting, searching and merging, matrix algebra, graphs.

Scope & Objective:Parallel computing architectures have emerged as alternative to high performance

computing using powerful single processor machines. Sequential algorithms i.e.,algorithms designed for single processor machine, do not harness the full potential of a

parallel machine and hence the need to device parallel algorithms. Parallel algorithms arehighly architecture dependent. Moreover, for a given problem, some parallel architectures

are better suited than others. Therefore, it is necessary to study parallel architectures andtechniques for designing efficient parallel algorithms .

Text Books:

T1. Ananth Grama, Anshul Gupta, George Karypis & Vipin Kumar, Introduction to

Parallel Computing, Second Edition, Pearson Education, First Indian Reprint 2004.

Reference Books:

R1. M.J. Quinn, Parallel Computing : Theory & Practice, McGraw Hill Inc. 2nd

Edition (1994)

R2. F. Thomson Leighton, Introduction to Parallel Algorithms and Architectures :Arrays, Trees, Hypercubes, Morgan Kaufmann Publishers (1992).

8/3/2019 CSIS_C422-sem2-11_12

2/3

Course Plan:

Lecture

No.

Learning Objectives Topics to be covered Reference to

text/ref. book

1

Introducing Parallel

Algorithms, studyingalgorithms, minimizing

number of processors.

Introduction to parallel

processing and parallelprocessing terminology

R1 Section

1.1,1.2 & 1.3

2,3 Contrast between DataParallelism & Control

Parallelism

R1 Section 1.3& 1.4

4-6 PRAM algorithms, (parallel

reduction, prefix sums, listranking etc.)

R1 Section 2.3

7 PRAM Sorting Algorithms Class Notes

8,9 Parallel Programming Platforms T1 Section 2.1

2.3

10 Physical Organization ofparallel computer

T1 Section 2.4

11-13 Routing in parallel computer T1 Section2.5-2.6

14-16Studying different

organizations, mappingsbetween them, data

decomposition and

Processor-Processor mapping &mapping techniques

T1 Section 2.7

17 - 19 Decomposition Techniques T1 Section3.1,3.2

20 Task Mapping T1 Section 3.3

20,21

Performance metrics forparallel systems

Performance metrics for parallelsystem

T1 Section5.1, 5.2

22,23 Isoefficeincy function &scalability issues

T1 Section5.3, 5.4

24,25 Other scalability metrics T1 Section5.5, 5.6

26 Simple parallel algorithms on

mesh and hypercube

R1 Chapter 6

27-30

Studying & Analyzing

parallel versions ofstandard sequential

algorithms on differentprocessor organizations

Parallel Matrix Algorithms:

Matrix Multiplication, SolvingSystem of Linear Equations

T1 Chapter 8

31-35 Sorting Algorithms on mesh andhypercube

Class Notes +T1 Chapter 9

36 - 40 Parallel Graph Algorithms:Prims, Dijkstras Algorithm

etc.

T1 Section10.1 10.4

8/3/2019 CSIS_C422-sem2-11_12

3/3

Chamber Consultation Hour: To be announced in class.

Notices: All announcements will be displayed on CS/IS Notice Board.

Make-Up: Make-Up will be given only in genuine cases.

Evaluation Scheme:

Sl. No. Component Duration Weightage Date,Time &Venue

Nature

1 Test I 60 mins. 25% Refer Time Table Closed Book

2 Test II 60 mins. 25% Refer Time Table Open Book

3 Comprehensive 3 hours 50% Refer Time Table Closed Book

Instructor-in-Charge, CS/IS C422