Explain optimizing transformations, Computer Engineering

Assignment Help:

Explain optimizing transformations?

Optimizing transformations:

It is a rule for rewriting a segment of a program to enhance its execution efficiency without influencing its meaning. Usually used optimizing transformations are given below:

(a) Compile time evaluation: Execution efficiency can be enhanced by performing certain action given in a program through compilation itself. Constant folding is the important optimization of this type. While all operands in an operation are constants, the operation can be performed on compilation time.

For illustration: a: =3.141557/2 can be replaced through a:=1.570785 removing a division operation.

(b) Elimination of common subexpressions:

Common subexpressions are occurrences of expressions yielding similar value. For illustration: a:=b*c t: = b*c

λ: = b*c + 5.2      =>   a: = t

λ: = t + 5.2

(c) Dead code elimination: Code that can be omitted from a program without influencing its results is termed as dead code. For illustration: An assignment statement x: = < exp > constitutes dead code if the value assigned to x is not utilized in the program.

(d)Frequency and strength reduction:

Execution time of a program can be reduced through moving code from a part of programs that is executed very frequently to the other part of the program that is executed fewer times.

The strength reduction replaces the occurrence of a time consuming operation through an occurrence of a faster operation.


Related Discussions:- Explain optimizing transformations

Convert the decimal numbers into hexadecimal, Q Convert the following DECIM...

Q Convert the following DECIMAL numbers into HEXADECIMAL, double check by converting the result HEXADECIMAL to DECIMAL. a)    24 b)   547.56

K map explanation, K map explanation for mod 5 up synchronous counter ?

K map explanation for mod 5 up synchronous counter ?

Database system, What are the three data anomalise that are likely to occur...

What are the three data anomalise that are likely to occur as a result of data redundancy?

Explain client server model, Explain Client Server Model. In the client...

Explain Client Server Model. In the client- server model, communication usually takes the form of a request message from the client to the server asking for several works to be

C, usability of union

usability of union

Define parity generator, Define parity generator During transmission, a...

Define parity generator During transmission, at sending end the message is applied to a parity generator, where the needed bit is formed.

Perfect induction, Any identity or equality in Boolean algebra, suchas de M...

Any identity or equality in Boolean algebra, suchas de Morgan's Theorem can be proved usingthe method of perfect induction. 1. All combinations of variables are written down.

Evaluate fixed execution time, The statement of Gustafson's law can be desc...

The statement of Gustafson's law can be described with the help of an illustration. Let us take a problem, say P, which has to be solved using a parallel computer. Let Ts be the ti

Demorgan''s first theorem, DeMorgan's first theorem shows the equivalence o...

DeMorgan's first theorem shows the equivalence of which logic gate ? Ans. DeMorgan's first theorem depicts the equivalence of NOR gate and Bubbled AND gate. For De Morgan's

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd