Skip to search formSkip to main contentSkip to account menu

GCD test

In compiler theory of computer science, A Greatest common divisor Test is the test used in study of loop optimization and loop dependence analysis to… 
Wikipedia (opens in a new tab)

Related topics

Related topics

7 relations
Automatic parallelizationComputer scienceDependence analysisFor loop

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Fast prime generation algorithms using proposed GCD test on mobile smart devices
As mobile smart devices are widely used, mobile security becomes more and more important. However, the performance of these… 
2014
2014
A loop splitting method for single loops with non-uniform dependences
2012
2012
A Nonlinear Array Subscripts Dependence Test
Linear dependence tests determine the dependences with linear array subscripts, but only give the passive results for those with… 
2003
2003
A new practical array data dependence analysis for parallelizing compilers
Data dependence analysis is essential for automatic parallelizing compilers. Compilers determine the possibility of… 
2002
2002
Program analysis techniques for transforming programs for parallel execution
2001
2001
Analysis of Rabin's irreducibility test for polynomials over finite fields
We give a precise average‐case analysis of Rabin's algorithm for testing the irreducibility of polynomials over finite fields… 
1994
1994
An Empirical Study of the I Test for Exact Data Dependence
  • K. PsarrisS. Pande
  • International Conference on Parallel Processing…
  • 1994
  • Corpus ID: 42430093
Parallelizing Compilers rely upon subscript analysis to detect data dependences between pairs of array references inside loop… 
1991
1991
On the Accuracy of the Banerjee Test
1990
1990
On the perfect accuracy of an approximate subscript analysis test
The Banerjee test is commonly considered to be the more accurate of the two major approximate data dependence tests used in… 
1989
1989
The Design of Automatic Parallelizers for Symbolic and Numeric Programs
Parcel was arguably the first complete system for the automatic parallelization of Lisp programs. It was quite successful in… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)