"A typical instruction pipeline has seven stages as depicted below in figures._x000D_ - Fetch stage (F) fetches instructions from a cache memory._x000D_ - Decode stage (D) decode the instruction in order to find function to be_x000D_ performed and identifies the resources needed._x000D_ - Issue stage (I) reserves resources. Resources include GPRs, bases and_x000D_ functional units._x000D_ - The instructions are executed in one or several execute stages (E)_x000D_ - Write back stage (WB) is used to write results into the registers._x000D_ - Memory lead and store (L/S) operations are treated as part of solution._x000D_ - Floating point add and multiply operations take four execution clock cycles._x000D_ - In many RISC processors fewer cycles are needed._x000D_ - Ideal cycles when instruction issues are blocked due to resource conflicts_x000D_ before date Y and Z are located in._x000D_ - the store of sum to memory location X must wait three cycles for the add to_x000D_ finish due to flow dependence._x000D_ _x000D_ _x000D_ Source: http://in.docsity.com/en-docs/Advanced_Computer_Architecture__Lecture_notes__Newar"
Add a comment
"A good pedagogy word of mouth is usually a approach used in the style associated with desktops to increase his or her pedagogy throughput (the amount of instruction manual which can be carried out in a time unit). Pipelining does not slow up the time for it to full an instruction, nevertheless increases the volume of instructions that may be processed at one time. "
Add a comment