Hazard in Pipelining

Question

Consider the Program segment

I1: r0 <- r1 + r2;

I2: r2 <- r0 * r3;

I3: r0 <- r2 / r0;

I4: r3 <- r2 * r0;

I5: M[x] <- r3;

Q1> Calculate the number of -

    1. Read after write hazard

    2. Write after Read hazard

    3. Write after Write hazard.

Q2> which of these hazards happen between the two adjacents instructions.

Comments

I think

RAW = 6

I1-I2 (R0)

I1-I3(R0)

I2-I3(R2)

I2-I4(R2)

I3-I4(R0)

I4-I5(R3)

WAR = 3

WAW = 1

---

without knowing the number of stages we can't directly calculate the number of hazard we can only find the dependency i.e RAW,WAR,WAW dependency for finding hazard we hava to draw the stage diagram after that we can find how many number of hazard is possible.

Answer 1

RAW = 4
WAR=3
WAW=1

ans 2 RAW

Comments

how can u explain me properly ?

thnk u

Answer 2

RAW = 4
WAR=3
WAW=1