Articles liés à Pointer Based PRE: Elimination of Pointer Based Partial...

Pointer Based PRE: Elimination of Pointer Based Partial Redundancies through Graph Expansion - Couverture souple

Agarwal, Ambika

 
9783844323313: Pointer Based PRE: Elimination of Pointer Based Partial Redundancies through Graph Expansion
Couverture souple
ISBN 10 : 3844323317 ISBN 13 : 9783844323313
Editeur : LAP LAMBERT Academic Publishing, 2011

Synopsis

Applications in languages like C have heavy pointer usage and it happens that a pointer p may point to operands of an expression, i.e., it points to operand of an expression along some path. If the value contained in the pointer variable is modified then it may or may not kill the original value of expression depending upon the path taken. Thus we see that there is redundancy along some path. To remove this redundancy we will try to make the expression completely redundant. But the node containing the modification of value of pointer p will inhibit hoisting the expression out of that node. So, to remove the redundancy along all paths some code duplication has to be performed. But the cost of duplication performed may exceed the benefit derived from removing the redundancy. Thus, to get benefit from duplication, we duplicate the code only if redundancy along some frequently executed (HOT) path is being removed. Here, we present an approach to perform code duplication only if the optimization opportunity exists along some HOT path. Profile based points-to analysis is used to explore such redundancies and thus remove them.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Présentation de l'éditeur

Applications in languages like C have heavy pointer usage and it happens that a pointer p may point to operands of an expression, i.e., it points to operand of an expression along some path. If the value contained in the pointer variable is modified then it may or may not kill the original value of expression depending upon the path taken. Thus we see that there is redundancy along some path. To remove this redundancy we will try to make the expression completely redundant. But the node containing the modification of value of pointer p will inhibit hoisting the expression out of that node. So, to remove the redundancy along all paths some code duplication has to be performed. But the cost of duplication performed may exceed the benefit derived from removing the redundancy. Thus, to get benefit from duplication, we duplicate the code only if redundancy along some frequently executed (HOT) path is being removed. Here, we present an approach to perform code duplication only if the optimization opportunity exists along some HOT path. Profile based points-to analysis is used to explore such redundancies and thus remove them.

Biographie de l'auteur

I have completed my MTech in Computer Science from IIT Bombay, India with specializations in Algorithms and Compilers.

Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.

Éditeur
LAP LAMBERT Academic Publishing
Date d'édition
2011
Langue
anglais
ISBN 10 
3844323317
ISBN 13 
9783844323313
Reliure
Broché
Nombre de pages
76
Coordonnées du fabricant
non disponible
Personne responsable
KreGa Onlinehandel GmbH
4950000000000
info@krega-onlinehandel.de

Birkenweg 31
Brakel
33034
Allemagne