On efficiently characterizing solutions of linear diophantine equations and its application to data dependence analysis

Christine Eisenbeis 1 Olivier Temam 2 Harry Wijshoff
2 CALCPAR - Calculateurs Parallèles
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, INRIA Rennes
Abstract : In this paper we present severals sets of mathematical tools for characterizing the solutions of linear Diophantine equations. First, a number of methods are given for reducing the complexity of the computations. Thereafter, we introduce different techniques for determining the exact number of solutions of linear Diophantine equations. Finally, we present a method for extracting efficiently the solutions of such equations. For all these methods the main focus has been put on their applicability and efficiency for data dependence analysis.
Type de document :
Rapport
[Research Report] RR-1616, INRIA. 1992
Liste complète des métadonnées

https://hal.inria.fr/inria-00074944
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 17:01:52
Dernière modification le : mercredi 16 mai 2018 - 11:23:14
Document(s) archivé(s) le : mardi 12 avril 2011 - 20:12:16

Fichiers

Identifiants

  • HAL Id : inria-00074944, version 1

Citation

Christine Eisenbeis, Olivier Temam, Harry Wijshoff. On efficiently characterizing solutions of linear diophantine equations and its application to data dependence analysis. [Research Report] RR-1616, INRIA. 1992. 〈inria-00074944〉

Partager

Métriques

Consultations de la notice

161

Téléchargements de fichiers

77