The range test: A dependence test for symbolic, nonlinear expressions

Conference · Sat Dec 31 00:00:00 EST 1994

OSTI ID:87657

Blume, W; Eigenmann, R ^[1]

---

1. Univ. of Illinois, Urbana, IL (United States). Center for Supercomputing Research and Development

Most current data dependence tests cannot handle loop bounds or array subscripts that are symbolic, nonlinear expressions (e.g. A(n*i+j)), where (0 {<=} j {<=} n). In this paper, the authors describe a dependence test, called the range test, that can handle such expressions. Briefly, the range test proves independence by determining whether certain symbolic inequalities hold for a permutation of the loop nest. Powerful symbolic analyses and constraint propagation techniques were developed to prove such inequalities. The range test has been implemented in Polaris, a parallelizing compiler being developed at the University of Illinois.

• OSTI ID: 87657
• Report Number(s): CONF-941118-; ISBN 0-8186-6605-6; TRN: IM9535%%289
• Resource Relation: Conference: Supercomputing `94 meeting, Washington, DC (United States), 14-18 Nov 1994; Other Information: PBD: 1994; Related Information: Is Part Of Supercomputing `94: Proceedings; PB: 849 p.
• Country of Publication: United States
• Language: English

Related Subjects

99 MATHEMATICS
COMPUTERS
INFORMATION SCIENCE
MANAGEMENT
LAW
MISCELLANEOUS
PARALLEL PROCESSING
TRANSLATORS
SUPERCOMPUTERS
NONLINEAR PROBLEMS
ALGORITHMS
BENCHMARKS
P CODES