Proportional Allocation

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/CDAC-C-CAT-COMPLETE-PREPARATION/section-b-os/virtual-memory/thrashing-allocation/asset-proportional-allocation after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Section A | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Preposition, Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Articles, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Verbal Analogy (Word Based Analogy)
  2. Section A | Quant Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Arithmetic, Algebra, Powers and Exponents (Surds and Indices), Average, Age Problems, Percentage, Profit and Loss, Partnership, Time and Work, Simple Interest and Compound Interest, Mensuration and Geometry, Probability, Pipe and Cistern
  3. Section A | Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Calendar, Clock, Blood Relations, Directions (Direction Test), Seating Arrangements, Ranking, Order and Sequence, Puzzle Solving (Puzzles)
  4. Section B | C Programming: C Programming by Yash Sir, Coding Questions by Yash Sir
  5. Section B | Data Structures: Algorithm Analysis, Greedy Algorithms, Time Complexity Analysis, Sorting Algorithms, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs
  6. Section B | OOP (C++): Object Oriented Programming (OOPS), Programming in C++
  7. Section B | OS: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS
  8. Section B | Networking: 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
  9. Section B | AI & Big Data Basics: AI & ML by Arun Sir, Big Data Systems
  10. Section C | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Analog-Digital Conversion
  11. Section A, C | Comp. Fundamentals, COA: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Multiprocessors, Programming the Basic Computer
  12. MOCK TEST:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video lecture explains the concept of Weighted or Proportional Allocation in operating system memory management. The instructor introduces a specific formula used to distribute physical memory frames among processes based on their relative sizes. The core formula presented is a(i) = s(i) / S x m, where allocation is proportional to the process size. A detailed numerical example is worked through on a digital whiteboard, demonstrating how to calculate the exact number of frames assigned to three distinct processes with sizes of 20k, 30k, and 50k, given a total of 30 available frames.

Chapters

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

    The video begins with a slide titled 'Weighted / Proportional Allocation'. The instructor explains that frames are allocated according to the weights of the process. He defines the formula a(i) = s(i) / S x m. He clarifies that a(i) represents the number of allocated frames, s(i) is the size of the specific process, S is the total size of virtual memory (calculated as the sum of all process sizes), and m is the total number of frames available in the system. He sets up an example scenario involving three processes with sizes of 20k, 30k, and 50k, and a total of 30 frames to be allocated.

  2. 2:00 – 4:14 02:00-04:14

    The instructor moves to the whiteboard to solve the example. He writes down the process identifiers P1, P2, and P3 with their respective sizes: 20k, 30k, and 50k. He calculates the total virtual memory size S as 100k (20+30+50). He then calculates the allocation for P1 as (20/100)*30, resulting in 6 frames. He similarly determines that P2 gets 9 frames and P3 gets 15 frames. He draws a diagram labeled '1GB' with a rectangle divided into blocks to visualize the memory structure, circling the final formula to emphasize its importance in the calculation.

The lecture effectively bridges theoretical formulas with practical application. By defining the variables in the proportional allocation formula and then immediately applying them to a concrete example, the instructor demonstrates how larger processes receive a larger share of memory frames. The visual aids, including the written calculations and the memory block diagram, reinforce the concept that allocation is strictly proportional to the process size relative to the total system memory.

Loading lesson…