Speed up Derivation

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/MPPSC-ASSISTANT-PROFESSOR-COMPUTER-SCIENCE-PAPER-2/digital-computer-organization-and-architecture/pipelining/performance-speedup/asset-speed-up-derivation after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper 1 | General Studies: State Wise GK
  3. Paper 1 | Information and Communication Technology: Role of Internet and Web Services, Security in Mobile and Wireless Computing
  4. Paper 1 | Current Affairs: GK- Current Affairs
  5. Paper 2 | Discrete Mathematical Structure: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Probability
  6. Paper 2 | Digital Computer Organization And Architecture: Number System, Number Representation, Sequential Circuits, Combinational Circuit, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. Paper 2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  8. Paper 2 | Programming Languages & Object-Oriented Programming Concepts: Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  9. 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
  10. Paper 2 | Data Structure And Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Advanced Algorithms
  11. Paper 2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS
  12. Paper 2 | 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
  13. Paper 2 | 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
  14. Paper 2 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Enhanced Data Models
  15. Paper 2 | Computer Network And Information Security: Introduction to CN, Data Communication, Application Layer, Hardware basics, Cyber Threats and Malware Attacks, Network Security, 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
  16. Paper 2 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  17. Paper 2 | Current Trends & Technologies: Emerging Tech Trends, Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Fuzzy Sets, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms, Artificial Intelligence, Data Warehousing & Mining, Electronic Data Interchange and E-Commerce, Terms & Abbreviations
  18. Paper 2 | Full Length Mock Tests:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video provides a detailed lecture on the performance analysis of pipelined processors, specifically focusing on calculating Speedup, Maximum Speedup, and Efficiency. The instructor begins by defining the core formulas and then applies them to concrete numerical examples with varying numbers of instructions (N). The lesson progresses from small-scale examples (N=10) to larger scales (N=100 and N=10,000), demonstrating how performance metrics improve as the instruction count increases. Finally, the instructor derives a theoretical limit for speedup when the number of instructions is significantly larger than the number of pipeline stages, proving that speedup approaches the number of stages in the ideal case.

Chapters

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

    The session opens with a slide displaying the fundamental formulas for pipeline performance. The instructor writes 'Speed up = (Time without pipeline (Twp))/ (Time with pipeline (Tp)) =' and calculates a specific case where the result is '3.07' derived from '40us / 13us'. He defines 'Max Speed up' as the number of stages, which is 4 in this context. He then calculates 'Efficiency' as '(speed up/max speed up) * 100', resulting in '76.923%'. A pipeline diagram is visible, showing instructions I1 through I10 moving through stages IF, ID, EX, and WB, with red arrows indicating the flow and timing. The instructor circles 'N = 10' to emphasize the input parameter for this calculation. The logo 'KNOWLEDGEGATE' is visible in the background.

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

    The instructor transitions to a new example where the number of instructions is increased to 'N = 100'. He sets up the speedup calculation on the board, writing '400' as the numerator and '[4 + (100-1)] x 4' as the denominator. He uses a calculator tool to divide 400 by 103, obtaining a result of approximately '3.88'. Following this, he calculates the efficiency by dividing the speedup (3.88) by the max speedup (4) and multiplying by 100, yielding '97.087%'. The board clearly shows the intermediate steps, including the fraction '400 / 103'. The instructor uses a digital calculator interface to verify the division, showing the precise decimal value.

  3. 5:00 – 6:19 05:00-06:19

    The final segment addresses a theoretical question: 'Consider a system where we have 'm' stages and program contains 'n' instruction such that m<<n, then find speed up?'. The instructor writes out the general speedup formula 'Speedup = Twp / Tp = (m x n) / (m + (n-1))'. He explains that since m is much smaller than n, the term (m + n - 1) approximates to n. This simplifies the fraction to 'm', which he circles as the final answer. He also briefly demonstrates this with a large number, N=10,000, showing a speedup of '3.99' and efficiency of '99.97%', reinforcing the concept that speedup approaches the number of stages as N grows large. The derivation is written in red ink on the whiteboard.

The video effectively bridges the gap between theoretical formulas and practical calculation in computer architecture. By starting with a small N=10 example, the instructor establishes the baseline for Speedup and Efficiency. He then scales up to N=100 to show the diminishing returns and the approach towards maximum efficiency. The final theoretical derivation confirms that for a large number of instructions, the speedup is limited only by the number of pipeline stages. This progression helps students understand not just how to calculate these metrics, but also the underlying behavior of pipelined systems under different workloads.

Loading lesson…