Processes & scheduling
Represent running programs as managed processes or threads and allocate processor time under competing objectives.
Side 236Side Studies / Research
Subject
Operating Systems
Purpose
Computer resource management studied through processes, memory, files, concurrency, protection and the interface between applications and hardware.
Structure
05 movesSystem mapV0
Components → constraints → flows → control → failure
Coordinate competing programs over finite hardware.
Operating systems create controlled abstractions over processors, memory and devices while preserving isolation, fairness and recoverability under concurrency.
Virtual memory
Give programs protected address spaces while translating and paging memory across finite physical resources.
Concurrency & synchronization
Coordinate shared state while preventing races, deadlock and inconsistent interleavings.
Files & persistence
Expose durable storage through names, metadata, buffering and crash-consistent update protocols.
Protection & virtualization
Enforce privilege boundaries and isolate workloads across kernels, processes, containers and virtual machines.
Keep the boundaries visible.
process ≠ program file
concurrency ≠ parallelism
virtual memory ≠ more physical memory
Questions that organize the Side.
Which operating-system abstraction hides complexity versus introduces a new failure mode?
How do scheduling goals conflict across latency, throughput and fairness?
What must survive a crash for a storage system to be considered consistent?
What should carry weight here?
Use traceable benchmarks, fault injection and concurrency tests; correctness under rare interleavings matters as much as average throughput.