## A mathematical theory of global program optimization |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

PRELIMINARY NOTATION | 3 |

DOMINANCE PARTITIONS AND INTERVALS | 12 |

AND IRREDUCIBLE GRAPHS | 21 |

Copyright | |

12 other sections not shown

### Other editions - View all

### Common terms and phrases

Algorithm analysis arcs assembly language assume available on entrance available on exit back dominator back-latches basic block busy on entrance busy on exit characteristic vector circuit compile-time computations compiler variable computed downward connectivity matrix control flow graph cycle of G defined definition derived graph directed graph distributive lattice eliminate entry node equivalence Example execution frequency exists EXIT EXIT EXIT expressions Figure FORTRAN global optimization graph G graph of Fig Hence inductive variable instruction INTERVAL EXIT interval head irreducible graph iteration killed loop constant Loop Optimization minimal modified node optimizing compiler PARTITION paths of length point of confluence prime cycles program graph program loops programming languages Proof Proposition recompilation reducible reduction in strength redundancy equations register allocation sequence shown in Fig simple path split graph strongly connected subgraph Subroutine Linkages summand Theorem tion transformations v-busy path vertex vertices