Referenced Items are not available for this document.
Many analyses and transformations in a parallelizing compiler can benefit from the ability to compare arbitrary symbolic expressions. In this paper, we describe how one can compare expressions by using symbolic ranges of variables. A range is a lower and upper bound on a variable. We describe how these ranges can be efficiently computed from the program test. Symbolic range propagation has been implemented in Polaris, a parallelizing compiler being developed at the University of Illinois, and is used for symbolic dependence testing, detection of zero-trip loops, determining array sections possibly referenced by an access, and loop iteration-count estimation
Published in:
Parallel Processing Symposium, 1995. Proceedings., 9th International
Date of Conference: 25-28 Apr 1995
- Page(s):
- 357 - 363
- Meeting Date :
- 25 Apr 1995-28 Apr 1995
- Print ISBN:
- 0-8186-7074-6
- INSPEC Accession Number:
- 4962875
- Conference Location :
- Santa Barbara, CA
- Digital Object Identifier :
- 10.1109/IPPS.1995.395956
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
