My Computer Architecture gives me this example but I cant for the life of me understand how it solved the problem.How many bubbles must be placed between the pair of SRC instructions in the presence and in the absence of data forwarding to resolve dependence?ld r2, (r4)add r6,r4,r2SolutionStaller = ldStallee = addHazard Register = r2Bubbles without/with forwarding = 3/1How does it know there is a stall?How does it know the hazard register?How did it calculate the number of bubbles?I really need help understanding this concept to do my homework. Much appreciated.
Need help understand how to calculate pipeline bubbles
architecture