CS273: Foundations of Parallel and Distributed Computation

INSTRUCTOR: Satish Rao (satishr@cs.berkeley.edu)
TIME: Tuesday, Thursday 12:30-2:00
PLACE: 405 Soda
Fundamental theoretical issues in designing parallel algorithms and architectures and topics in distributed networks. Shared memory models of parallel computation. Parallel algorithms. Routing algorithms for networks like hypercubes, meshes and butterfly. Fundamentals of routing for general netowrks. Contention resolution. Algorithms for object location in distributed networks.

Administration

Course Information

Notes and/or (required) readings.

Lecture Notes On Two Choices
Lectures 2 and 3
Lectures 4 and 5
Load Balancing and PRAM Simulations
Packet Scheduling (Levelled Networks and Delay Sequences)
Packet Scheduling (Arbitrary Networks)
More Packet Scheduling/Path Selection
Path Selection: arbitary networks
PRAM Intro: Work-Depth Model. List ranking. See Blelloch-Maggs paper.
PRAM: List ranking. Ranade's notes on list ranking.
Ranade's notes on connected components.
Evaluation of Straigtline Code: Miller and Ramachandran.
The DRAM Model: Conservative algorithms.
Ranade's notes on VLSI.
Ranade's notes on VLSI Lower Bounds.
Feige's Leader Election Paper.
Lamport et.al.'s Byzantine General Paper.
Compact Routing Tables - Awerbuch-Peleg.
Tapestry - Ben Zhao. (pdf)
Tapestry - Ben Zhao. (Html- Requires IE)
Distributed Algorithms for Breadth First Search - Awerbuch.
Optimization Problems in Congestion Control - Karp et.al..

Readings and Reference Material.

Randomized routing and sorting on fixed-connection networks. F. T. Leighton, B. M. Maggs, S. B. Rao, and A. G. Ranade, Journal of Algorithms, Vol. 17, No. 1, July 1994, pp. 157-205.
Packet routing and job-shop scheduling in O(congestion+dilation) steps. F. T. Leighton, B. M. Maggs, and S. B. Rao, Combinatorica, Vol. 14, No. 2, 1994, pp. 167-180.
"Parallel Algorithms," Guy Blelloch, Bruce Maggs
"General Purpose Parallel Computing," Bill McColl
Using Multiple Hash Functions to Improve IP Lookups. A. Broder and M. Mitzenmacher. INFOCOM 2001 (Not final conference paper.