Page Size

Duration: 10 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/operating-system/memory-management/multilevel-paging/asset-page-size after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper-2 | Programming & Data Structures: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  3. Paper-2 | Databases / DBMS & SQL: 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
  4. Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  5. Paper-2 | Computer Networks & Security: 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 Access Technologies, Network Security
  6. Paper-2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, Number Systems and Codes, Minimization of Boolean Functions, Timing, Hazards and Testing, Logic Families, Combinational Logic Design, Arithmetic Circuits, Waveform Generators and Timer Circuits, Semiconductor Memories and Programmable Logic Devices, Combinational Logic Circuits, Sequential Circuits and State Machines, Latches and Flip-Flops, Finite State Machines, Minimization of Boolean Functions, Arithmetic Circuits, Registers and Counters, Latches and Flip-Flops, Number Systems and Codes
  7. Paper-2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  8. Paper-2 | Theory of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines
  9. Paper-2 | Computer Organization & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
  10. Paper-2 | 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
  11. Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
  12. Paper-1 | Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Data Interpretation, Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Clock, Calendar, Cubes & Dices, Directions (Direction Test), Analogy, Seating Arrangements, Analytical Reasoning (Counting Figures Reasoning), Alphabet and Word Tests, Numerical Reasoning, Number System, Averages, Mixtures and Alligation, Percentages, Series Completion, Analogy and Classification, Patterns in Two-Dimensional Figures, Coding and Decoding, Mathematical Operations, Data Sufficiency, Direction Sense, Assembling and Grouping of Shapes, Transformation of Shapes, Three-Dimensional Patterns and Visualization, Cubes and Dice, Vocabulary, Statistics, Algebra, Geometry, Permutations and Combinations, Logical Deduction and Induction, Syllogisms and Venn Diagrams, Critical Reasoning, Order, Ranking and Sequence, Reading Comprehension, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Profit, Loss and Discount, Constraint Puzzles, Clocks and Calendars, Traverse Surveying, Simplification and Approximation, Blood Relations, Data Interpretation, Venn Diagram
  13. Paper-1 | Quantitative Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Speed Time and Distance, Average, Age Problems, Percentage, Profit and Loss, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra, Ratio and Proportion, Subject-Verb Agreement, Sentence Completion, Powers, Surds and Logarithms, Data Interpretation, Sequences and Series, Trigonometry, Mensuration, Measurement and Quantity Take-Off, Signal Space and Optimum Detection, Time and Work, Probability, Algebra, Speed, Time and Distance, Statistics, Sequence and Series (Series), Combinatorics
  14. Paper-1 | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Structure and Correction, Modals, Conditionals and Subjunctive, Tenses, Adjectives and Adverbs, Sentence Basics, Nouns and Pronouns, Voice and Reported Speech, Articles and Determiners, Vocabulary
  15. Coal India Previous Year Paper:
  16. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
  17. Coal India Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video lecture focuses on determining the optimal page size in operating systems to minimize total memory overhead. The instructor explains the trade-off between internal fragmentation and page table size. He defines variables for process size (x), page size (y), and page table entry size (z). He derives a cost function representing the sum of average internal fragmentation (y/2) and total page table size (xz/y). By differentiating this function with respect to page size (y) and setting it to zero, he derives the optimal page size formula: y = sqrt(2xz). The lecture begins by discussing the conflicting requirements: larger pages reduce the number of pages and thus the page table size, but increase the potential for wasted space within the last page. Conversely, smaller pages reduce waste but increase the overhead of managing more pages.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The instructor introduces the topic "Size of Page" on a slide titled "Size of Page". He reads the bullet points which discuss the relationship between page size, internal fragmentation, and page table size. He notes that increasing the page size increases internal fragmentation but decreases the page table size, while decreasing the page size has the opposite effect. He defines three variables on the whiteboard: `Process size = x`, `Page size = y`, and `Page table entry = z`. He states the objective is to find the page size `y` where both costs (internal fragmentation and page table size) are minimal. He gestures towards the text on the slide to emphasize the trade-off. The slide text contains a typo, stating "If we increase the size of page table then internal fragmentation increase", but the instructor clarifies the intended meaning regarding page size. He explains that the goal is to balance these two opposing costs to find an optimal value.

  2. 2:00 – 5:00 02:00-05:00

    The instructor begins to visualize the problem by drawing a large rectangle representing the process size `x`. He divides this rectangle into smaller blocks representing pages of size `y`. He explains that the number of pages is `x/y`. He introduces the concept of internal fragmentation, stating that the maximum internal fragmentation is equal to the page size `y`, while the average internal fragmentation is `y/2`. He also defines the size of the page table as the number of pages multiplied by the size of a page table entry `z`, resulting in the formula `(x/y) * z`. He writes these components on the board to set up the cost function. He also writes down example values like `PS = 1KB` and `PI = 10B` to illustrate the concepts concretely. He draws lines inside the rectangle to show the division into pages, making the abstract concept of paging more tangible for the students.

  3. 5:00 – 10:00 05:00-10:00

    The instructor sets up the total cost equation by summing the average internal fragmentation and the total page table size: `Total Cost = (xz/y) + (y/2)`. To find the minimum cost, he differentiates this equation with respect to `y`. He writes the derivative as `d/dy (xz/y + y/2) = 0`. He calculates the derivative of the first term as `-xz/y^2` and the second term as `1/2`. Setting the sum to zero gives `-xz/y^2 + 1/2 = 0`. He rearranges the equation to solve for `y`, moving `xz/y^2` to the other side to get `1/2 = xz/y^2`. He then cross-multiplies to find `y^2 = 2xz`. Finally, he takes the square root to derive the optimal page size formula: `y = sqrt(2xz)`. He writes the final result clearly on the board. He explains that this formula gives the page size that minimizes the total overhead, balancing the cost of fragmentation against the cost of the page table.

  4. 10:00 – 10:12 10:00-10:12

    The instructor concludes the derivation by pointing to the final formula `y = sqrt(2xz)` written on the board. He emphasizes that this specific value for page size `y` minimizes the total overhead associated with memory management in a paging system. He reinforces that this mathematical result provides the theoretical optimal page size based on the process size and page table entry size. He gestures to the formula to ensure students understand the final takeaway of the lecture. He summarizes that this optimization is crucial for efficient memory utilization in operating systems.

The lecture provides a clear mathematical derivation for optimizing page size in operating systems. It starts by identifying the conflicting goals of minimizing internal fragmentation and minimizing page table size. By modeling these costs as functions of page size, the instructor uses calculus to find the equilibrium point. The final formula `y = sqrt(2xz)` serves as a practical guideline for system designers to balance memory efficiency against management overhead. This derivation is a classic example of applying mathematical optimization to computer science problems.

Loading lesson…