This course is for students interested in understanding the fundamental concepts and algorithms underlying existing distributed systems. By the end of this course, students will have the knowledge needed to work with and build distributed systems, such as distributed file systems, peer-to-peer systems, and cloud computing systems. Topics discussed include MapReduce, distributed file systems, distributed coordination algorithms, consensus, fault-tolerance, and security.

Units: 1

Max Enrollment: 18

Prerequisites: One of the following CS 230, CS 230P, or CS 230X (required); CS 231 or CS 242 (recommended).

Distribution Requirements: MM - Mathematical Modeling and Problem Solving

Typical Periods Offered: Every other year

Semesters Offered this Academic Year: Spring

Notes: