Swappiness
Duration: 7 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Discrete Mathematics: Permutation, Combination and Probability / क्रमचय, संचय एवं प्रायिकता, Set Theory, Relations, Functions, Propositional and Predicate Logic, Graph Theory, Group Theory
- Digital Logic: Digital Systems & Boolean Basics, Boolean Expression, Boolean Minimization, Logic Gates & Hardware, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
- Computer Organization and Architecture: Basics of COA, Programming the Basic Computer, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Pipelining, Multiprocessors
- Programming: Language Design, C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++
- Data Structures: Introduction to DS, Array, Linked List, Stack, Queue, Tree, Graphs, Hashing
- Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
- Theory of Computation: Grammar, Regular Language Properties, Moore & Mealy Machines, Turing Machines
- Compiler Design: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization, Run Time Environment, Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Pushdown Automata & CFG, Complexity Theory
- Operating Systems: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Security
- Database Management Systems: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control, ORDBMS, NoSQL
- Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics, Network Security
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This lecture introduces Linux memory management and focuses on the Swappiness kernel parameter. The instructor begins with an overview slide listing main components: physical memory, virtual memory, page tables, page cache, memory reclaim, swap, and OOM handling. The lesson then transitions to Swappiness, defined as a kernel parameter controlling the relative tendency to use swap compared with filesystem paging under memory pressure. The parameter is accessed via /proc/sys/vm/swappiness, has a range of 0-200, and defaults to 60. Lower values favor avoiding swap; higher values prefer swapping. A diagram shows OS/main memory and disk swap space connected by “Swapping out” and “Swapping in” arrows. Commands for checking and temporarily changing the value are referenced.
Chapters
0:00 – 2:00 00:00-02:00
The video opens with a slide titled “Linux Memory Management Overview,” stating that Linux manages both physical memory (RAM) and virtual memory efficiently. Under “Main Components,” bullets list Physical Memory Management, Virtual Memory, Page Tables, Page Cache, Memory Reclaim, Swap, and OOM Handling. The instructor gestures while explaining the list; red checkmarks appear next to the first five components, visually confirming them before moving on.
2:00 – 5:00 02:00-05:00
The slide transitions to “Swappiness,” defined as a Linux kernel parameter controlling the relative tendency to use swap compared with filesystem paging when memory pressure occurs. The on-screen path /proc/sys/vm/swappiness is shown, with the range 0-200 circled in red and “Default value is 60.” noted. Bullets state that lower values generally favor avoiding swap, while higher values give relatively more preference to swapping. A diagram pairs an OS/Main Memory block with a Disk cylinder labeled “Swap Space,” linked by “Swapping out” and “Swapping in” arrows.
5:00 – 6:49 05:00-06:49
The Swappiness slide remains on screen, reinforcing the definition and key facts: range 0-200, default 60, lower values avoid swap, higher values prefer swapping. The green path /proc/sys/vm/swappiness is displayed with labels “Check Current Value” and “Temporarily Change,” indicating the commands used to inspect and modify the parameter. The swapping diagram continues to illustrate movement of pages between main memory and swap space on disk.
The lecture builds from a broad overview of Linux memory management to the specific Swappiness parameter. The main components slide establishes context by naming swap among other subsystems, then the instructor narrows focus to Swappiness as a tunable kernel setting. The core definition—relative tendency to use swap versus filesystem paging under memory pressure—is the central concept, supported by the numeric range 0-200 and default of 60. The practical takeaway is that lowering Swappiness makes the kernel reluctant to swap, while raising it encourages swapping. The diagram of main memory and disk swap space with “Swapping out”/“Swapping in” arrows provides a visual model of the process. The file path /proc/sys/vm/swappiness and its associated check/change labels connect the concept to real system administration commands. This progression from overview to definition, tuning range, and practical access forms a coherent study unit on Swappiness.