This is the University of Utah's undergraduate course on Computer Organization. Instructor: Rajeev Balasubramonian. This video discusses an example of data dependences and stall cycles with a longer 9-stage pipeline.
Why we are constructing it from backside? Considering the natural flow of instruction, the instruction I2 should go like -- IF IF DE DE RR RR RR RR RR ALU RW. i.e. it should be waiting on RR stage rather than DE stage because in RR stage it can check the dependency. Please clear my doubt.
