A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Boot Process and Kernel Initialization

College Depth 92 in the knowledge graph ☐ I know this ☆ Set as goal
1topic build on this
352prerequisites beneath it
See this on the map →
Introduction to Operating SystemsKernel Architecture and OS Structure→→Slab Allocator for Kernel Memory
boot kernel initialization

Core Idea

At boot, firmware initializes hardware and loads the kernel into memory; the kernel then initializes data structures, device drivers, and spawns the init process. The kernel detects and enumerates hardware, sets up memory management and paging, loads device drivers, and establishes process management infrastructure. This complex orchestration is essential for proper system startup and transition to user space.

Explainer

When you press the power button, the CPU starts executing from a fixed memory address hardwired into the processor. At that address lives firmware — on modern systems, UEFI (Unified Extensible Firmware Interface), on older systems, BIOS. The firmware's job is minimal but critical: perform a power-on self-test (POST) to verify that essential hardware like RAM and the CPU itself is functional, then find a bootable storage device and load the first stage of the operating system from it. The firmware knows nothing about your OS — it just finds and executes the bootloader.

The bootloader (such as GRUB on Linux or Windows Boot Manager) bridges the gap between firmware and kernel. It loads the kernel image from disk into RAM and passes control to it along with essential parameters — which root filesystem to mount, what hardware configuration to assume, and any boot flags the user specified. On systems with multiple operating systems, the bootloader also presents a menu letting the user choose which kernel to start. The bootloader runs in a constrained environment with no virtual memory, no process management, and only basic disk I/O — it exists purely to get the kernel into memory and jump to its entry point.

Once the kernel takes over, it must build all the infrastructure that an operating system provides from scratch. It initializes the interrupt descriptor table so it can respond to hardware events, sets up memory management by creating initial page tables and enabling virtual memory, and probes the system to discover attached hardware. Device drivers are loaded — either compiled into the kernel or read from an initial ramdisk (initrd/initramfs) that the bootloader placed in memory alongside the kernel. Each driver registers itself to handle specific hardware: disk controllers, network interfaces, display adapters, and input devices.

The final act of kernel initialization is spawning the first user-space process, traditionally called init (PID 1). On modern Linux systems this is typically systemd; on older systems it was SysVinit. This process is special: it is the ancestor of every other process on the system, it never exits during normal operation, and it is responsible for starting all user-space services — networking, login managers, scheduled tasks, and everything else that makes the system usable. Once init is running, the kernel's boot job is done. It retreats into its role as resource manager, responding to system calls and hardware interrupts while user-space programs take the foreground.

Practice Questions 5 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → Boolean Algebra → Boolean Type and Truth Values → Comparison Operators and Boolean Tests → Logical Operators and Boolean Algebra → Boolean Algebra and Fundamental Laws → Logic Gates Fundamentals → Implementing Boolean Functions with Gates → Karnaugh Map Simplification → Combinational Circuit Design → Flip-Flops and Latches → Binary Counters: Design and Analysis → Binary Arithmetic → Fixed-Point Number Representation → Two's Complement Representation → Overflow and Underflow Detection → Binary Adders: Half-Adders and Full-Adders → Full Adder and Carry Propagation → Carry Lookahead Adder Design → Half Adder Circuit Design → Multiplication Circuit Design → Sequential Circuit Design → Registers and Register Files → Instruction Set Architecture (ISA) → Kernel Architecture and OS Structure → Boot Process and Kernel Initialization

Longest path: 93 steps · 352 total prerequisite topics

Prerequisites (2)

Leads To (1)