CS273: Foundations of Parallel and Distributed Systems

INSTRUCTORS:
Satish Rao (satishr@cs.berkeley.edu)
Office hours: Tu: 3:30-5:00, Wed: 1-2.
Christos Papadimitriou (christos@cs.berkeley.edu)
Office hours: Th: 3:30-5:00, Mon: 1-2.

TIME: Monday, Wednesday 10:30-12: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. Fundamentals of routing for general netowrks. Load Balancing and Contention resolution. Algorithms for object location in distributed networks. Game theoretic aspects of distributed agents.

Administration

Course Information

Notes and/or (required) readings.

(Introduction:) 1/22/03
Load balancing: 1/27/03 (first draft)
Butterfly Routing: 2/10/03
(previous years notes) Packet Scheduling (Levelled Networks and Delay Sequences)
Path Selection: General Networks: 2/19/03 and 2/21/03 (first draft)
PRAM Introduction: 2/24
NC algorithms
PRAM Algorithms: Matching (cont)
VLSI Area
Universal Networks
Sparse Tree Covers
Consistent Hashing
More on object location (CAN and Tapestry/Pastry) (first draft)
Game Theory
Gossip Algorithms

Some lecture references.

Distributed Algorithms for Breadth First Search - Awerbuch.

Lamport et.al.'s Byzantine General Paper.

Compact Routing Tables - Awerbuch-Peleg.

Useful links.

Previous year's website.