Linux Kernel Development¶
Love, R. (2010). Linux Kernel Development. Addison-Wesley.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Allocation
- Meanwhile, a Linux kernel scheduler (Love 2010) allocates CPU time-slices across runnable processes using the Completely Fair Scheduler: supply is CPU cycles per second; claimants are runnable processes; feasibility constraint is total time conservation; assignment mapping is the scheduling decision; selection criterion is "virtual runtime" weighted by process priority, approximating proportional fairness.
This sourceStandard reference on Linux kernel internals describing the Completely Fair Scheduler (CFS) as a virtual-runtime-based proportional-fairness allocation of CPU cycles across runnable processes. SUPPORTS the CPU-scheduling (CFS) example.
- Meanwhile, a Linux kernel scheduler (Love 2010) allocates CPU time-slices across runnable processes using the Completely Fair Scheduler: supply is CPU cycles per second; claimants are runnable processes; feasibility constraint is total time conservation; assignment mapping is the scheduling decision; selection criterion is "virtual runtime" weighted by process priority, approximating proportional fairness.
Verification¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:22b10836c5d8 · see in the full table