Set Associative Mapping Part-2
Duration: 4 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Discrete Mathematics: Permutation, Combination and Probability / क्रमचय, संचय एवं प्रायिकता, Set Theory, Relations, Functions, Propositional and Predicate Logic, Graph Theory, Group Theory
- Digital Logic: Digital Systems & Boolean Basics, Boolean Expression, Boolean Minimization, Logic Gates & Hardware, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
- Computer Organization and Architecture: Basics of COA, Programming the Basic Computer, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Pipelining, Multiprocessors
- Programming: Language Design, C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++
- Data Structures: Introduction to DS, Array, Linked List, Stack, Queue, Tree, Graphs, Hashing
- Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
- Theory of Computation: Grammar, Regular Language Properties, Moore & Mealy Machines, Turing Machines
- 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, Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Pushdown Automata & CFG, Complexity Theory
- Operating Systems: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Security
- Database Management Systems: 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, ORDBMS, NoSQL
- Computer Networks: 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
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
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: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.