Stanford CS110 - Principles of Computer Systems - Spring 2019

Explore fundamental computer systems concepts through this comprehensive lecture series covering file systems, multiprocessing, multithreading, networking, and system design principles. Begin with Unix v6 filesystem architecture and data structures, then progress through system calls and multiprocessing techniques including execvp, pipes, and signal handling. Master threading concepts from basic C threads to advanced C++ threading, working with mutexes, condition variables, and semaphores through practical examples like an ice cream shop simulation. Delve into networking fundamentals, client-server architecture, and network system calls while building understanding through a web proxy implementation. Conclude with advanced topics including MapReduce frameworks, system design principles, and non-blocking I/O operations, gaining practical experience with race conditions, deadlock prevention, and data integrity challenges throughout the curriculum.

Syllabus

CS 110 Lecture 01 -- Introduction
CS 110 Lecture 2, File Systems
CS 110 Lecture 3: Unix v6 Filesystem
Lecture 04 Filesystem Data Structures, System Calls, and Intro to Multiprocessing
Lecture 5 - execvp intro
CS 110 Lecture 6: execvp, pipe, dup2, and signals
CS 110 Lecture 7: Signals
CS 110 Lecture 8: Race Conditions, Deadlock, and Data Integrity
CS 110 Assignment 3 Overview
CS 110 Lecture 9 - Introduction to Threads
CS 110 Lecture 10 -- From C threads to C++ threads
CS 110 Lecture 11: Multithreading, Condition Variables, and Semaphores
CS 110 Lecture 12 Review of mutex, conditional_variable_any, semaphore
CS 110 Lecture 13: Ice Cream Shop Simulation
CS 110 Lecture 14: Introduction to Networking
Lecture 15 Networks and Clients
CS 110 Lecture 16 Network System Calls
CS 110 Lecture 17 - Web Proxy
CS 110 Lecture 18 MapReduce
CS 110 Lecture 19 - Principles of System Design
CS 110 Lecture 20: Non-blocking I/O