CS 625A Foundations of Distributed Computing

CS 625A Foundations of Distributed Computing

Prof. Rebecca Wright
Lieb 219
Tuesdays 5:00-7:30pm
Spring 2006

Course description

Design and analysis of distributed algorithms, and impossibility results showing when some problems are unsolvable. Models of synchronous and asynchronous distributed computing. Fault models including crash failures and malicious failures, and communication models including message passing and shared memory systems. Distributed algorithms and impossiblity results for problems such as consensus, Byzantine agreement, clock synchronization, mutual exclusion, and secure multiparty computation.

Prerequisites: CS 600.


Nancy Lynch, Distributed Algorithms, 1st Edition, Morgan Kaufmann Publishers, 1996.

You may also find as a useful supplement:

Hagit Attiya and Jennifer Welch, Distributed Computing, 2nd Edition, Wiley, 2004.


Syllabus for this course: PS | PDF .

Office Hours

Office hours are by appointment only. Send e-mail to the instructor for appointments.

Last updated 4/20/06 by
rwright (at) cs.stevens.edu
Copyright © 2006 Rebecca N. Wright