CS 701 : High Performance Computing July-December 2013 Course Plan

Instructor Work phone Email Target Audience Prerequisites Duration Credits Prepared by : Dr.P.Santhi Thilagam : 0824-2474000 Extn: 3404 : santhi@nitk.ac.in : Postgraduates in Computer Science & Engineering : Computer Networks, Data Structures and Algorithms, Distributed Systems, Computer Architecture : 40-45 hours : (3-0-2) : Dr.P.Santhi Thilagam Asso.Professor Dept of Computer Science & Engg, NITK-Surathkal

Assessment Pattern: Tutorials and quizzes 25%, Midterm exam is 25%, individual project is 10% and final exam is 40%. Course Description: This course will introduce students to the design, analysis, and implementation, of high performance computational science and engineering applications. The course focuses on advanced computer architectures, parallel algorithms, parallel languages, and performance-oriented computing. Students will develop knowledge and skills concerning: the key factors affecting performance of CSE applications, and mapping of applications to high-performance computing systems, and hardware/software co-design for achieving performance on real-world application

Course Schedule
Week 1 : Fundamental concepts in High Performance Computing Week 2: Shared memory architectures Week 3 Distributed memory architectures, Week 4: Shared memory programming (OpenMP) Week 5: Message passing programming (MPI) Week 6: Parallel decomposition Week 7: Hardware, compilers and performance programming Week 8: Performance measurement and estimation Week 9: Building and Running Parallel Applications Week 8: Distributed Memory Programming Hadoop Week 9: High performance computing using Map Reduce,

Weeks 10 and 11: Parallel Performance Week 12: Cluster, Grid computing Week 13 & 14: Clod Computing Textbook & References : 1. Parallel Programming in C with MPI and OpenMP, by Michael J. Quinn 2. Grama, A. Gupta, G. Karypis, V. Kumar, An Introduction to Parallel Computing, Design and Analysis of Algorithms: 2/e, Addison-Wesley, 2003. 3. G.E. Karniadakis, R.M. Kirby II, Parallel Scientic Computing in C++ and MPI: A Seamless Approach to Parallel Algorithms and their Implementation, Cambridge University Press, 2003. 4. Wilkinson and M. Allen, Parallel Programming: Techniques and Applications Using Networked Workstations and Parallel Computers, 2/E, Prentice Hall, 2005. 5. M.J. Quinn, Parallel Programming in C with MPI and OpenMP, McGraw-Hill, 2004. 6. G.S. Almasi and A. Gottlieb, Highly Parallel Computing, 2/E, Addison-Wesley, 1994. 7. J. Dongarra, I. Foster, G. Fox, W. Gropp, K. Kennedy, L. Torczon, A. White, editors, The Sourcebook of Parallel Computing, Morgan Kaufmann, 2002.

Sample Project title Classification problem using KNN algorithm in hadoop map reduce Implementation of cache coherence protocol Parallelizing travelling salesman problem using genetic algorithm Solving travelling salesman problem using MPI Topological mapping in Multiprocessors and Processor Arrays Biotonic across cluster with MPI Solving N queens problem using MPI Conway's game of life using MPI Sieve of eratothenes problem Parallel implementation of Prim's minimium spanning tree using MPI Solving N queens problem using OpenMPI Generation of prime numbers of large range using MPI Solving sudoku in parallel environment using HPC Quicksort using OpenMPI Circuit satisfiability problem Radix Sort Quick Hull Parallelization using Open MPI Parallel alpha and beta search in game trees Parallelizing 0-1 knapsack using OpenMP Parallelizing shell sort using OpenMP Connected component in a graph Parallelization of kmp string matching algorithm

Parallelization of linear time sorting algorithm using OpenMP Parallel implementation of solving linear systems using gaussian elimination Parallelization of Dijkstra's algorithm using OpenMP Sparse matrix-dense vextor multiplication Parallel genetic search Memory stream multiplexer K means clustering Scalable graph coloring algorithm for distributed memory computer