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).

Author: Samutaxe Votaur
Country: Greece
Language: English (Spanish)
Genre: Sex
Published (Last): 23 February 2017
Pages: 240
PDF File Size: 13.19 Mb
ePub File Size: 4.42 Mb
ISBN: 292-3-79187-544-8
Downloads: 6006
Price: Free* [*Free Regsitration Required]
Uploader: Nera

Text from page-4 Lecture Plan Subject Code: This difference is critical to understanding how instruction-level parallelism can be exploited. The importance advanved 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.

Name Dependences The name dependence noyes 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. In general, there are two constraints imposed by control dependences: There are three different types of dependences: 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 architecturd preserve program order.

Note for Advanced Computer Architecture – ACA by Rajib Swain

Text from page-2 Lecture Plan Subject Code: Various types of Dependences in ILP. If two instructions are parallel, they can execute simultaneously in a pipeline without causing any stalls. The ordering between the instructions must be preserved to ensure that the value finally written corresponds to instruction j. For example, in the code segment: Text from page-1 Lecture Plan Subject Code: Dependences are a property of programs.

Instruction-level parallelism ILP is the potential overlap the execution of instructions using pipeline concept to improve performance of the system. If two instructions are dependent they are not parallel and must be executed in order.


Note for Advanced Computer Architecture – ACA by Rajib Swain

The various techniques that are used to increase amount of parallelism are archirecture the impact of data and control hazards and increases processor ability to exploit parallelism There are two approaches to exploiting ILP. Touch here to read.

Text from page-3 Lecture Plan Subject Code: 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.

To exploit instruction-level parallelism, determine which instructions can be executed in 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. An instruction j is data dependent on instruction i if either of the following holds: An cs254 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 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. CS Name of the subject: The original ordering must be preserved to ensure that i reads the correct value. For example, we cannot take an instruction from the then-portion of an architecthre and move it before the ifstatement.

A control dependence determines the ordering of an instruction, i, with respect to a branch instruction so that the instruction i is executed in correct program order.

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 Control stalls Ideal CPI Data hazard and control hazard stalls Data hazard stalls with memory Control hazard stalls Data hazard stalls Ideal CPI, motes hazard stalls Ideal CPI, data hazard stalls Ideal CPI, data, control stalls 1.


Static Technique — Software Dependent 2.

Advanced Computer Architecture CS notes – Annauniversity lastest info

Register renaming can be done either statically by a compiler or dynamically by the hardware. Add Add to Favourite Add to classroom. Share it with your friends. Lecture Plan Subject Code: There are two types of name dependences between an instruction i that precedes instruction j in program order: 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.

This dependence chain can be as long as the entire program. Here compuuter a simple example of a loop, which adds two element arrays, that is completely parallel: 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.

Executing the instructions simultaneously will cause a processor with pipeline interlocks to detect a hazard and stall, thereby reducing or eliminating the overlap. This renaming can be more easily done for architcture operands, where it is called register renaming. Data Dependence and Hazards: