Problem: Assume that 20 percent of the dynamic count of the instructions executed for a program are branch instructions. There are no pipeline stalls due to data dependencies. Static branch prediction is used with a not-taken assumption. (a) Determine the execution times for two cases: when 30 percent of the branches are taken, and when 70 percent of the branches are taken. (b) Determine the speedup for one case relative to the other. Express the speedup as a percentage relative to 1.

Problem: Assume that 20 percent of the dynamic count of the instructions executed for a program are branch instructions. There are no pipeline stalls due to data dependencies. Static branch prediction is used with a not-taken assumption. (a) Determine the execution times for two cases: when 30 percent of the branches are taken, and when 70 percent of the branches are taken. (b) Determine the speedup for one case relative to the other. Express the speedup as a percentage relative to 1.

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Q: Assume the following execution pattern for a given branch: T NT T NT T NT. Assume branches…

A: The Answer is an option A You’d like to add a branch predictor to your Baseline processor, and…

Q: a. movq (%rdi), %rax movq (%rax), %rax movq (%rax), %rax movq (%rax), %rax addq %rcx, %rax

A: Welcome to the fascinating world of assembly language, where every instruction is a testament to the…

Q: ) Let us assume that we have a program of 100,000 instructions. Each instruction is independent from…

A: Here, we are going to find out the number of CPU cycles needed to execute the program. In pipeline…

Q: Compute Load Store Branch Total Program1 600 600 200 50 ? 3 • Program2 900 500 100 200 ?

A: The answer is

Q: Question 2 V SUBMITTED Equivalence Find an alternative first instruction for the x86-64 code below…

A: the answer is given below:-

Q: For the add instruction in this problem, assume that EAX contains the given contents before the…

A: To answer this problem, we need to understand how addition works in binary. In binary, addition is…

Q: 14. A subroutine was called using a conditional branch (BR) instruction. The subroutine ends, as…

A: About BR instruction:…

Q: Q: Suppose you have a machine which executes a program that consists of 50% (in terms of execution…

A: Instruction Set: In machine language, an instruction set is a collection of instructions for a CPU.…

Q: 1. When a program is adapted to run on multiple cores in a multiprocessor system, the execution time…

A: Here is the explanation of the above problem. see below steps.

Q: Please help me with this Computer science homework

A: The table provided is a single-cycle datapath with five segments: Instruction Fetch, Instruction…

Q: a) b) Explain the following machine independent optimization techniques. Common sub expression and…

A: Machine-independent optimization techniques used in compiler design improve code efficiency…

Q: Discuss with the help of an arc loaded in the program counter d other regular instructions.

A: The program counter is a processor register that shows where a PC is in its program arrangement. It…

Q: Explain control hazards in pipeline design and the techniques used to handle them, such as branch…

A: In computer architecture, control hazards—also referred to as branch hazards—occur when conditional…

Question

Problem: Assume that 20 percent of the dynamic count of the instructions executed for
a program are branch instructions. There are no pipeline stalls due to data dependencies.
Static branch prediction is used with a not-taken assumption.
(a) Determine the execution times for two cases: when 30 percent of the branches are
taken, and when 70 percent of the branches are taken.
(b) Determine the speedup for one case relative to the other. Express the speedup as a
percentage relative to 1.

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Step 3

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 3 steps with 3 images

SEE SOLUTION Check out a sample Q&A here

Similar questions

Assuming the same instruction mix listed in Problem 7, what is the average execution time across all instructions?
Assume: CPU Clock = 1 GHz 1 OP requires 5 clock cycles (arithmetic instruction, conditional, etc.) 1 memory access requires 100 clock cycles (Read or Write) Problem size: N = 1,000,000 (1 million) There is no cost associated with the loop index variable: do not count any arithmetic instructions for initializing or incrementing the loop index value, do not count any memory accesses for accessing and using the loop index variable in your computation of a sum. Assume the loop index variable is "free of charge" There is no memory cost of accessing and updating your accumulator variable (e.g., sum += ...), but there is an arithmetic operation involved in updating the accumulator variable. Questions: 1. For algorithm #1 shown below (direct sum): • How many arithmetic instructions are required by this algorithm? • How many memory accesses are required by this algorithm? • How many clocks are required by this algorithm? • What is the CPI (cycles per instruction) required by this algorithm? •…
In deeper pipelines a branch prediction is very important because many more instructions are in flight and a wrong prediction would waste more time and power than that in a shallower pipeline. Select the best answer. True False
What is the definition of "instruction pipelinelining"? Provide the remedies in addition to discussing the data discrepancies and branch conflicts.
Assume a 5-stage pipelined CPU (IF – ID – MU- EX – WR) requires following time for different sections: Required time 15 ns Pipeline stages Fetch Unit Decode Unit 10 ns 20 ns Memory Unit Execution Unit 8 ns 15 ns Write back Unit 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 that Instruction-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 read only one data from RAM or save only one data to RAM at a time. Calculate the execution time for the first 10 instructions of a program as well. b) Show the time steps and calculate the execution time for above problem while a multiport RAM is used with the system.
18 What is speculation as it relates to parallelization? It is the set of instructions that issues together in one clock cycle and the packet may be determined statically by the compiler or dynamically by the processor. It is a style of instruction set architecture that launches many operations that are defined to be independent in a single wide instruction, typically with many separate opcode fields. It is the number of clock cycles between a load instruction and an instruction that can use the result of the load without stalling the pipeline. O It is an approach whereby the compiler or processor guesses the outcome of an instruction to remove it as a dependence in executing other instructions.