benchmark program to evaluate the performance of a processor spends 80% of its time on floating-point commands and 20% on non-floating point commands. A design team wants to obtain an overall speedup of 40% over the existing run time of this benchmark program by speeding up ONLY the non-floating point commands. What should be the ratio of the non-floating point commands new runtime to that of its old runtime? Select the best answer. This is a trick question! In this scenario, it is impossible to speed up only the non-floating point commands to obtain an overall 40% speedup! 2

benchmark program to evaluate the performance of a processor spends 80% of its time on floating-point commands and 20% on non-floating point commands. A design team wants to obtain an overall speedup of 40% over the existing run time of this benchmark program by speeding up ONLY the non-floating point commands. What should be the ratio of the non-floating point commands new runtime to that of its old runtime? Select the best answer. This is a trick question! In this scenario, it is impossible to speed up only the non-floating point commands to obtain an overall 40% speedup! 2

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter6: System Integration And Performance

Section: Chapter Questions

Problem 1RP

See similar textbooks

Similar questions

How does pipelining improve CPU efficiency? What’s the potential effect on pipelining’s efficiency when executing a conditional BRANCH instruction? What techniques can be used to make pipelining more efficient when executing conditional BRANCH instructions?
Processor R is a 64-bit RISC processor with a 2 GHz clock rate. The average instruction requires one cycle to complete, assuming zero wait state memory accesses. Processor C is a CISC processor with a 1.8 GHz clock rate. The average simple instruction requires one cycle to complete, assuming zero wait state memory accesses. The average complex instruction requires two cycles to complete, assuming zero wait state memory accesses. Processor R can’t directly implement the complex processing instructions of Processor C. Executing an equivalent set of simple instructions requires an average of three cycles to complete, assuming zero wait state memory accesses. Program S contains nothing but simple instructions. Program C executes 70% simple instructions and 30% complex instructions. Which processor will execute program S more quickly? Which processor will execute program C more quickly? At what percentage of complex instructions will the performance of the two processors be equal?
How does pipelining relate to multiple-issue and speculative execution? Discuss their impact on processor performance.
Is it possible to identify and solve the weaknesses of the Whetstone, Dhrystone, and Linpack benchmarks that have been addressed by the SPEC CPU benchmarks?
Is it possible to identify and address the weaknesses of the Whetstone, Dhrystone, and Linpack benchmarks that have been addressed by the SPEC CPU benchmarks?
Discuss the trade-offs between increasing pipeline depth and the potential performance gains in modern CPUs.
The objective of this essay is to provide a comprehensive analysis of the inherent constraints that arise from the ongoing practice of augmenting the number of cores within a central processing unit (CPU) in order to improve its processing speed and align with the exponential growth predicted by Moore's Law?
Discuss the concept of pipelining in CPU design. How does pipelining improve processor efficiency, and what are the potential challenges in its implementation?
Is it possible to identify which of the deficiencies of the Whetstone, Dhrystone, and Linpack benchmarks the SPEC CPU benchmarks are intended to address?
Suppose we had a processor design with 5 stages where each stage takes the following amount of time: IF: 400 ps ID: 200 ps EX: 300 ps MEM: 500 ps WB: 200 psQ1: If you choose a pipelined design, what is the CPI? Assume that we have enough instructions such that the brief ramp up period at the beginning and the ramp down period at the end with less than 100% utilization does not matter. Q2: If you choose a pipelined design, what is the average execution time per instruction in picoseconds?
Explore the idea of instruction reordering and out-of-order execution in pipelining. How do these techniques enhance processor performance, and what are the challenges associated with them?
Discuss the challenges and trade-offs involved in implementing an out-of-order execution pipeline. How does out-of-order execution impact the architectural design of modern processors?