Dear students here we provide notes for Anna university 6TH sem Subject CS ADVANCED COMPUTER ARTCHITECTURE notes pdf. you can download. ADVANCED COMPUTER ARCHITECTURE LECTURE NOTES ANNA UNIVERSITY ADVANCED COMPUTER ARCHITECTURE LECTURE. CS ADVANCED COMPUTER ARCHITECTURE. UNIT – I. 2 Marks. is ILP .. Statically scheduled. – Dynamically scheduled (see previous lecture).
|Published (Last):||18 July 2013|
|PDF File Size:||20.71 Mb|
|ePub File Size:||6.36 Mb|
|Price:||Free* [*Free Regsitration Required]|
CS Name of the subject: Text from page-3 Lecture Plan Subject Code: The second condition simply states that one instruction is dependent on another if there exists a chain of dependences of the first type between the two instructions.
Since a name dependence is not a true dependence, instructions involved in a name dependence can execute simultaneously or be reordered, if the name register number or memory location used in the instructions is changed so the instructions do not conflict. If two instructions are dependent they are not parallel and must be executed in order.
If two instructions are parallel, they can execute simultaneously in a pipeline without causing any stalls. Touch here to read. The original ordering kecture be preserved to ensure that i reads the correct value.
Advanced Computer Architecture CS notes – Annauniversity lastest info
Name Dependences The name dependence occurs when two instructions use the same register or memory location, called a name, but there is no flow of data between the instructions associated with that name. Both anti-dependences and output dependences are name dependences, as opposed to true data dependences, since there is no value being transmitted between the instructions. The ordering between the instructions must be preserved to ensure that the value finally written corresponds to instruction j.
Various types of Dependences in ILP.
This difference is critical to understanding how instruction-level parallelism can be exploited. For example, in the code segment: Text from page-2 Lecture Plan Subject Code: Dynamic Technique — Hardware Dependent Lecturf Forwarding and bypassing Delayed branches and simple branch scheduling Basic dynamic scheduling scoreboarding Copmuter scheduling with renaming Dynamic branch prediction Issuing multiple instructions per cycle Speculation Dynamic memory disambiguation Loop unrolling Basic compiler pipeline scheduling Compiler dependence analysis Software pipelining, trace scheduling Compiler speculation Reduces Potential data hazard stalls Control hazard stalls Data hazard stalls from true dependences Data hazard stalls and stalls from anti dependences and output copmuter Control stalls Ideal CPI Data hazard and control hazard stalls Data hazard stalls with memory Control hazard stalls Data hazard stalls Ideal CPI, data hazard stalls Ideal CPI, data hazard stalls Ideal CPI, data, control stalls 1.
Add Add to Favourite Add to classroom. This renaming can be more easily done for register operands, where it is called register renaming. Dependences are a property of programs.
Text from page-1 Lecture Plan Subject Code: Text from page-4 Lecture Plan Subject Code: Executing the instructions simultaneously will cause a processor with pipeline clmputer to detect a hazard and stall, thereby reducing or eliminating the overlap.
Whether a given dependence results in an actual hazard being detected and whether that hazard actually causes a stall are properties of the pipeline organization. To exploit instruction-level parallelism, determine which instructions can be executed in parallel.
Note for Advanced Computer Architecture – ACA by Rajib Swain
There are two types of name dependences between an instruction i that precedes instruction j in program order: Here is a simple example of a loop, which adds advancde element arrays, that is completely parallel: The presence of the dependence indicates the potential for a hazard, but the actual hazard and the length of any stall is a property of the pipeline.
Share it with your friends. An instruction j is botes dependent on instruction i if either of the following holds: The importance of the data dependences is that a dependence 1 indicates the possibility of a hazard, 2 Determines the order in which results must be calculated, and 3 Sets an upper bound on how much parallelism can possibly be exploited.
There are three different types of dependences: Register renaming can be done either statically by a compiler or dynamically by the hardware. Instruction-level parallelism ILP is the potential overlap the execution of arcuitecture using pipeline concept to improve performance of the system.
A control dependence determines the ordering of an advance, i, with respect to a branch instruction so that the instruction i is executed in correct program order. This dependence chain can be as long as the entire program.
In general, there are two constraints imposed by control dependences: Static Technique — Software Dependent 2. Every instruction, except for those in the first basic block of the program, is control dependent on some set of branches, and, in general, these control dependences must be preserved to preserve program order.
For example, we cannot take an wrchitecture from the then-portion of an if-statement and move it before the ifstatement.
Data Dependence and Hazards: An instruction that is control dependent on a branch cannot be moved before the branch so that its execution is no longer controlled by the branch. The various techniques computre are used to increase amount of parallelism are reduces the impact of data and control hazards and increases processor ability to exploit parallelism There are two approaches to exploiting ILP. Lecture Plan Subject Code: