A processor takes 24 cycles to complete an instruction 1 with frequency 4 GHz. The corresponding pipelined uses 6 stages with the execution times of 4, 3, 6, 2, 5, and 2 cycles respectively with frequency 2 GHz. What is the asymptotic speedup assuming that a very large number of instructions are to be executed?

A processor takes 24 cycles to complete an instruction 1 with frequency 4 GHz. The corresponding pipelined uses 6 stages with the execution times of 4, 3, 6, 2, 5, and 2 cycles respectively with frequency 2 GHz. What is the asymptotic speedup assuming that a very large number of instructions are to be executed?

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter4: Processor Technology And Architecture

Section: Chapter Questions

Problem 2PE: If a microprocessor has a cycle time of 0.5 nanoseconds, what’s the processor clock rate? If the...

See similar textbooks

Similar questions

If a microprocessor has a cycle time of 0.5 nanoseconds, what’s the processor clock rate? If the fetch cycle is 40% of the processor cycle time, what memory access speed is required to implement load operations with zero wait states and load operations with two wait states?
Assume a 5-stage pipelined CPU (IF – ID – MU– EX – WR) requires following time for differentsections: Pipeline stages ----Required time Fetch Unit ---15 nsDecode Unit ---10 nsMemory Unit---- 20 nsExecution Unit---- 8 nsWrite back Unit ----15 ns The maximum delay required to transfer contents from one state to another is 2ns.a) Show the time steps of pipelining stages for the first 10 instructions of a program. Assume thatInstruction-4 is a conditional loop instruction. If the condition is TRUE, CPU runs instructions:7 - 9 twice. Please note that a single-port RAM is used with the system, such that CPU readonly one data from RAM or save only one data to RAM at a time. Calculate the execution timefor the first 10 instructions of a program as well. Assume the condition is evaluated TRUE.
A non pipelined processor has a clock cycle of 8.0 ns to execute each instruction. If a 6-stages pipeline is implemented, with an overhead of 0.06 ns per stage, the new clock cycle should be?
A multiprocessor consists of 100 processors, each capable of a peak execution rate of 2Gflops. What is the performance of the system as measured in Gflops when 2% of the code is sequential and 98% is parallelizable?
Consider an unpipelined processor. Assume that it has 1-ns clock cycle and that it uses 4 cycles for ALU operations, and 5 cycles for branches, and 4 cycles for memory operations. Assume that the relative frequencies of these operations are60%,20%, and20%respectively. Suppose that due to clock skew set up, pipelining the processor adds0.2 nsof overhead to the clock. Ignoring any latency impact, how much speed up in the instruction execution rate will we gain from a pipeline? Please type answer no write by hend.
Suppose you have a computer that does instruction processing in anatomic way, with a clock cycle of 7ns and one instruction executioncompleted every cycle.You now split the processing into the five stages of the RISC pipeline,and you get required processing times of• IF: 1ns• ID: 1.5ns• EX: 1ns• MEM: 2ns• WB: 1.5nsYou now have added 0.1ns of delay between each of these stages. What’s the clock cycle time of this 5-stage pipelined machine?
Q.Consider a computer system with DMA support. The DMA module is transferring one 8-bit character in one CPU cycle from a device to memory through cycle stealing at regular intervals. Consider a 2 MHZ processor. If 0.5% processor cycles are used for DMA, the data transfer rate of the device is bits per second.
Ques 4: Consider the design of a pipelined microarchitecture with 12 stages. How many total clock cycles would it take to execute 100 independent (error free) instructions? Assume all these instructions to be sequential and the pipeline is empty at the start of execution.
consider a CPU that implements two parallel fetch-execute pipelines for superscalar processing. Show the performance improvement over scalar pipeline processing and no-pipeline processing, assuming an instruction cycle similar to figure 4.1 in the Section I B of "Advanced Systems Concepts", i.e.:  a one clock cycle fetch  a two clock cycle decode  a three clock cycle execute and a 200 instruction sequence: Show your work. 7. o pipelining would require _____ clock cycles: 8. A scalar pipeline would require _____ clock cycles: How high is the increase in speed (percentage) compared to no pipelining? 9. A superscalar pipeline with two parallel units would require ______ clock cycles: How high is the increase in speed (percentage) compared to no pipelining?
Consider a CPU that implements a single instruction fetch–decode–execute–write- back pipeline for scalar processing. The execution unit of this pipeline assumes that the execution stage requires one step. Describe, and show in diagram form, what happens when an instruction that requires one execution step follows one that requires four execution steps.
Pipeline performance. Suppose processor A executes instructions in the following 4 stages (no pipeline), where each stage could run this fast. Compare the performance of a pipelined vs. unpipelined implementation of processor A.IF&ID | 25nsEX | 20nsMem | 40nsWB | 15nsDraw the pipeline diagram to show clock cycles with time. Compare the performance of a pipelined vs. unpipelined implementation of processor A.
Describe pipelining in terms of boosting the performance of the processor, and then compute the number of cycles that will be required to execute five instructions assuming that each portion of the machine requires one cycle. a. Without using pipelines; b. By using pipelines a. With pipelined processes b. With pipelined processes c. With pipelined processes d. With pipelined processes d.