dynamic scheduling algorithm

mcqspedia.com has 3 Question/Answers about Topic dynamic scheduling algorithm

Given instruction: L.D F0,0(R1), gets state of execution in

Given instruction: L.D F0,0(R1), gets state of execution in
  • A. 1 iteration
  • B. 2 iterations
  • C. 3 iterations
  • D. 4 iterations
  • Correct Answer: Option B

Load and store instruction, waits until

Load and store instruction, waits until
  • A. Buffers are empty
  • B. Stations are empty
  • C. Buffers are full
  • D. Stations are full
  • Correct Answer: Option A

Having load before store in a running program order, then interchanging this order, results in a

Having load before store in a running program order, then interchanging this order, results in a
  • A. WAW hazards
  • B. Destination registers
  • C. WAR hazards
  • D. Registers
  • Correct Answer: Option C