Proportional Allocation

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/HEXAWARE-PREPARATION/operating-systems/virtual-memory/thrashing-allocation/asset-proportional-allocation after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Quantitative Ability: Speed Mathematics and Basic Mathematics, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Pipe and Cistern, Speed Time and Distance, Number System, HCF LCM, Data Interpretation, Age Problems, Mixture and Alligation, Partnership, Algebra, Sequence and Series (Series), Mensuration and Geometry, Arithmetic
  2. Reasoning Ability: Puzzle Solving (Puzzles), Seating Arrangements, Coding Decoding, Blood Relations, Directions (Direction Test), Syllogisms, Data Sufficiency, Ranking, Order and Sequence, Series (Number and Letter Series) (Numerical Relations and Reasoning), Logical Sequence Of Words, Calendar, Clock, Cubes & Dices, Analytical Reasoning (Counting Figures Reasoning), Data Arrangement, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning)
  3. Verbal Ability: Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Vocabulary, Sentence Completion (Fill in the blanks), Active Passive Voice (Voice), Direct and Indirect Speech, Subject Verb Agreement (Verb Noun Agreement), Tenses, Preposition, Articles, Sentence Correction (Error Correction)
  4. Programming Basics (MCQs + Interview): C Programming by Yash Sir, Programming in C++, Java, Python for Placements by Yash Sir
  5. OOPs (MCQs + Interview): Object Oriented Programming (OOPS)
  6. DBMS (MCQs + Interview): Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Transaction Management, Decomposition Properties & 4NF, Concurrency Control, Database Recovery, File Organization & Indexing, Relational Algebra, Database Security & Authorization
  7. SQL (MCQs + Interview): SQL
  8. Operating Systems (MCQs + Interview): Introduction to OS, Process Management, CPU Scheduling, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Process Synchronization, Disc Scheduling, File Management, Security
  9. Computer Networks (MCQs + Interview): 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, Mobile Technology, Cloud Computing and IoT, Cyber and Info Security
  10. Coding: Coding Questions by Yash Sir
  11. HR Interview: MR & HR Interview Preparation
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…