COMPUTER SCIENCE AND ENGINEERING
COMPUTER ARCHITECTURE
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
When we use the reservation station and Tomasulo’s scheme, instruction execution is divided onto:
|
|
Five steps like using standard pipeline
|
|
|
Three steps:Issue, Execute, Write Result
|
|
|
Four steps:Fetch, Decode, Execute, Write Result
|
|
|
No correct answer
|
Explanation:
Detailed explanation-1: -Tomasulo’s algorithm implements register renaming through the use of what are called reservation stations. Reservation stations are buffers which fetch and store instruction operands as soon as they’re available. Source operands point to either the register file or to other reservation stations.
Detailed explanation-2: -Overcoming Data Hazards with Dynamic Scheduling: The Dynamic Scheduling is used handle some cases when dependences are unknown at a compile time. In which the hardware rearranges the instruction execution to reduce the stalls while maintaining data flow and exception behavior.
There is 1 question to complete.