Symbolic Analysis for Parallelizing Compilers

This title is printed to order. This book may have been self-published. If so, we cannot guarantee the quality of the content. In the main most books will have gone through the editing process however some may not. We therefore suggest that you be aware of this before ordering this book. If in doubt check either the author or publisher’s details as we are unable to accept any returns unless they are faulty. Please contact us if you have any questions.

In this text, the author presents a 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 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 systemor 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 aims to make a case for the potential of symbolic analysis, applying it to a number of classical optimization problems: loop scheduling, static timing or size analysis, and dependence analysis.