CSE633: Parallel Computing
Spring 2014
Prof. Russ Miller
The focus of this course will be on experimental (hands-on) parallel computing, where each student is responsible for a semester-long project. Historically, grading is based on two PPT talks covering the project, as follows. The first talk provides a brief explanation of the proposed project, goals, expectations, and a timeline of the work to be performed. The second talk provides a summary of accomplishments. Students are encouraged to look at the final talks from previous semesters, available below. Note that a successfully completed project satisfies the requirement for a project in the M.S. program. (The student who completes the project successfully is responsible for filling out the proper paperwork and presenting it to Dr. Miller for a signature.) NB: For this semester, instead of a registration of 6-12 students, there have been as many as 70 students registered for this course, which is the cap defined by the CSE Department. I assume by the time the course starts, there will be on the order of 60 students actually in the course. Currently, I have no clue as to how to teach this highly interactive course that provides all students with ample time for presentations and allows the instructor ample time to discuss advanced theoretical parallel algorithms to 6-12 times the number of students for which this course was designed.
- Talks by Dr. Matt Jones and Cynthia Cornelius, both on staff at CCR,
covered an introduction to CCR and their systems, logging into and submitting jobs to CCR's clusters, MPI programming, OpenMP programming, and debugging, to name a few. Notes on this material may be found at TBA.
- Matrix Inversion using Parallel Gaussian Elimination, Aravindhan Thanigachalam.
- Parallelizing The Chinese Remainder Theorem, Bich Thi-Ngoc Vu.
- Implementation of Parallel Quick Sort using MPI, Deepak Ravishankar Ramkumar.
- Parallel Implementation of Dijkstra's and Bellman Ford Algorithm, Kulkarni, Muthuraman, Pansare, and Kataria.
- Parallel Implementation of Deep Learning Using MPI, Tianle Ma.
- Boids: Flocking Simulations, Shaun Cosgrove.
- Solving Convex Hull Problem in Parallel, Anil Kumar.
- Improving Quicksort Algorithm By Using Parallel Algorithms, Farida Kassamnath and Anup Rawka.
- Parallelized Convolution, Senthil Rajendran.
- Approximating the Temperature Distribution with K means algorithm using MPI, Mangesh Vilas Kaslikar, Vivek Raghuvanshi, Karthick Krishna Ventatakrishnan, and Mohan Upadhaya.
- PARALLELIZED CONVOLUTION, Senthil Rajendran.
- COMPUTING OVERLAPPING LINE SEGMENTS: A parallel approach, Vinoth Selvaraju.
- It's all MOOT: An MPI adventure, Brian F. Haag.
- Line Segment Visibility from Origin, Uthish Balaji.
- MAXIMUM SUM SUBSEQUENCE, Mahak Mukhi and Mohana Bhunekar.
- Matrix Multiplication, Praveen Kumar Bellam.
- PARALLELIZED SUDOKU SOLVING ALGORITHM USING OpenMP, Sruthi Sankar.
- Point Domination Query, Hariharan Kumar.
- Parallel Sudoku Solver using MPI and C, Rohit H. Shreekant.
- Parallelizing Maximum Sum Subsequence, Saket Adusumilli.
- Array Packing Implementation - A Parallel approach, Abhishek Cumbakonam Desikan, Rajesh Balasubramanian, Ramalingam Sankaran, and Aswin Gokulachandran.
- Solving System of Linear Equations, Avinash Paruchuri, Vinod Galla, and Jagadeesh Vallabhaneni.
- Maze Generation and Solving Algorithm, Divya Gorey, Sagar Vishwakarma, Saurabh Warvadekar, and Shubhi Jain.
- Using MPI to Break the Data Encryption Standard, Shane Anderson, Sergey Cherny, Pratik Deshpande, and Aniket Chauhan.
- Parallelizing LU Decomposition, Sai Dekhar Reddy Tummala and Praveen Kumar Bandaru.
- Parallel Implementation of Dijkstra's Algorithm using MPI Library on a Cluster, Aditya Pore.
- Parallel Algorithms K-means Clustering, Andreina Uzcategui.
- N-Body Simulation, Munish Mehra and Devanshu Mukherjee.
- A* Path-Finding with MPI, Thornton Haag-Wolf.
- Parallel Planar Closest Point Pair, Angad Gadre and Piyush Sankla.
- Hyper Quick Sort (Parallel Quick Sort), Prashant Srivastava.
- Bitonic Sort, Amrutha Mullapudi.
- Radix Sort, Narendran Sankaran.