MapReduce

System Calls

Multiprocessing

execvp

Interprocess Communication

Virtual memory

Thread (computing)

Mutexes (Mutual exclusion)

Semaphores

Thread Pools

Parallel Compilation

Clients

Networking

API (Application Programming Interface)

Filesystems

File Descriptors

waitpid

Pipeline (Unix)

Signals

Multithreading

Race condition

Condition variables

Multithreading Patterns

Read-Write Locks

Networks

Servers

HTTP

Networking Functions

CS 110: Principles of Computer Systems Stanford University Winter 2022 CS 110 delves into advanced computer systems and program construction, focusing on designing large systems, software that spans multiple machines, and parallel computing. This course builds upon CS107 and requires good knowledge of C, C++, Unix, GDB, Valgrind, and Make. It covers Linux filesystems, multiprocessing, threading, networking, and more. CS107 took you behind the scenes:

- how things work inside C++/Python/Java, and how your programs map onto the components of computer systems
- understanding of program behavior and execution
 
CS110 uses this as a foundation to build complex programs that maximally take advantage of the hardware and operating system software available to us:

- How can we understand the designs and tradeoffs of large systems?
- How can we write software that spans multiple machines?
- How can we write software that runs tasks in parallel on a single machine? ### Course Topics Overview

1. **Overview of Linux Filesystems** - How can we design filesystems to store and manipulate files on disk?
1. **Multiprocessing and Exceptional Control Flow** - How can our program create and interact with other programs?
1. **Threading and Concurrency** - How can a single instance of our program perform multiple coordinated tasks at the same time?
1. **Networking and Distributed Computing** - How can we write programs that communicate over a network with other programs, and tackle large tasks using many machines?
1. **Additional Topics**: MapReduce, Caching, and Non-Blocking I/O **CS107 or equivalent -**

- Each of you should know C and C++ reasonably well so that you can...
    - write moderately complex programs (e.g. pointers, **malloc/realloc/free**, C strings, C++ classes, methods, references, templates, **new/delete**)
    - read and understand portions of large code bases
    - trace memory diagrams and always win!
- Each of you should be ﬂuent with **Unix, GDB, Valgrind**, and **Make** to the extent they're covered in CS107 or its equivalent.

The first assignment is meant to give you a sense of the scope of CS110 programs and refresh your memory on relevant prerequisites.  If you feel ok about it, you're all set! Second half of CS107 Textbook: *Computer Systems: A Programmer's Perspective by Bryant & O'Hallaron, 3rd Edition*

- Can purchase full copy, or Stanford Bookstore custom edition with just CS110 chapters
 
*Principles of Computer System Design: An Introduction* by Jerome H. Saltzer and M. Frans Kaashoek

