Clock Per Instruction=1

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/TPSC-ASSISTANT-TECHNICAL-OFFICER/computer-organization-and-architecture/pipelining/performance-speedup/asset-clock-per-instruction1 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper 2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
  3. Paper 2 | Computer Organization And Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Control Unit Design, Instr Formats & Modes, Programming the Basic Computer
  4. Paper 2 | Analog And Digital Communication: Introduction to Communication Systems & Random Signals, Analog Communication Systems, Information Theory & Digital Communication Fundamentals, Digital Modulation & Detection Techniques, Error Control, Synchronization & Multiple Access Techniques
  5. Paper 2 | Programming in C: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  6. Paper 2 | Data Structures And Programming: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  7. Paper 2 | Algorithms: Algorithm Analysis, Sorting Algorithms, Time Complexity Analysis, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  8. 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
  9. Paper 2 | Operating System: 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
  10. Paper 2 | Databases: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Relational Calculus, File Organization & Indexing, Transaction Management, Concurrency Control
  11. Paper 2 | Information Systems and Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  12. Paper 2 | 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
  13. Paper 2 | Internet & Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, HTML Basics, JavaScript-Basics, CSS, XML, HTML5
  14. Paper 2 | Cyber Security And Emerging Technologies: Emerging Tech Trends
  15. Paper 2 | Cloud Technology: Cloud Computing
  16. Paper 2 | Probability and statistics: Probability, Statistics
  17. Paper-1 English: Vocabulary, Preposition, Articles, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Cloze Test (Cloze Passage), Sentence Construction
  18. Paper 1 General Mental Ability & Logical reasoning: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Average, Powers and Exponents (Surds and Indices), Algebra, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Pipe and Cistern, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Arithmetic, Speed Mathematics and Basic Mathematics, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Venn Diagram, Analogy
  19. Paper-1 General Knowledge & Current Affairs: State Wise GK, History, Geography, GK- Current Affairs, Static General Knowledge
  20. Full Length Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video segment focuses on solving a computer architecture problem involving pipelined processors. The instructor presents a specific question asking for the processor frequency required to ensure that the work of every stage completes within a single clock cycle. He analyzes a hand-drawn diagram depicting a 5-stage pipeline (S1 to S5) with specific processing delays and latch overheads. By calculating the total delay for each stage and testing various clock cycle durations in a table, he demonstrates the method to determine the minimum clock cycle time and the corresponding frequency needed for optimal pipeline performance.

Chapters

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

    The instructor begins by reading the question on the screen: "After considering this diagram what must be the frequency of the processor to ensure that work of every stage will complete in 1 clock stage wise?". He points to the diagram showing five rectangular blocks labeled S1 through S5 on the screen. Inside the blocks are delays: 10ns, 12ns, 13ns, 11ns, and 14ns. Between the blocks are arrows labeled 1ns, representing overhead. He calculates the total time for each stage by adding the internal delay and the overhead: S1 becomes 11ns, S2 becomes 13ns, S3 becomes 14ns, S4 becomes 13ns, and S5 becomes 15ns. He starts a table with columns S1 to S5 and rows for different clock times. In the first row labeled "1ns", he writes the stage times 11, 13, 14, 13, 15, showing that at this high frequency, each stage would take many cycles to complete.

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

    The instructor proceeds to fill the table for clock cycles of 2ns, 3ns, 5ns, and 15ns. He explains that the number of cycles is the stage time divided by the clock cycle time, rounded up to the nearest integer. For a 2ns clock, the values are 6, 7, 7, 7, 8. For 3ns, they are 4, 5, 5, 5, 5. For 5ns, all stages take 3 cycles. Finally, for a 15ns clock cycle, he writes 1 in every column (1, 1, 1, 1, 1). He concludes that since the maximum stage time is 15ns, the clock cycle must be at least 15ns to complete work in one stage-wise clock. He writes "CPI = 1" on the whiteboard, confirming that with a 15ns cycle, the processor achieves one instruction per cycle.

The lesson effectively demonstrates the relationship between stage delays, clock cycle time, and frequency in a pipelined processor system. By systematically testing clock periods, the instructor shows that the clock cycle is dictated by the slowest stage. To achieve a CPI of 1, the clock period must match the maximum stage delay. This ensures that no stage is stalled, allowing for maximum throughput where one instruction completes per clock cycle.

Loading lesson…