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 StructureSlab 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 ZeroThe Number ZeroCounting to FiveCounting to 10Counting to 20Counting a Set of Objects Up to 20Cardinality: The Last Number CountedMatching Numerals to QuantitiesSubitizing Small QuantitiesAddition Within 10Number Bonds to 10Addition Within 20Doubles and Near DoublesDoubles Facts Within 10Near Doubles Facts Within 20Mental Math Strategies for AdditionMental Math: Adding and Subtracting TensAddition Within 100Repeated Addition as MultiplicationMultiplication as Equal GroupsMultiplication: ArraysBasic Multiplication Facts (0s, 1s, 2s, 5s, 10s)Multiplication Facts Within 100Division as Equal SharingDivision as Grouping (Measurement Division)Division: Grouping (Repeated Subtraction) ModelDivision: Fair Sharing ModelDivision as Equal SharingDivision as GroupingBasic Division FactsDivision Facts Within 100Multiplication and Division Fact FamiliesRelationship Between Multiplication and DivisionDivision Facts as Inverse of MultiplicationRemainders and Quotients in DivisionDivision Word ProblemsMulti-Step Word ProblemsSolving Multi-Step Word ProblemsMultiplication Word ProblemsDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueIntegers and the Number LineComparing and Ordering IntegersAbsolute ValueAdding IntegersSubtracting IntegersMultiplying IntegersIntroduction to ExponentsOrder of OperationsInteger Order of OperationsVariable ExpressionsThe Distributive PropertyVariables and Expressions ReviewIntroduction to PolynomialsAdding and Subtracting PolynomialsMultiplying PolynomialsFactorialPermutationsCombinationsCounting Principles: Addition and Multiplication RulesIntroduction to Graph TheoryPropositional Logic FoundationsLogical EquivalencesBoolean AlgebraBoolean Type and Truth ValuesComparison Operators and Boolean TestsLogical Operators and Boolean AlgebraBoolean Algebra and Fundamental LawsLogic Gates FundamentalsImplementing Boolean Functions with GatesKarnaugh Map SimplificationCombinational Circuit DesignFlip-Flops and LatchesBinary Counters: Design and AnalysisBinary ArithmeticFixed-Point Number RepresentationTwo's Complement RepresentationOverflow and Underflow DetectionBinary Adders: Half-Adders and Full-AddersFull Adder and Carry PropagationCarry Lookahead Adder DesignHalf Adder Circuit DesignMultiplication Circuit DesignSequential Circuit DesignRegisters and Register FilesInstruction Set Architecture (ISA)Kernel Architecture and OS StructureBoot Process and Kernel Initialization

Longest path: 93 steps · 352 total prerequisite topics

Prerequisites (2)

Leads To (1)