King Fahd University of Petroleum & Minerals - Home Page

Information & computer Sciences Department

ICS 556

Parallel Algorithms

Winter 2007

Home

What's New

Handouts

 Exams

Assignments

Covered Topics

Links

 

Covered Topics

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
Maximal Matching: Simple Randomized Parallel Algorithms for Finding a Maximal Matching in an Undirected  Graph, by S. Yang, S. Dhall, and S. Lakshmivarahan
Maximal Independent Set: A Simple Parallel Algorithm for the Maximal Independent Set Problem, by M. Luby, 1985.
Permutation Routing on Hypercube, Motwani and Raghvan's textbook: Randomized Algorithm

The Choice Coordination Problem:

The Choice-Coordination Problem: Notes for a Correctness Proof, Probabilistic Systems Group, 1996.

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