Starting a new Lecture Notes Series on Parallel Algorithms
Youtube Lecture Playlist CreditsChannel Name: NPTEL IIT Guwahati
So Let Us Start to This Journey of Learning
Parallel Algorithms By Lecture Notes together!
Lecture 1: Parallel Algorithms
Lecture 2: Lec 1: Shared Memory Models - 1
Lecture 3: Lec 2: Shared Memory Models - 2
Lecture 4: Lec 3: Interconnection Networks
Lecture 5: Lec 4: Cost and Optimality
Lecture 6: Lec 5: Basic Techniques 1
Lecture 7: Lec 6: Basic Techniques 2
Lecture 8: Lec 7: Basic Techniques 3
Lecture 9: Lec 8: Basic Techniques 4
Lecture 10: Lec 9: Basic Techniques 5
Lecture 11: Lec 10: Odd Even Merge Sort (OEMS)
Lecture 12: Lec 11: OEMS, Bitonic-Sort-Merge Sort (BSMS)
Lecture 13: Lec 12: BSMS, Optimal List Colouring
Lecture 14: Lec 13: Description
Lecture 15: Lec 14: Analysis
Lecture 16: Lec 15: Applications
Lecture 17: Lec 16: Applications
Lecture 18: Lec 17: Fast optimal merge algorithm
Lecture 19: Lec 18: High level Description
Lecture 20: Lec19: Cole's Merge Sort: Details
Lecture 22: Lec21: Sorting Lower bound; Connected Components
Lecture 23: Lec 22: Connected Components (CREW)
Lecture 24: Lec 23: Connected Components, Vertex Colouring
Lecture 25: Lec 24: Sorting on a 2D mesh
Lecture 26: Lec 25: Sorting on a 2D mesh
Lecture 27: Lec 26: Sorting, Offline routing on a 2D mesh
Lecture 28: Lec 27: Sorting on a 3D mesh
Lecture 29: Lec 28: Mesh of Trees, Hypercube
Lecture 30: Lec 29: Hypercube cont'd
Lecture 31: Lec 30: Hypercube cont'd, butterfly network
Lecture 32: Lec 31: Butterfly, CCC and Benes Networks
Lecture 33: Lec 32: Butterfly, CCC and Benes Networks
Lecture 35: Lec 34: SEG, dBG (cont'd)
Lecture 38: Lec 37: Max Flow is P-complete for NC-reductions