Week 1 : Theoretical models: PRAM, interconnection networks
Week 2 : Performance of parallel algorithms,Basic techniques
Week 3 : Basic techniques
Week 4 : Comparator Networks.
Week 5 : Optimal List ranking, applications
Week 6 : Algorithms for searching, merging and sorting. Cole’s Merge Sort
Week 7 : Cole’s Merge Sort(cont’d), Graph algorithms
Week 8 : Graph algorithms (cont’d)
Week 9 : Sorting in meshes, Hypercube algorithms, Butterfly network, CCC, Benes network
Week 10 : Butterfly network, CCC, Benes network etc
Week 11 : Limits to parallelizability. Lower bounds
Week 12 : Limits to parallelizability. NC-reductions, P-completeness.