Speed up Derivation

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/SSC-JE-IMD-SCIENTIFIC-ASSISTANT-COMPUTER-SCIENCE/computer-organisation-architecture/pipelining/performance-speedup/asset-speed-up-derivation 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.

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…