Abstract
This paper deals with the problem of deciding whether two Systems of Affine Recurrence Equations are equivalent or not. A solution to this problem would be a step toward algorithm recognition, an important tool in program analysis, optimization and parallelization. We first prove that in the general case, the problem is undecidable. We then show that there nevertheless exists a semi-decision procedure, in which the key ingredient is the computation of transitive closures of affine relations. This is a non-effective process which has been extensively studied. Many partial solutions are known. We then report on a pilot implementation of the algorithm, describe its limitations, and point to unsolved problems.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
D. Barthou, P. Feautrier, and X. Redon. On the equivalence of two systems of affine recurrence equations. Technical Report RR-4285, INRIA, Oct. 2001.
B. Boigelot and P. Wolper. Symbolic verification with periodic sets. In Proceedings of the 6th International Conference on Computer-Aided Verification, volume 818 of Lecture Notes in Computer Science, pages 55–67. Springer-Verlag, 1994.
A. Darte, Y. Robert, and F. Vivien. Scheduling and automatic Parallelization. Birkhäuser, 2000.
P. Feautrier. Dataflow analysis of scalar and array references. Int. J. of Parallel Programming, 20(1):23–53, Feb. 1991.
M. Griebl and C. Lengauer. The loop parallelizer LooPo — Announcement. In 9th Languages and Compilers for Parallel Computing Workshop. Springer, LNCS 1239, 1996. rs http://www.fmi.uni-passau.de/cl/loopo URL.
W. Kelly, W. Pugh, E. Rosser, and T. Shpeisman. Transitive closure of infinite graphs and its applications. Int. J. of Parallel Programming, 24(6):579–598, 1996.
H. Leverge, C. Mauras, and P. Quinton. The alpha language and its use for the design of systolic arrays. Journal of VLSI Signal Processing, 3:173–182, 1991.
R. Metzger and Z. Wen. Automatic Algorithm Recognition: A New Approach to Program Optimization. MIT Press, 2000.
X. Redon and P. Feautrier. Detection of scans in the polytope model. Parallel Algorithms and Applications, 15:229–263, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barthou, D., Feautrier, P., Redon, X. (2002). On the Equivalence of Two Systems of Affine Recurrence Equations. In: Monien, B., Feldmann, R. (eds) Euro-Par 2002 Parallel Processing. Euro-Par 2002. Lecture Notes in Computer Science, vol 2400. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45706-2_40
Download citation
DOI: https://doi.org/10.1007/3-540-45706-2_40
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44049-9
Online ISBN: 978-3-540-45706-0
eBook Packages: Springer Book Archive