CS273: Parallel (original) (raw)
CS273: Foundations of Parallel and Distributed Systems
INSTRUCTORS:
Satish Rao(satishr@cs.berkeley.edu)
Office hours (tentative): Tu: 3:30-4:30, Wed: 1-2.
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 networks. Load Balancing and Contention resolution. Algorithms for object location in distributed networks. Game theoretic aspects of distributed agents.
Announcements
Revised problem set is up. (April 6th, 2005). New due date is April 15. Even that is flexible.
Administration
Homeworks.
- Problem Set 1(UPDATED!!! April 6.
Lecture Notes and/or (required) readings.
Templates and instructions for scribe notes are located here.
- Introduction, Balls in Bins 1/18/05
- Lecture 2: (Power of Two Choices:) 1/20/05
- Lecture 3: (Markov, Chebyshev, Chernoff.) 1/25/05
- Lecture 5: Benes Routing (finish). Deleay Sequence Arguments (begin)2/1/05
- Lecture 6: Delay Sequence Arguments (cont.). 2/3/05
- Lecture 9/10: Fast Algorithm for Multicommmodity Flow. 2/15/05
- Lecture 10: Fast Algorithm for Multicommmodity Flow (cont). 2/17/05
- Lecture: RNC Matching 3/2/05
- Lecture: Peer to Peer Systems