Unit – I
Introduction to Parallel Computers- SIMD - EREW, CREW - SM-SIMD algorithms - Shared memory SIMD - Tree and mesh interconnection computers.
Unit – II
Sorting- Sorting on a linear array - Sorting on a mesh - Sorting on EREW SIMD computer - MIMD enumeration sort - MIMD quick sort - Sorting on other networks.
Unit – III
Matrix operations- Mesh transpose - Shuffle transpose - EREW transpose - Mesh multiplication - Cube multiplication - Matrix by vector multiplication - Tree multiplication.
Unit – IV
Numerical problems- Linear equations - SIMD algorithm - Roots of nonlinear equations - MIMD algorithm - Partial differential equations - Computing Eigen values.
Unit – V
Graph problems- Computing the connectivity matrix - Finding connected components - Traversal - Minimal alpha-beta tree - Storage requirements.