Show how the minimal number of nops can be inserted between


Problem

Consider the following code segment:

LD R1, 0(R2)

SUB R4, R1 R5

AND R6, R1, R4.

OR R8, R4, R6

List all potential dependencies & data hazards that exist (for our 5 stage pipeline) Remember that a dependency may exist that is not a hazard on your particular pipeline.

Assume that your CPU cannot forward. Without changing the order of instructions show how the minimal number of NOPS can be inserted between the instructions to eliminate the hazards Assume that your CPU can forward.

Now show the minimal number of NOPS that must be inserted to eliminate the hazards

Request for Solution File

Ask an Expert for Answer!!
Computer Engineering: Show how the minimal number of nops can be inserted between
Reference No:- TGS02897403

Expected delivery within 24 Hours