ALGORITHM FOR THE ANALYSIS OF EXACTICTY OF BANERJEE TEST
Journal: INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY (Vol.10, No. 3)Publication Date: 2013-04-01
Authors : Monica Ciaca; Loredana Mocean; Alexandru Vancea;
Page : 1410-1426
Keywords : Banerjee; data dependences; imprecise test; solvable;
Abstract
In compiler theory, the Banerjee test is a dependence test. The Banerjee test assumes that all loop indices are independent, however in reality, this is often not true. The Bannerjee test is a conservative test. That is, it will not break a dependence that does not exist.This means that the only thing the test can guarantee is the absence of dependence.This paper proposes an innovative algorithm which allows precise determination of information about dependences and can act in situation where certain cycling limits are known.
Other Latest Articles
- The Power Savings Possibilities by Light in the Smart Home Care
- Genetic algorithm based approach to solve travelling salesman problem with one point crossover operator:
- INSTABILITY PROBLEM OF CONVENTIONAL TRANSFORMER DIFFERENTIAL PROTECTION-APPLICATION OF ZERO SEQUENCE CURRENT TRAP
- VEGETABLE OILS FOR HIGH VOLTAGE INSULATION BY
- AUTOMATIC ROAD DETECTION OF SATELLITE IMAGES USING IMPROVED EDGE DETECTION
Last modified: 2016-06-29 19:02:46