Master Linux Process Management: From Fork to Scheduler

1.1 Linux Process Management

Process management is one of the most important functions of an operating system; efficient management ensures programs run smoothly and efficiently. Linux process management is similar to UNIX and includes scheduling, interrupt handling, signals, priorities, context switches, process states, and memory management.

1.1.1 What Is a Process?

A process is an instance of a program running on a processor, using any resources the Linux kernel can provide. All processes are managed by the task_struct structure, which stores identifiers, attributes, and resources needed for execution.

1.1.2 Process Lifecycle

Each process goes through creation, execution, termination, and cleanup. The fork() system call creates a child process, sharing the address space with the parent. exec() loads a new program into the child’s address space, using copy‑on‑write to avoid unnecessary copying. When a program finishes, the child calls exit(), becoming a zombie until the parent calls wait() to reap it.

1.1.3 Threads

A thread is an execution unit created by a process, sharing resources such as memory and open files. Threads are also called Light Weight Processes (LWP). Creating a thread incurs less overhead than creating a process because resources are not duplicated.

Common thread libraries in Linux include LinuxThreads (deprecated), Native POSIX Thread Library (NPTL), and IBM’s Next Generation POSIX Thread (NGPT). The LD_ASSUME_KERNEL environment variable can select the desired library.

1.1.4 Process Priority and Nice Value

Priority determines the order in which the CPU schedules processes. Linux supports nice values from -20 (highest priority) to 19 (lowest), with a default of 0. Raising priority (negative nice) requires root privileges.

1.1.5 Context Switches

During a context switch, the CPU saves the current process’s registers and cache (the context) and restores the next process’s context. Excessive switches degrade performance because the CPU must flush registers and caches.

1.1.6 Interrupt Handling

Interrupts, generated by I/O devices, have the highest priority. The kernel quickly handles them, often causing a context switch. Linux distinguishes hard interrupts (device‑generated) and soft interrupts (deferred tasks). Binding interrupts to specific CPUs can improve performance.

1.1.7 Process States

Processes can be in states such as TASK_RUNNING, TASK_STOPPED, TASK_INTERRUPTIBLE, TASK_UNINTERRUPTIBLE, and TASK_ZOMBIE, each reflecting its current activity or waiting condition.

1.1.8 Process Memory Segments

A process’s address space consists of Text (code), Data (initialized data, BSS, and heap), and Stack segments. Tools like pmap and ps can display memory layout.

1.1.9 Linux CPU Scheduling

Linux uses an O(1) scheduler (introduced by Ingo Molnar) that selects a process in constant time regardless of the number of processes. It maintains active and expired priority arrays, assigning time slices based on priority. The scheduler also supports NUMA and hyper‑threading, improving scalability on multi‑processor systems.