Introduces concurrency hazards, including race conditions and deadlock, and explains how locks protect shared resources and why printf can be unsafe in signal handlers.
Save to open this file
CMU 15-213: Introduction to Computer Systems
All
- 01-Overview
01-Overview
- 02-Bits, Bytes, and Integers
- 03-Machine Programming (Part I)
- 04-Machine Programming (Part II)
- 05-Machine Programming (Part III)
- 06-Machine Programming (Part IV)
- 07-Linking
- 08-Design and Debugging
- 09-The Memory Hierarchy
- 10-Cache Memories
- 11-Virtual Memory: Concepts
- 12-Virtual Memory: Details
- 13-Dynamic Memory Allocation: Basic
- 14-Dynamic Memory Allocation: Advanced
- 15-Code Optimization
- 16-Processes and Multitasking
- 17-Exceptional Control Flow
- 18-System Level I/O and File Systems