Explain optimizing transformations, Computer Engineering

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.

Posted Date: 5/9/2013 1:01:51 AM | Location : United States

Related Discussions:- Explain optimizing transformations, Assignment Help, Ask Question on Explain optimizing transformations, Get Answer, Expert's Help, Explain optimizing transformations Discussions

Write discussion on Explain optimizing transformations
Your posts are moderated
Related Questions
Q. What is Dot Pitch of a CRT? Dot Pitch of a CRT is the distance between phosphor dots of same colour. In Trinitron screens, the term Slot Pitch is used in place of Dot Pitch

Program testing and debugging: Program testing is the method of checking program, to verify that it satisfies its needs and to detect errors. These errors can be of any type-

Q. What is Stack Addressing? In this addressing technique operand is implied as top of stack. It isn't explicit however implied. It employs a CPU Register known as Stack Pointe

Explain the Client- Server Interface Using Procedures Developers must realize that client-server impose a division of labor in application programs. Programs must be broken up

What are the different methods used for handling the situation when multiple interrupts occurs? 1) Vectores interrupts 2) Interrupt nesting 3) Simultaneous Requests.

Define the Architectural framework for electronic commerce. An application independent framework to categorize service interaction relies onto four fundamental dimensions a.

Differentiate between synchronous and asynchronous input/output with the help of an example. The input-output operation is asynchronous input/output operation since after the s

How can I pass parameters to my simulation? A  test  bench  and  simulation  would likely  need  many  different  parameters  and  settings  for  various sorts of tests and con

a c program to implement multiple stack in a single array

Effect of IS on Humans - Information System We have concentrated in this chapter on the ways that IS has evolved making it more useful and more user-friendly. This proliferat