Set Associative Mapping Part-2

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/SSC-JE-IMD-SCIENTIFIC-ASSISTANT-COMPUTER-SCIENCE/computer-organisation-architecture/cache-memory-organization/set-associative-mapping/asset-set-associative-mapping-part-2 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. General Intelligence & Reasoning: Analogy, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Logical Sequence Of Words, Syllogisms, Venn Diagram, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Data Sufficiency, Puzzle Solving (Puzzles), Data Arrangement, Cubes & Dices, Calendar, Clock, Arithmetic, Number System, HCF LCM, Verbal Analogy (Word Based Analogy), Visual Recognition and Figure Completion, Paper Folding and Cutting, Transformation of Shapes, Clocks and Calendars, Direction Sense, Cubes and Dice, Patterns in Two-Dimensional Figures, Seating Arrangements, Analogy and Classification, Logical Deduction and Induction, Alphabet and Word Tests, Mathematical Operations, Series Completion, Simplification and Approximation, Coding and Decoding, Numerical Reasoning, Assembling and Grouping of Shapes, Three-Dimensional Patterns and Visualization, Vocabulary, Number System, Averages, Mixtures and Alligation, Simple and Compound Interest, Percentages, Algebra, Speed, Time and Distance, Seating and Arrangement Puzzles, Traverse Surveying, Order, Ranking and Sequence, Constraint Puzzles, Syllogisms and Venn Diagrams, Reading Comprehension, Critical Reasoning, Permutations and Combinations, Narrative Sequencing, Project Monitoring, Resources and Safety, Profit, Loss and Discount, Ratio and Proportion, Time and Work, Mensuration, Data Interpretation, Powers, Surds and Logarithms, Sequences and Series, Articles and Determiners, Sentence Completion, Data Sufficiency, Blood Relations, Simple Interest and Compound Interest, Mixture and Alligation, Sequence and Series (Series), Speed Time and Distance, Algebra, Profit and Loss, Powers and Exponents (Surds and Indices), Permutation and Combination
  2. General Awareness: Physics, Chemistry, Biology, History, Geography, Polity, Indian Economy, Environment, Static General Knowledge, GK- Current Affairs, Artificial Intelligence, MS Office Applications, Terms & Abbreviations, Keyboard Shortcuts, Evolution of Indian Banking (Banking & Financial Awareness), Emerging Tech Trends
  3. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus, Probability, Statistics, Signal Space and Optimum Detection, Probability, Statistics
  4. Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep, Number Systems and Codes, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, 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, Latches and Flip-Flops, Finite State Machines, Sequential Circuits and State Machines, Minimization of Boolean Functions, Arithmetic Circuits, Latches and Flip-Flops, Number Systems and Codes, Registers and Counters
  5. Computer Organisation & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer, Register Transfer and Microoperations, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output, Registers and Counters
  6. 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, HTML Basics, OOPS with C++, Java, Object Oriented Technology
  7. Databases: 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, Database Recovery, Database Security & Authorization
  8. Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  9. 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, Complexity Theory
  10. 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. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Security, Windows OS, Distributed Systems, Unix OS, Linux OS
  12. Computer Networks: Introduction to CN, 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, Data Communication, Website, Browser & Services, Web Design & Development, Network Security, Cyber Threats and Malware Attacks, Cyber Safety and Security
  13. Full Length Mock Tests:
  14. Sectional Tests:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video lecture focuses on set-associative cache mapping in computer architecture. The instructor begins by defining the structure of physical addresses and cache lines, specifically breaking down the address into Tag, Set, and Block Offset fields. He uses diagrams to illustrate how main memory blocks are mapped to cache sets. The lecture progresses to a concrete example involving a 2-way set-associative cache with 4 cache lines (2 sets) and 16 main memory blocks. Finally, the hardware implementation of this mapping is explained using a block diagram showing multiplexers, comparators, and the selection logic.

Chapters

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

    The instructor introduces the formula for the number of sets and breaks down the physical address structure. He displays a diagram where the 'Main Memory (Physical Address)' is split into 'Block Number' and 'Block Offset'. He annotates the diagram with bit counts, writing '8' for the Block Number and '2' for the Block Offset. He then transitions to the cache structure, showing 'Tag', 'Set', and 'Block Offset'. He writes '2' for Tag bits and '2' for Cache Line (Set) bits in one example, and later '3' for Tag and '1' for Set in another, illustrating how address bits are allocated. He writes 'Bits Transferred' with values like '2w', '4w', '3w', '8w', likely referring to word sizes or data transfer widths associated with the cache lines. He circles 'Set 1' in the lower diagram to emphasize the set selection process.

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

    The lecture moves to a specific mapping example. A diagram shows a cache with 'Set Number-0' (containing CL-0, CL-1) and 'Set Number-1' (containing CL-2, CL-3) connected to main memory blocks B-0 through B-15. The instructor writes a binary address '1001 01' at the top. He draws lines connecting specific cache lines to memory blocks, highlighting B-8 and B-9. A detailed table is shown mapping Set Numbers to Cache Lines (CL-0 to CL-3) and listing the specific Blocks (B-0, B-2, etc.) and Words (W-0, W-1, etc.) stored in each. The instructor then presents a 'Hardware Architecture' diagram for 2-Way Set Associative Mapping. This diagram illustrates the flow from Tag, Set Number, and Block Offset inputs through Multiplexers to select a set, then through Comparators to check the Tag, and finally through an OR gate to produce the result. He highlights 'Set-1 (Selected)' in the cache memory block to demonstrate the selection mechanism.

The video provides a comprehensive overview of set-associative cache mapping, starting from theoretical address breakdown to practical hardware implementation. The instructor effectively uses diagrams to visualize the relationship between main memory blocks and cache sets, demonstrating how address bits are partitioned into Tag, Set, and Offset. The transition from abstract formulas to a concrete 2-way set-associative example with 16 memory blocks helps clarify the mapping process. The final hardware architecture diagram ties the concepts together by showing the physical components like multiplexers and comparators required to execute the mapping logic, ensuring students understand both the logical structure and the physical realization of cache memory systems.

Loading lesson…