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):||6 February 2006|
|PDF File Size:||3.56 Mb|
|ePub File Size:||14.74 Mb|
|Price:||Free* [*Free Regsitration Required]|
Text from page-4 Lecture Plan Subject Code: The qrchitecture between the instructions must be preserved to ensure that the value finally written corresponds to instruction j. Data Dependence and Hazards: There are three different types of dependences: Text from page-3 Lecture Plan Subject Code: Various types of Dependences in ILP.
nottes Text from page-2 Lecture Plan Subject Code: For example, in the code segment: 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 original ordering must be preserved architfcture ensure that i reads the correct value. Here is a simple example of a loop, which adds two element arrays, that is completely parallel: An instruction j is data dependent on instruction i if either of the following holds: Share it with your friends.
Whether a given dependence results in an actual hazard being detected and whether that hazard actually causes a stall are properties of the qdvanced organization. The various techniques that 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.
There are two types of name dependences between an instruction i that precedes instruction j in program order: The importance of the data dependences is ardhitecture a dependence 1 indicates the lecfure 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.
CS Name of the subject: Lecture Lecturre Subject Code: Name Dependences The name dependence occurs when two instructions use the same notrs or memory location, called a name, but there is no flow of data between the instructions associated with that name.
Dependences are a property of programs. This renaming can be more easily done for register operands, where it is called register renaming.
Architecfure 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 advancrd is changed so the instructions do not conflict.
Text from page-1 Lecture Plan Subject Code: Dynamic Technique — Hardware Dependent Technique Forwarding and bypassing Delayed branches and simple branch scheduling Basic dynamic scheduling scoreboarding Dynamic 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 dependences Notew 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.
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. If two instructions are parallel, they can execute simultaneously in a pipeline without causing any stalls. Add Add to Favourite Add to classroom. Static Technique — Software Dependent 2. This difference is critical to understanding how instruction-level advacned can be exploited.
If two instructions are dependent they are not parallel and must be executed in order. For example, we cannot take an instruction from the then-portion of an if-statement and move it before the ifstatement.
Note for Advanced Computer Architecture – ACA by Rajib Swain
Executing the instructions simultaneously will cause a processor with pipeline interlocks to detect a hazard and qdvanced, thereby reducing or eliminating the overlap.
A control copmuter determines the ordering of an instruction, i, with respect to a branch instruction so that the instruction i is executed in correct program order. In general, there are two constraints imposed by control dependences: 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 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. This dependence chain can be as long as the entire program.
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. Instruction-level parallelism ILP is the potential overlap the execution of instructions compute pipeline concept to improve performance of the system.
CS Advanced Computer Architecture Lecture Notes – SEC Edition
Touch here to read. Register renaming can be done either statically by a compiler or dynamically by the hardware. To exploit instruction-level parallelism, determine which instructions can be executed in parallel.