Consider a simple in-order processor with the following characteristics: Consists of a pipeline where one instruction is issued each cycle if possible. • An instruction can issue once all of its dependencies are satisfied. • There is no limit to the number of functional units. • Do not assume all operands are read prior to any being written in a given cycle. Given the following sequential list of instructions and instruction latencies: A. 1dw $r5 = 12[$r8] B. stw 8[$r2] = $r7 c. 1dw $r2 = 4[$r4] D. stw 12[$r8] = $r2 Instruction Latency add sub 1dw stw mpy 2 2 5 7 1. What is the CPI for sequential execution of the code with no data speculation? 2. Create a new schedule to maximize instruction level parallelism (ILP) using instruction scheduling and data speculation, but without register renaming. o Please maintain the original ordering of the instructions. Make sure you include appropriate latencies in the provided schedule. o Calculate the new CPI, assuming no data speculation overhead and that the two locations did not collide
Consider a simple in-order processor with the following characteristics: Consists of a pipeline where one instruction is issued each cycle if possible. • An instruction can issue once all of its dependencies are satisfied. • There is no limit to the number of functional units. • Do not assume all operands are read prior to any being written in a given cycle. Given the following sequential list of instructions and instruction latencies: A. 1dw $r5 = 12[$r8] B. stw 8[$r2] = $r7 c. 1dw $r2 = 4[$r4] D. stw 12[$r8] = $r2 Instruction Latency add sub 1dw stw mpy 2 2 5 7 1. What is the CPI for sequential execution of the code with no data speculation? 2. Create a new schedule to maximize instruction level parallelism (ILP) using instruction scheduling and data speculation, but without register renaming. o Please maintain the original ordering of the instructions. Make sure you include appropriate latencies in the provided schedule. o Calculate the new CPI, assuming no data speculation overhead and that the two locations did not collide
C++ for Engineers and Scientists
4th Edition
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Bronson, Gary J.
Chapter2: Problem Solving Using C++using
Section2.3: Data Types
Problem 9E: (Practice) Although the total number of bytes varies from computer to computer, memory sizes of...
Related questions
Question
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!
Trending now
This is a popular solution!
Step by step
Solved in 3 steps
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
C++ for Engineers and Scientists
Computer Science
ISBN:
9781133187844
Author:
Bronson, Gary J.
Publisher:
Course Technology Ptr
C++ for Engineers and Scientists
Computer Science
ISBN:
9781133187844
Author:
Bronson, Gary J.
Publisher:
Course Technology Ptr