How Operating Systems Work: The Complete Guide

An OS Manages Hardware So Applications Don't Have To

Without an operating system, every application would need to implement its own disk I/O, memory allocation, network communication, and display rendering from scratch. That's clearly not practical. The OS provides a shared, managed abstraction layer.

The OS has four core responsibilities:

• Process management — Creating, scheduling, and terminating processes. Ensuring processes don't interfere with each other.
• Memory management — Allocating RAM to processes, implementing virtual memory, protecting memory boundaries.
• File system management — Organizing data on storage devices, managing permissions, handling I/O requests.
• Device management — Abstracting hardware through drivers so applications don't need device-specific code.

The Kernel Is the Core of the OS

The kernel is the central component of any OS. It runs continuously in kernel mode (ring 0) — a privileged CPU execution mode that allows direct hardware access. Everything else, including the applications you use, runs in user mode (ring 3) where hardware access is restricted.

This separation is the fundamental security model of modern computing. When your browser wants to read a file, it can't just reach into the disk controller directly. It makes a system call — a controlled crossing point into kernel mode — the kernel validates the request and performs the operation.

Processes and Threads: The Units of Execution

A process is a running instance of a program. Each process gets its own isolated virtual address space — its memory is protected from other processes. Processes communicate through inter-process communication (IPC) mechanisms: pipes, sockets, shared memory, message queues.

A thread is an execution unit within a process. Threads in the same process share memory space and can communicate directly. This makes threads faster to create and communicate between — but bugs in one thread can corrupt memory for all threads in the process.

Process states: New → Ready → Running → Waiting (blocked on I/O) → Terminated. The OS scheduler moves processes between states based on CPU availability and I/O completion.

CPU Scheduling: Deciding Who Runs When

Modern CPUs are fast enough that time-sharing creates the illusion of parallelism even on a single core. The scheduler decides which process runs, for how long, and in what order.

Common scheduling algorithms:

• Round Robin — Each process gets a fixed time quantum (say 10ms), then yields the CPU. Simple and fair. Used in interactive systems.
• Priority Scheduling — Higher-priority processes run first. Risk of starvation for low-priority processes. Mitigated by aging (gradually increasing priority).
• Completely Fair Scheduler (CFS) — Linux's default. Tracks "virtual runtime" for each process and schedules whoever has run least. Balances fairness and performance.
• Real-Time Scheduling — For embedded/RTOS systems where deadlines matter. Processes have hard or soft time constraints.

Memory Management and Virtual Memory

Every process needs memory. The OS manages allocation, protection, and deallocation through several mechanisms.

Virtual Address Space — Each process sees a contiguous, private address space (e.g., 0x0000 to 0xFFFF…FFFF on 64-bit). The OS maintains a page table mapping virtual addresses to physical RAM locations. The CPU's Memory Management Unit (MMU) performs the translation on every memory access.

Paging — Memory is divided into fixed-size blocks called pages (typically 4KB). Virtual pages map to physical frames. Pages not in RAM are swapped to disk (swap space or page file). When a process accesses a swapped-out page, a page fault occurs — the OS brings the page back into RAM.

Memory Layout of a Process:

• Text segment — Read-only compiled code
• Data segment — Initialized global/static variables
• BSS segment — Uninitialized global variables
• Heap — Dynamically allocated memory (malloc/new), grows upward
• Stack — Function call frames, local variables, grows downward

File Systems: How Storage Is Organized

A file system organizes raw storage (disk blocks) into files and directories with metadata: names, permissions, timestamps, sizes, and pointers to data blocks.

The OS implements a Virtual File System (VFS) layer — an abstraction that lets the same system calls (open, read, write, close) work across different underlying file systems. Your application doesn't know if it's reading from ext4 or NTFS.

Linux vs Windows vs macOS: Core Differences

Frequently Asked Questions