Intro to Distributed Algorithms

3 credits · Undergraduate Programs

Basic problems in distributed systems such as symmetry breaking, consensus, resource allocation, and synchronization. The impact of system characteristics, such as models of communication, timing and failure, and of solution requirements, such as correctness and complexity criteria and algorithmic constraints, on the computability and complexity of these problems. Techniques for solving problems under different models will be emphasized. Prerequisite(s): Computer Science 413. Antirequisite(s): Credit for Computer Science 561 and 661 will not be allowed.