Basics of Memory Organization

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/BIHAR-POLYTECHNIC-LECTURER-COMPUTER-SCIENCE/paper-1-computer-organization-and-architecture/cache-memory-organization/memory-organisation-performance/asset-basics-of-memory-organization after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Discrete Mathematics: Permutation, Combination and Probability / क्रमचय, संचय एवं प्रायिकता, Set Theory, Relations, Functions, Propositional and Predicate Logic, Graph Theory, Group Theory
  2. Digital Logic: Digital Systems & Boolean Basics, Boolean Expression, Boolean Minimization, Logic Gates & Hardware, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
  3. 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
  4. Programming: Language Design, C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++
  5. Data Structures: Introduction to DS, Array, Linked List, Stack, Queue, Tree, Graphs, Hashing
  6. Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  7. Theory of Computation: Grammar, Regular Language Properties, Moore & Mealy Machines, Turing Machines
  8. 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
  9. 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
  10. 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
  11. 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 covers the fundamental concepts of computer memory organization, specifically focusing on how memory is structured and accessed by the CPU. It begins by categorizing memory organization into two broad types based on access methods: Simultaneous Access and Hierarchical Access. The lecture then delves deeper into Hierarchical Access Memory Organization, detailing the sequential connection of memory levels (Level-1, Level-2, Level-3) and the search process where the CPU checks levels in order. Finally, the instructor derives and explains the mathematical formula for Effective Memory Access Time (EMAT), defining variables for access time, size, cost, and hit rate for each memory level to calculate average access time.

Chapters

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

    The session begins with a slide titled 'Memory Organization' which lists bullet points: 'Memory is organized at different levels' and 'CPU may try to access different levels of memory in different ways'. Based on this, the organization is divided into two types: 'Simultaneous Access' and 'Hierarchical Access', illustrated by a branching diagram. The instructor, Sanchit Jain Sir, introduces these concepts as the broad classification for memory systems. He mentions that in simultaneous access, all levels are directly connected to the CPU, while hierarchical access involves a sequential connection.

  2. 2:00 – 3:12 02:00-03:12

    The lecture focuses on 'Hierarchical Access Memory Organization'. A diagram shows the CPU connected to Level-1, which is connected to Level-2, and Level-3. The instructor explains that whenever the CPU requires a word, it first searches Level-1. If not found, it searches Level-2, and so on. A table defines parameters: T1 (Access time of level L1), S1 (Size), C1 (Cost per byte), and H1 (Hit rate). The slide presents the text 'Average time required to access memory per operation =' followed by the formula: H1 * T1 + (1 - H1) * H2 * (T1 + T2) + (1 - H1)(1 - H2) * H3 * (T1 + T2 + T3). The instructor explains that the first term is the time for a hit at level 1. The second term accounts for a miss at level 1 (probability 1-H1) and a hit at level 2, adding the access times of both levels (T1 + T2). The third term accounts for misses at levels 1 and 2, and a hit at level 3, summing all access times. He emphasizes that the data item will definitely be present in the last level, so the hit rate for the last level is always 1.

The video systematically builds understanding of memory hierarchy. It starts by defining the two main access types, then zooms in on the hierarchical model. The instructor uses diagrams to show physical connections and search flow. The lesson culminates in a mathematical derivation of EMAT, breaking down the probability-weighted average time based on hit rates and cumulative access times, providing a complete picture of hierarchical memory performance.

Loading lesson…