CIS 5050: Software Systems (Spring 2026)
Overview

Image of a router
This course provides an introduction to fundamental concepts of distributed systems, and the design principles for building large-scale computational systems.

We will study some of the key building blocks – such as synchronization primitives, group communication protocols, and replication techniques – that form the foundation of modern distributed systems, such as cloud-computing platforms or the Internet. We will also look at some real-world examples of distributed systems, such as GFS, MapReduce, Spark, and Dynamo, and we will gain some hands-on experience with building and running distributed systems.

CIS 5050 is one of the core courses in the MSE program, as well as an option for the course requirements for PhD students.

Logistics

Instructor:
Linh Thi Xuan Phan
Office hours: Thursdays 12:00-1:00pm (Levine 576)

When and where:
Tuesdays/Thursdays 10:15-11:45am, LRSM AUD

Teaching assistants and office hours:

Navya Saxena (Head TA) OH: Mondays 5:30-7:30pm (Levine 612 conference room)
Xian Wang OH: Mondays 3:00-4:00pm + Tuesdays 3:00-4:00pm (Levine 5th floor 501 bump space)
Ryan Morris OH: Tuesdays 12:30-1:30pm (Levine 5th floor bump space)
Sahishnu Hanumolu OH: Tuesdays 12:30-2:20pm (OHQ)
Henry Xu OH: Wednesdays 10:00am-12:00pm (OHQ)
Shutong Jiang OH: Wednesdays 3:30-5:30pm (Levine 5th floor 501 bump space)
Ian Yin OH: Thursdays 3:00-5:00pm (Levine 5th floor 501 bump space)
Abby Eisenklam OH: Fridays 9:00-11:00am (Levine 6th floor 601 bump space)
Umang Sharma OH: Fridays 10:00am-12:00pm (OHQ)
Michael Yao OH: Saturdays 2:00-4:00pm (OHQ)

Online office hours are conducted via OHQ.

Course policies

Course textbook:
Distributed Systems: Principles and Paradigms, 4th edition (by M. van Steen and A. Tanenbaum). You can get a digital version of this book for free; hardcopies of the previous version of the book are available, e.g., from Amazon. Additional material will be drawn from selected research publications.

Prerequisites:
The course requires undergraduate-level operating systems and networking knowledge, such as CIS 4480 (formerly CIS 3800) and NETS 2120 (or CIS 5530) or the equivalence. You must also be proficient in C or C++ programming.

Workload:
The course will involve three substantial programming assignments, a group project, and two midterms. Both the programming assignments and the project involve a considerable amount of programming in C/C++, and the project requires the ability to work with your classmates in teams.

Grading:
Your letter grade will be based on the individual programming assignments (30%), the group project (35%), the midterm exams (30%), and participation (5%).

Attendance and other policies:
Class attendance is mandatory and will count towards your participation score. More details on attendance and key course policies can be found here.


Resources

We will be using Ed Discussion for all course-related discussions.

Homework assignments and project are available for download from the assignments page. You can submit your solutions online via GradeScope.

Special sessions

The goal of the special sessions is to provide you with tools and resources that might be useful for the assignments and project. See the special sessions page for more details.

Tentative schedule

Date Topic Details Reading Remarks
Jan 15 Introduction Course overview
Policies
Chapter 1 HW0 released
Jan 20 Processes and threads Basic concepts
The UNIX model
Implementation in the kernel
Chapter 3.1 (Sections 1+2) HW0 due;
HW1 released
Jan 22 System calls
System calls
The file API
Kernel entry/exit
   
Jan 27 Concurrency control
[video 1] [video 2] [video 3]
Synchronization primitives
Race conditions, critical sections
Deadlock and starvation
Semaphores
Classical synchronization problems
Monitors and condition variables
[Hoare monitors]
[Mesa monitors]
 
Jan 29 Communication Sockets
Socket programming
Handling multiple connections
Chapters 4.1+4.3 HW1 due (1/30);
HW2 released
Feb 3+10 Remote Procedure Calls
Programming model
Stub code; marshalling; binding
Handling failures
Chapters 4.2+8.3 HW2MS1 due (on 2/9)
Feb 12 Naming Kinds of names; name spaces
The Domain Name System;
Akamai; DNSSEC
Chapter 6  
Feb 17+19 Clock synchronization
Logical clocks
NTP and Berkeley algorithms
Lamport and vector clocks
Chapters 5.1+5.2  
Feb 24+26 Group communication
Reliable multicast
IP multicast
FIFO, causal and total ordering
Chapter 8.4 HW2MS2+3 due (2/23);
HW3 released
Mar 3 First midterm exam
Mar 5 Replication Primary/backup protocols
Quorum protocols
Sequential and causal consistency
Client-centric models
Chapter 7 Project released
Mar 7-15 Spring break
Mar 17 Bigtable and Project Bigtable case study
Project overview
[Bigtable] HW3 due (3/16)
Mar 19 Fault tolerance
2PC and 3PC
Logging and recovery
Chandy-Lamport algorithm
Chapters 8.5+8.6;  
March 24 State-machine replication
Failure models
The Consensus problem
Paxos
Chapters 8.1+8.2; [Paxos]  
March 26+31 Non-crash Fault Tolerance
The Byzantine Generals problem
Impossibility results
Solutions
[BFT]  
April 2 Distributed file systems NFS
Coda
Disconnected operation
Chapter 2.3.3; [Coda]  
April 7 Google File System
Google cluster architecture
Reading and writing in GFS
Consistency and fault tolerance
[Cluster] [GFS]  
April 9 MapReduce
MapReduce programming model
System architecture
[MapReduce]  
April 14 Spark Differences to MapReduce
RDDs
Case study: PageRank
[RDD] [Spark]  
April 16+21 DHTs and Dynamo Distributed hash tables
The CAP dilemma
Amazon Dynamo
[Dynamo]  
April 23 Special topic
TBA    
April 28 Second midterm exam
April 30-May 3 Reading days
May 4-8 Project demos and reports
Web site contact: Linh Thi Xuan Phan