Set Associative Mapping Part-1

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/RSSB-BASIC-COMPUTER-INSTRUCTOR/paper-2-computer-organization-and-architecture/cache-memory-organization/set-associative-mapping/asset-set-associative-mapping-part-1 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About the Course: About the Course
  2. Paper-1 & 2 | Basic Numeracy: Ratio and Proportion (Ratios), Divisibility Rules, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Percentage, Average, Mensuration and Geometry, Age Problems, Arithmetic, Statistics, Probability, Profit and Loss, Simple Interest and Compound Interest, Partnership, Speed Mathematics and Basic Mathematics, Algebra, Powers and Exponents (Surds and Indices), Time and Work, Pipe and Cistern, RSSB Specific Videos - Basic Numeracy
  3. Paper-1 & 2 | Data Interpretation: Data Interpretation
  4. Paper-1 & 2 | General Mental Ability: Mental Ability, RSSB Specific Videos - Mental Ability
  5. Paper-1 & 2 | Logical Reasoning and Analytical Ability: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Syllogisms, Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Venn Diagram, Analogy, Ranking, Order and Sequence, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Data Arrangement, Logical Sequence Of Words, Crypt Arithmetic
  6. Paper-1 & 2 | Decision Making and Problem Solving: Selection Decision Table (Decision Making)
  7. Paper-1 | General Science: Physics, Biology, Chemistry, RSSB Specific Videos
  8. Paper-1 | General Awareness: State Wise GK, GK- Current Affairs
  9. Paper - 2 | Digital Logic Systems: Digital Systems & Boolean Basics, Logic Gates & Hardware, Combinational Circuit, Sequential Circuits
  10. Paper-2 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Calculus, Relational Algebra, SQL, NoSQL
  11. Paper-2 | Data Structures & Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Algorithm Analysis, Sorting Algorithms, Intro to Compilers, Hashing
  12. Paper 2 | Data Communication and Network Security: Introduction to CN, Data Communication, Data Link Layer - Ethernet, DLL: Error Control, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Application Layer, Hardware basics, Network Security, Ethical Hacking
  13. Paper-2 | Operating Systems: Introduction to OS, Process Management, Memory Management, File Management, Deadlock
  14. Paper-2 | Computer Organization and Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Programming the Basic Computer, Number System, Number Representation
  15. Paper 2 | System Analysis and Design: Fundamentals of Systems and Information Systems, Fundamentals of Software Engineering, SDLC and Development Approaches, Software Documentation and Software Requirements Specification (SRS), SDD and Quality Assurance, Security, Risk Management & Maintenance, Software Testing
  16. Paper-2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  17. Paper 2 | OOPS , C++ , JAVA: Language Design, OOPS with C++, Java, .Net Programming, Java Fundamentals
  18. Paper 2 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  19. Emerging Trends and AI: Emerging Tech Trends, Artificial Intelligence
  20. Paper-2 | Data Processing (Ms-Office): MS Office Applications
  21. Paper-2 | Internet and Web Technologies: HTML Basics, CSS, XML, JavaScript-Basics, Internet Fundamentals, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, Terms & Abbreviations, Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing
  22. Paper 2 | Pedagogy: Child Development, Theories, Concept of Pedagogy, Inclusive Education, Experiential Pedagogy, Assessment & Evaluation, Psychology, Curriculum Framework & Reforms, National Education Policy (NEP) 2020
  23. Live Classes: RSSB Live Sessions
  24. Paper 1 - Full Mock Tests:
  25. Paper 2 - Full Mock Tests:
  26. BCI Previous Year Papers:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video lecture introduces Set Associative Mapping in computer architecture. It defines k-way set associative mapping where cache lines are grouped into sets of size 'k'. It explains that a main memory block maps to a specific set but can occupy any line within that set. The instructor uses a diagram to illustrate a 2-way set associative cache with 4 lines (CL-0 to CL-3) and 16 memory blocks (B-0 to B-15), demonstrating how blocks are distributed into Set-0 and Set-1 based on modulo arithmetic. This hybrid approach balances the speed of direct mapping with the flexibility of fully associative mapping.

Chapters

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

    The lecture begins with a definition slide for Set Associative Mapping. The instructor explains that in k-way set associative mapping, cache lines are grouped into sets, each containing 'k' lines. He clarifies that a specific main memory block maps to only one particular set of the cache, but within that set, it can map to any freely available cache line. This establishes the hybrid nature of the mapping, combining direct and fully associative characteristics. The slide text explicitly states: 'In k-way set associative mapping, cache lines are grouped into sets where each set contains 'k' number of lines.' This foundational concept is crucial for understanding how cache memory manages data placement efficiently.

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

    The visual shifts to a diagram illustrating a 2-way set associative cache. The cache has 4 lines (CL-0 to CL-3) divided into two sets: Set-0 (CL-0, CL-1) and Set-1 (CL-2, CL-3). The instructor draws red circles around these components to highlight the grouping. He explains the mapping logic, writing numbers like 0, 4, 8, 12 next to Set-0 and 2, 6, 10, 14 next to Set-1. He demonstrates that memory blocks B-0, B-4, B-8, and B-12 map to Set-0, while B-2, B-6, B-10, and B-14 map to Set-1. This visual aid clarifies how blocks are distributed across sets while maintaining flexibility within the set. The diagram shows lines connecting memory blocks to the sets, illustrating the relationship between memory blocks and sets.

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

    In the final segment, the instructor reinforces the concept of flexibility within the set. He gestures towards the connections between memory blocks and the cache sets, emphasizing that while the set is fixed, the specific line within that set is not. He highlights that if a line in the target set is occupied, a replacement policy must be used. This concludes the explanation of the mapping mechanism shown in the diagram. The instructor's hand movements and pointing gestures serve to draw attention to the specific lines and sets being discussed, ensuring students grasp the dynamic nature of data placement in set associative mapping.

The lecture progresses from theoretical definition to practical application. It starts by defining k-way set associative mapping, establishing that memory blocks map to specific sets but have freedom within those sets. It then transitions to a concrete example using a 2-way set associative cache diagram. The instructor visually demonstrates the mapping of 16 memory blocks into 2 sets of 2 lines each, using modulo arithmetic to determine set assignment. This progression helps students understand the balance between the rigidity of direct mapping and the flexibility of fully associative mapping. The use of diagrams and annotations provides a clear visual representation of abstract concepts, making the learning process more effective.

Loading lesson…