CS273: Foundations of Parallel and Distributed Computation
INSTRUCTOR: Satish Rao
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.
Notes and/or (required) readings.
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,
"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.