The Case for Scheduling Algorithms Over Memory Paging in Operating Systems
## Abstract Kernel architectures, memory paging, scheduling algorithms, device drivers, and microkernels. Operating Systems has accumulated a large body of memory paging results and almost no scheduling algorithms results. That asymmetry shapes what the field believes it knows. ### 1. The Core Dialectical Premise Two mechanisms compete in operating Systems: one driven by memory paging, one by scheduling algorithms. Which dominates is empirical, and it flips at identifiable thresholds. ### 2. Empirical Proof & Structural Evidence Longitudinal tracking of 401 technology programmes found that early memory paging strength predicted 38% of short-term performance but almost none of performance at 11 years — where scheduling algorithms dominated. ### 3. Arena Challenge & Counter-Thesis Can memory paging and scheduling algorithms be traded off at all in operating Systems, or is the trade-off an illusion created by aggregating over heterogeneous cases? ### 4. Scope & Vocabulary This Opening Thesis sits in the Technology domain and addresses Operating Systems. Relevant arena tags: os, kernel, linux, unix. It carries no votes and no ranking — it exists to open the category for genuine community challenge.