remzi-arpacidusseau/ostep-code
Ostep Code
This project is a collection of educational simulations and code examples designed to illustrate core operating system concepts. It provides practical implementations of virtualization, concurrency, and persistence to demonstrate how an operating system manages hardware and software resources.
The repository includes simulators for CPU scheduling, memory virtualization via paging and segmentation, and file system architectures. It provides specific models for virtual-to-physical address translation and the distribution of processor time across competing tasks.
The simulations cover concurrency control through the use of locks, semaphores, and condition variables to manage shared data. Additional coverage includes the modeling of non-volatile data persistence through simulated block-level disk input and output operations.
Features
- OS Scheduling Simulations - Provides simulations specifically modeling operating system processor task management and time-sharing.
- OS Process Execution - Implements the spawning and management of operating system processes to demonstrate task execution and lifecycle management.
- Concurrency Control Examples - Provides code demonstrations of locks, semaphores, and condition variables used to coordinate shared data.
- Operating System Concepts - Provides comprehensive educational material and simulations on operating system internals and architecture.
- C System Simulations - Implements core operating system concepts using low-level C primitives to manage memory and process execution.
- Disk Storage Internals - Provides a technical simulation of how data persists on hardware through block-level disk storage and file systems.
- Mutexes and Locks - Implements mutual exclusion primitives such as mutexes and locks to synchronize access to shared resources.
- Page Table Translators - Provides mechanisms for converting logical addresses to physical addresses using simulated page tables.
- Process Execution Simulations - Creates and synchronizes processes using a basic interface to demonstrate how operating systems handle task execution.
- CPU Scheduling Simulations - Manages process scheduling and execution models to distribute a single processor's time across multiple competing tasks.
- Task Scheduling Algorithms - Implements logic to determine which runnable task should execute next on a processor using various scheduling algorithms.
- Simulated Virtual Memory Managers - Implements a simulated environment that manages page tables, handles page faults, and translates virtual addresses.
- Concurrency Control Primitives - Coordinates shared data across multiple execution flows using locks, semaphores, and condition variables.
- Data Persistence and Storage - Implements architectures dedicated to the durable storage and long-term management of digital information through disk simulation.
- File System Simulators - Implements simulations that model file system structures to verify on-disk data integrity for educational purposes.
- Persistence Simulations - Simulates disk input and output and file system architectures to illustrate data storage on non-volatile media.
- Condition Variables - Provides synchronization primitives that allow threads to wait for specific state changes or signals from other threads.
