Advanced Methods in Distributed Computing
Course Announcement -- CPSC 689.08 (Spring 2007)
This special-topics seminar is designed to be an in-depth sequel to our graduate lecture course on Distributed Algorithms & Systems (CPSC 668). It is primarily intended for students interested in pursuing graduate research on the foundations or theory of distributed computing. Additionally, this course will be valuable for students interested in broadening their portfolio of techniques for algorithmic design and development.
The focus of the seminar will be on fundamental methods and proof techniques for advanced research in distributed computing. We will examine algorithmic strategies (such as stabilization, randomization, and fault-detection) as well as proof techniques (such as invariants, metric functions, valency arguments, and reductions). The goal is to develop practical facility for original research supported by rigorous methods.
Prerequisites
Students are expected to have a demonstrable understanding of basic problems and techniques in distributed computing, including consensus, leader election, mutual exclusion, logical time, and various computational models (CPSC 668 or equivalent).
Course Readings
Readings for the course will include classic and current papers from the scholarly literature on proof techniques as well as design strategies for distributed algorithms. A required term project will likely involve either original research on an open problem or an investigative study on a particular proof technique or algorithmic method.
Information and Links
- Lectures meet 11:30am-12:20pm on MWF in HRBB 126
- Official registration information can be found here.
- The tentative syllabus can be found here.
- An advertisement for the seminar is here.
- Questions? Send me email here.