Understanding process priority control in UNIX systems
This is an easy foundational question about operating systems that tests familiarity with core UNIX concepts. It probes whether you understand how modern schedulers allocate CPU time across competing processes—a basic but essential topic for anyone working with system-level code or infrastructure.
The question targets knowledge of the classic UNIX mechanism that allows administrators and processes to hint to the kernel about their relative importance. This is directly relevant to performance tuning, resource management, and understanding how operating systems enforce fairness or prioritise latency-sensitive workloads. The concept is covered in depth in Operating Systems: Three Easy Pieces, a foundational text on how schedulers balance competing demands.
- Process scheduling and CPU allocation
- Kernel hints and scheduler behaviour
- System administration and process management