 |
Slides
of Course Introduction |
 | Parallel Computation Models:
 | Shared Memory Model |
 | Interconnection
Network Slides
[PDF]
 | Linear Arrays and Rings |
 | Meshes |
 | Trees |
 | Meshes of Trees |
 | Pyramid |
 | Shuffle-Exchange |
 | Hypercubes |
 | Cube-Connected Cycles |
 | De Bruijn |
 | Star |
|
 | Combinational Circuits |
|
 |
Parallel Algorithms Examples & Concepts
Slides
[PDF] |
 | Divide and Conquer Paradigm
 | PRAM Binary Search |
 | Merging |
|
 | Sorting on Linear Arrays
 | By Comparison-Exchange |
 | By Merging |
|
 | Odd-Even Mergesort Combinational Circuit |
 | Randomized Parallel Algorithms
|
 | Pointer-based Data
Structures
 | Pinter Jumping as a Design Technique
|
 | Computations on Linked Lists
 | Prefix Computations |
 | Ranking & Sequencing lists |
 | Euler Tour on Directed trees |
 | Basic Tree computations |
|
|
 | PRAM Simulation on
Distributed Network |
 | Parallel Complexity
Classes
 | NIck's Class |
 | P-Complete |
|