- Free Stanford online access [here](https://www.sciencedirect.com/book/9780123749574/principles-of-computer-system-design)​ (also linked on course homepage)
- Fewer readings from this book vs. first one
- You're welcome to buy a physical copy if you'd like

CS 110: Principles of Computer Systems

Computer Systems

Disks

Buffers

Computer file

Pages

Records

B+ Trees

Indices & B+ TreeRefinements

Buffer Management

Relational Algebra

Sorting & Hashing

Iterators & Joins

Query Optimization

Transactions

Concurrency

DB Design: Entity-Relationship Models

DB Design: FDs and Normalization

Recovery

Parallel Query Processing

Distributed Transactions

NoSQL

Apache Spark

CS 186 Introduction to Database Systems UC Berkeley Spring 2023 This project-heavy course covers access methods, data models, query languages, database services, and interfaces. It introduces transaction processing and requires CS 61A, CS 61B, and CS 61C as prerequisites/corequisites. It suggests proficiency in Java for project work. Access methods and file systems to facilitate data access. Hierarchical, network, relational, and object-oriented data models. Query languages for models. Embedding query languages in programming languages. Database services including protection, integrity control, and alternative views of data. High-level interfaces including application generators, browsers, and report writers. Introduction to transaction processing. Database system implementation to be done as term project.  We will expect students to have taken CS 61A, CS 61B, and CS 61C. CS61A/B will be enforced as a prerequisite, and CS61C will be enforced as a corequisite. This class is project-heavy, and there will almost always be a project assigned to you throughout the semester. Students have noted an increase in difficulty compared to offerings of this course predating Fall 2018. We expect proficiency with Java (around the level taught in CS 61B) in order to work on the projects, with the exception of Project 1. Projects vary in difficulty. You can find more information about them in the Projects section below. There is no required textbook for this class, and we will not be assigning required readings. However, if you would like to use a textbook while in this class, we recommend the following:

- [Database Management Systems](http://pages.cs.wisc.edu/~dbbook/), 3rd Edition, by Ramakrishnan and Gehrke (Former official textbook of this class)

- [Database Systems Concepts](https://www.db-book.com/), 6th Edition, by Silberschatz, Korth and Sudarshan

- [Database Systems: The Complete Book](http://infolab.stanford.edu/~ullman/dscb.html), 2nd Edition, by Garcia-Molina, Ullman, and Widom (Previously used by Prof. Cheung)

Note that exams and all other aspects of the course will center on material as covered in the lectures, so defer to course material if there are any discrepancies with the textbook(s) you are using.

If you want to try to target your reading to the topics of this class, reading assignments from previous offerings of CS 186 for the Database Management Systems textbook can be found [here](https://docs.google.com/spreadsheets/d/1JfrHl8hn8-iMqL2se4SYS0lxQyiwz54YIATFXuzaPlA/edit?usp=sharing). Reading assignments from a database class taught at a different university by Prof. Cheung for Database Systems: The Complete Book can be found [here](https://courses.cs.washington.edu/courses/cse414/18sp/calendar/lecturelist.html), although the topics taught in that class differ from those taught in this class.

CS 186 Introduction to Database Systems

Database Systems

Directories

Job Control

Browser Design

Protocols

TCP (Transmission Control Protocol)

Async I/O

Large Files

Links

Process (computing)

Synchronization (computer science)

Threading

IP (Internet Protocol)

CS 110: Principles of Computer Systems Stanford University Summer 2021 Requiring familiarity with C/C++ and Unix/Linux, delves into computer systems principles. Students will engage with a blend of C and C++ to interface with system resources and manage complex projects. The course covers a broad range of topics including filesystems, multiprocessing, synchronization, networking, and MapReduce.   Formally, the prerequisite for the course is CS 107. Less formally, you need to be familiar with the C and C++ programming languages, Unix/Linux, `make`, Makefiles, `gcc`/`g++`, `valgrind`, `gdb`, and have some experience with basic computer architecture (x86 as it’s taught in CS107, or exposure to some other architecture with the confidence and ability to pick up x86 as I reference it). **If you have not taken CS 107, please email me at the beginning of the quarter to let me know.**

We’ll be coding in a mixture of C and C++ throughout the quarter. We rely on C, because the libraries needed to interface with system resources are written in C. We rely on C++, because the projects become large enough that I prefer to go with a more mature language that supports encapsulation and generic programming better than C does. You should understand pointers, dynamic memory allocation (`malloc`/`realloc`/`free`), and C strings perfectly. You should understand C++ classes, methods, references, templates, and C++'s `new`and `delete` operators. There are many C++ features you’re not expected to know, but you should have enough programming maturity to pick those features up and search the web for reference materials as needed.

The [CS 107 course website](https://web.stanford.edu/class/cs107/syllabus.html)is still up and may be a good reference. If you have not taken CS 107 and find yourself struggling, get help as soon as possible! This class moves quickly, and you will not want to fall behind. Email me and I may be able to point you to helpful resources. Readings are optional this quarter. I will post notes and slides with most lectures as reference material. However, if you would like additional readings to prepare for lecture or to reinforce concepts, I will list associated readings from the following textbooks:

- *Computer Systems: A Programmer’s Perspective* by Bryant and O’Hallaron, either the 2nd or 3rd edition. Both CS107 and CS110 teach from a subset of the B&amp;O textbook, the Stanford Bookstore carries a custom reader with just the chapters we need. Additionally, the Stanford library should have scans of this book available online in a week or two, although these are not yet available at time of writing.
- *Principles of Computer System Design: An Introduction* by Jerome H. Saltzer and M. Frans Kaashoek. The textbook should be available through the [Stanford library reserves](https://searchworks.stanford.edu/?f%5Bcourse%5D%5B%5D=CS-110-01) or [Science Direct](http://www.sciencedirect.com/science/book/9780123749574), and because it’s free, I assume most of you would just prefer to go with the free online version. Again, you’re welcome to purchase a hardcopy if you’d like. It’s available for purchase on [Amazon](http://www.amazon.com/Principles-Computer-System-Design-Introduction/dp/0123749573).

System R

File system

Flash File Systems

Isolation Levels

Transactional Recovery

Practical Byzantine Fault Tolerance

Exokernel

Resource Allocation and Scheduling

Edge Computing

Distributed Storage

Column Stores

Microkernels

Spectre Attack

Unix

Bigtable

Databases

End-To-End Arguments in System Design

File System Reliability

Transaction Locking

The Byzantine Generals Problem

Google File System (GFS)

Dynamo

seL4

Virtual Machine (VM)

Peer To Peer Networks

Distributed Consensus

Security

CryptDB

CS 262a Advanced Topics in Computer Systems UC Berkeley Fall 2021 A graduate survey of systems managing computation and information. Topics include volatile and persistent memory management, system support for networking, security infrastructure, extensible systems, APIs, and large software system performance analysis. Students are expected to engage in quality systems research, culminating in a publishable group project. Graduate survey of systems for managing computation and information, covering a breadth of topics: early systems; volatile memory management, including virtual memory and buffer management; persistent memory systems, including both file systems and transactional storage managers; storage metadata, physical vs. logical naming, schemas, process scheduling, threading and concurrency control; system support for networking, including remote procedure calls, transactional RPC, TCP, and active messages; security infrastructure; extensible systems and APIs; performance analysis and engineering of large software systems. Homework assignments, exam, and term paper or project required.

The main work of this class is to read frequently and deeply, while working toward a group research project of publishable quality.  Each student will be individually responsible for writing up a short summary of every paper. There will be one midterm exam (albeit near the end), and no final exam. Research projects are a critical aspect of the course.  Your goal is to do some quality systems research; that is, to add to our understanding of how to build systems.  Research projects must be written up in a term paper, and will be presented in a poster in a departmental mini-conference.  Suggested project ideas will be provided by the instructors, but you are strongly encouraged to come up with your own project ideas.  Potential projects include implementation or analysis of some piece of an OS, a DBMS, or an Internet service; extending one of these systems with new functionality; or measurement and analysis of existing systems with the goal of better understanding issues in system design.   [CS 162](https://cs162.org/), or equivalent. There is no required textbook, but some of the papers are in [*Readings in Database Systems*](http://redbook.cs.berkeley.edu/). We will read and discuss 2-4 papers per week. Likely all of the papers will be available online.

General information: ISBN-10: 0-262-69314-3, ISBN-13: 978-0-262-69314-1

Link to MIT press site: [Readings in Database Systems, 4th Edition](http://mitpress.mit.edu/catalog/item/default.asp?tid=10480&ttype=2)

CS 262a Advanced Topics in Computer Systems

The Internet

Classical synchronization

Time Synchronization

Distributed Mutual Exclusion

Remote Procedure Call (RPC)

Distributed File Systems

Concurrency Control

Logging and Crash Recovery

Fault Tolerance

RAID (Redundant Array of Inexpensive Disks)

Distributed Replication

Distributed Databases

Spanner

Apache Hadoop Distributed File System (HDFS)

Data-Intensive Computing

Hadoop

In-memory cluster compute

Distributed ML

Internet Content Delivery

DNS (Domain Name System)

Content Delivery Network (CDN)

Publish-Subscribe

Kafka

Virtualization

3-tier Web Service Architecture

Security Protocols

Byzantine Fault Tolerance

P2P Network

Distributed Ledgers

Blockchain

 15-440 Distributed Systems Carnegie Mellon University Fall 2020 A course offering both theoretical understanding and practical experience in distributed systems. Key themes include concurrency, scheduling, network communication, and security. Real-world protocols and paradigms like distributed filesystems, RPC, MapReduce are studied. Course utilizes C and Go programming languages. Most software is now distributed in some sense. This course is meant to serve as an introduction to distributed systems, emphasizing techniques for creating functional, usable, and high-performance distributed systems.

This course aims to: (1) provide students with an understanding of the principles and techniques behind the design of distributed systems, such as locking, concurrency, scheduling, and communication across the network. (2) provide students with practical experience designing, implementing, and debugging real distributed systems.

Major themes covered in this course include scarcity, scheduling, concurrency and concurrent programming, naming, abstraction and modularity, imperfect communication and other types of failure, protection from accidental and malicious harm, optimism, and the use of instrumentation and monitoring and debugging tools in problem solving. As the creation and management of software systems is a fundamental goal of any undergraduate systems course, students will design, implement, and debug large programming projects. After this course, students will have learned to…

- Implement and structure distributed systems programs.
- Write programs that can interoperate using well-defined protocols.
- Debug highly concurrent code that spans multiple programs running on multiple cores and machines.
- Reason about distributed algorithms for locking, synchronization and concurrency, scheduling, and replication.
- Use standard network communication primitives such as UDP and TCP.
- Understand the general properties of networked communication necessary for distributed systems programming in clusters and on the Internet.
- Employ and create common paradigms for easing the task of distributed systems programming, such as distributed filesystems, RPC, and MapReduce. Be able to clearly elucidate their benefits, drawbacks, and limitations.
- Identify the security challenges faced by distributed systems programs.
- Be able to select appropriate security solutions to meet the needs of commonly encountered distributed programming scenarios. Because this course has a big project component, you must be proficient in C and programming on UNIX systems. We will use the [Go programming language](https://golang.org/) throughout the term. It is required that you have taken 15-213 and gotten a “C-“ or higher since many of the programming skills you will need are taught in that course. **However, if you received a C in 15-213, you must meet with your academic advisor to discuss your background before taking 15-440/640, perhaps taking an additional course to sharpen your systems skills. Your advisor must email us approval and an explanation of why you have sufficient background to take 15-440/640.** 

 15-440 Distributed Systems

Parallelism and Distributed Systems

Floating Point

RISC-V Procedures

Loader

RISC-V Single-Cycle Datapath

Caches - Multilevel

Parallelism

Translation Lookaside Buffer (TLB)

Amdahl's law

RISC-V Instruction Formats

Combinational Logic

RISC-V Single-Cycle Control

Caches - Set-associative

Thread-level Parallelism

Page faults

Virtual memory performance

Data-level parallelism

Data center

Assembly language

Number Representation

RISC-V

Compiler

Synchronous Digital Systems (SDS) State

RISC-V 5-Stage Pipeline

Performance with Caches

OpenMP

Multilevel

Dependability

Warehouse-scale Computing

Input/output

C (programming language)

RISC-V Data Transfer

Assembler

Finite State Machine (FSM)

Hazards

Flynn taxonomy

Cache coherence

Interrupts

Parity

C Memory (Mis)Management

RISC-V Decision Making Logical Ops

Linker

Combinational Logic Blocks

Caches - Direct Mapped

Single instruction, multiple data (SIMD)

Performance

Exception handling

Error-correcting Codes (ECC)

CS 61C Great Ideas in Computer Architecture (Machine Structures) UC Berkeley Fall 2022 This course deepens students' understanding of computer architecture and the translation of high-level programs into machine language. Emphasis is on C and assembly language programming, computer organization, parallelism, CPU design, and warehouse-scale computing. Prerequisites include CS61A and CS61B or equivalent C-based programming experience. [Official Academic Guide course description](https://classes.berkeley.edu/content/2022-fall-compsci-61c-001-lec-001)

The subjects covered in this course include C and assembly language programming, translation of high-level programs into machine language, computer organization, caches, performance measurement, parallelism, CPU design, warehouse-scale computing, and related topics.  CS61A and CS61B (or equivalents) or experience with a C-based programming language (e.g. Java, C++). There is no official textbook for this class. However, there are three optional textbooks as additional references:

- **P&H**: Second edition of Patterson and Hennessy's *Computer Organization and Design RISC-V Edition* book ("P&H"), ISBN 0128122757.
- **K&R**: *The C Programming Language, Second Edition* by Kernighan and Ritchie. Other C programming books are also suitable if you are already comfortable with them, but our lectures will be based on K&R.
- **WSC**: *The Datacenter as a Computer: An Introduction to the Design of Warehouse-Scale Machines*, which is freely available [on our website](https://inst.eecs.berkeley.edu/~cs61c/resources/WSCBarrosoHolzle.pdf).

Please contact staff on Ed if you have trouble finding or paying for these textbooks.

CS 61C Great Ideas in Computer Architecture (Machine Structures)

MapReduce

6 courses cover this concept

CS 110: Principles of Computer Systems

CS 186 Introduction to Database Systems

CS 110: Principles of Computer Systems

CS 262a Advanced Topics in Computer Systems

15-440 Distributed Systems

CS 61C Great Ideas in Computer Architecture (Machine Structures)