Performance

Address Space

Atomic instructions

Monitors

Starvation

Address translation

Page table

TLB (Translation Lookaside Buffer)

General I/O

Queueing Theory

Reliability

Distributed Decision Making

Remote Procedure Call (RPC)

Key-Value Stores

Quantum Computing

Threads & Processes

Fork

Sockets

Synchronization (computer science)

Lock Implementation

Semaphores

Scheduling (computing)

Computer memory

Segments

Caching

Demand Paging Policies

Buffering

End-to-End Arguments

TCP/IP

NFS & AFS

DataCapsules

System Calls

Device Drivers

Concurrency

Mutual Exclusion

Lock (computer science)

Readers/Writers

Deadlock

Virtual memory

Paging

Demand Paging

Storage Devices

Filesystem Design

Transactions

Networking

Distributed Storage

Chord

Inter-Process Communication (IPC)

Input/output

CS 162: Operating Systems and Systems Programming UC Berkeley Fall 2022 This course introduces operating systems design and related concepts. It covers topics like memory allocation, file systems, basic networking, transactions, and security. The course requires foundational knowledge in data structures, assembly language, C programming, and debugging. It aims to improve students' skills in debugging large programs and computational problem solving. The purpose of this course is to teach the design of operating systems and operating systems concepts that appear in other computer systems. Topics we will cover include concepts of operating systems, systems programming, networked and distributed systems, and storage systems, including multiple-program systems (processes, interprocess communication, and synchronization), memory allocation (segmentation, paging), resource allocation and scheduling, file systems, basic networking (sockets, layering, APIs, reliability), transactions, security, and privacy.  CS 61A, CS 61B, CS 61C, and CS 70, or equivalent courses. This means that you understand:

- Data structures: arrays, linked lists, binary trees, and hashing
- Assembly language programming
- The C programming language
- Debugging C using GDB
- CPU caches and memory hierarchy
- Virtual memory as covered in CS 61C
- CPU pipelines and basic digital logic design
- Basic knowledge of random variables and probability distributions as covered in CS 70


The TAs will spend a small amount of time reviewing some of the material you are less likely to remember. We will assume that you either know the material that is supposed to be covered in those courses, or that you are willing to learn the material as necessary. We will not spend time in lecture covering any of this material. **Perhaps more important than formal prequisites, however, is experience and maturity with debugging large programs, designing and implementing useful abstractions, and computational problem solving in general. This class will exercise your skills in these areas.**

If you feel that you would benefit from additional review of these prerequisites, we recommend using the following resources:

1. For a good review of probability as you’ll need it in this class, read through CS 70 Lecture Notes [15](https://inst.eecs.berkeley.edu/~cs70/sp14/notes/n15.pdf), [16](https://inst.eecs.berkeley.edu/~cs70/sp14/notes/n16.pdf), [17](https://inst.eecs.berkeley.edu/~cs70/sp14/notes/n17.pdf), [18](https://inst.eecs.berkeley.edu/~cs70/sp14/notes/n18.pdf), and [19](https://inst.eecs.berkeley.edu/~cs70/sp14/notes/n19.pdf).

1. Hennessy, John L. and Patterson, David A. *Computer Architecture: A Quantitative Approach*. 5th edition. **Although the main content of this book goes far more in-depth into computer architecture than you are expected to know for this class, the appendices provide an excellent overview of some of the prerequisites. Focus specifically on the sections below:**

- 2.1 and B.1 - B.4 (you can skip the sixth optimization in B.3) review caching, virtual memory, and memory hierarchies.
- C.1 - C.2 review CPU pipelines at the level of CS 61C. We are using the textbook “Operating Systems: Principles and Practice” by Anderson and Dahlin (A&D). The reading from this textbook is **strongly recommended**. There will be some additional readings that are not from this textbook that are freely available online. These will be linked on the course website in the "Readings" column for your viewing.

#### Strongly Recommended
[Operating Systems: Principles and Practice (2nd Edition)](http://ospp.cs.washington.edu/)
#### Recommended
[Operating Systems: Three Easy Pieces](http://pages.cs.wisc.edu/~remzi/OSTEP/)
#### Supplemental
[Linux Kernel Development (3rd Edition)](http://www.amazon.com/Linux-Kernel-Development-3rd-Edition/dp/0672329468)

CS 162: Operating Systems and Systems Programming

Operating Systems

Floating Point

RISC-V Procedures

Loader

RISC-V Single-Cycle Datapath

Caches - Multilevel

Parallelism

Translation Lookaside Buffer (TLB)

Amdahl's law

RAID (Redundant Array of Inexpensive Disks)

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

C (programming language)

RISC-V Data Transfer

Assembler

Finite State Machine (FSM)

Hazards

Flynn taxonomy

Cache coherence

Interrupts

MapReduce

Parity

C Memory (Mis)Management

RISC-V Decision Making Logical Ops

Linker

Combinational Logic Blocks

Caches - Direct Mapped

Single instruction, multiple data (SIMD)

Exception handling

Apache Spark

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)

Computer Systems

Performance

2 courses cover this concept

CS 162: Operating Systems and Systems Programming

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