Symbolic Analysis for Parallelizing Compilers

  • Mohammad R. Haghighat

Table of contents

  1. Front Matter
    Pages i-xxiii
  2. Pages 1-4
  3. Pages 5-7
  4. Pages 9-33
  5. Pages 35-58
  6. Pages 95-96
  7. Back Matter
    Pages 97-137

About this book

Introduction

In Symbolic Analysis for Parallelizing Compilers the author presents an excellent demonstration of the effectiveness of symbolic analysis in tackling important optimization problems, some of which inhibit loop parallelization. The framework that Haghighat presents has proved extremely successful in induction and wraparound variable analysis, strength reduction, dead code elimination and symbolic constant propagation. The approach can be applied to any program transformation or optimization problem that uses properties and value ranges of program names. Symbolic analysis can be used on any transformational system or optimization problem that relies on compile-time information about program variables. This covers the majority of, if not all optimization and parallelization techniques.
The book makes a compelling case for the potential of symbolic analysis, applying it for the first time - and with remarkable results - to a number of classical optimization problems: loop scheduling, static timing or size analysis, and dependence analysis. It demonstrates how symbolic analysis can solve these problems faster and more accurately than existing hybrid techniques.

Keywords

compiler optimization scheduling time

Authors and affiliations

  • Mohammad R. Haghighat
    • 1
  1. 1.Center for Supercomputing Research and DevelopmentUniversity of Illinois at Urbana-ChampaignUrbanaUSA

Bibliographic information

  • DOI https://doi.org/10.1007/b102246
  • Copyright Information Kluwer Academic Publishers 1995
  • Publisher Name Springer, Boston, MA
  • eBook Packages Springer Book Archive
  • Print ISBN 978-0-7923-9623-9
  • Online ISBN 978-0-585-26829-3
  • About this book
Industry Sectors
Electronics
Aerospace
Automotive