CSE633: Parallel Computing
Spring 2019
Tuesday/Thursday, 2:00p - 3:20p, Talbert 113
Prof. Russ Miller
The focus of this course will be on experimental (hands-on) parallel computing.
Each student is responsible for a semester-long project.
Grading will be based on the project, as well as two PPT-type
talks covering the project.
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: There will be a cap on the number of students allowed to enroll in the
course, so that those who are enrolled will have a full experience and
educational opportunity.
- Dr. Matt Jones (CCR) presented material covering
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.
Please see presentations on MPI, OpenMP, and SLURM at
CCR.
- HPC, Computational Science & Engineering, Shake-and-Bake, and 21st Century Academia, Russ Miller.
- Parallelizing Maximum Sum Subsequence, Srinivas Rishindra Pothireddi.
- Parallel Algorithms K-Means Clustering, Divya Srivastava.
- Distributed K-core decomposition using MPI, Penghang Liu.
- Calculation of Maximal Overlaps, John Rivera.
- Matrix Multiplication in Parallel, Varsha Ganesh.
- Smith-Waterman Algorithm in Parallel, Jian Chen.
- Parallel Implementation of Floyd-Warshall Algorithm, Asmita Gautam.
- String Matching using MPI, Niranjan Mirashi.
- Parallel Quicksort, Sri Abinaya.
- Image Compression using k-Means Clustering, Utkarsh Bansal.
- Parallel Implementation of Bitonic Sort - Using MPI, Srinath Vikramakumar.
- Image Segmentation using K-Means Algorithm, Aniket R. Rane.
- Shortest Pair Point Algorithm, Yifu Yin.