Pointer based pre elimination de agarwal ambika (2 resultados)

Autor: 
Título: 
Refinar con la Búsqueda avanzada

Filtrar la búsqueda

  • Libros (2)

  • Nuevo (2)

a

Intervalo de precios personalizado (EUR)

a

  • Idioma: Inglés

    Editorial: LAP LAMBERT Academic Publishing, 2011

    3844323317 / 9783844323313

    • Tapa blanda

    Librería: preigu, Osnabrück, Alemaniapreigu

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 43,40

    Envío por EUR 70,00 
    Se envía de Alemania a Estados Unidos de America

    Cantidad disponible: 5 disponibles

    Taschenbuch. Condición: Neu. Pointer Based PRE | Elimination of Pointer Based Partial Redundancies through Graph Expansion | Ambika Agarwal | Taschenbuch | 76 S. | Englisch | 2011 | LAP LAMBERT Academic Publishing | EAN 9783844323313 | Verantwortliche Person für die EU: BoD - Books on Demand, In de Tarpen 42, 22848 Norderstedt, info[at]bod[dot]de | Anbieter: preigu.…

  • Idioma: Inglés

    Editorial: LAP LAMBERT Academic Publishing, 2011

    3844323317 / 9783844323313

    • Tapa blanda
    • Impresión bajo demanda

    Librería: AHA-BUCH GmbH, Einbeck, AlemaniaAHA-BUCH GmbH

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 49,00

    Envío por EUR 35,00 
    Se envía de Alemania a Estados Unidos de America

    Cantidad disponible: 1 disponible

    Taschenbuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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.…