An exact algorithm for the constraint satisfaction problem : application to dependance computing in automatic parallelization

Abstract : The constraint satisfaction problem - denoted by CSP - consists in proving the emptiness of a domain defined by a set of constraints or the existence of a solution. Numerous applications arise in the computer science field (artificial intelligence, vectorization, verification of programs,...). In the case of the study of dependence computing in automatic parallelization, classical methods in literature may break down for some instances of CSP, even with small sizes. By constrast the new method - denoted by FAS3T (Fast Algorithm for the Small Size constraints Satisfaction problem Type) - we propose allows an efficient solution of the CSP concrete instances generated by the VATIL vectorizer. Comparative computational results are reported.
Type de document :
Rapport
RR-1246, INRIA. 1990
Liste complète des métadonnées

https://hal.inria.fr/inria-00075312
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 17:56:45
Dernière modification le : vendredi 16 septembre 2016 - 15:11:34
Document(s) archivé(s) le : mardi 12 avril 2011 - 22:28:27

Fichiers

Identifiants

  • HAL Id : inria-00075312, version 1

Collections

Citation

H. Bennaceur, G. Plateau, F. Thomasset. An exact algorithm for the constraint satisfaction problem : application to dependance computing in automatic parallelization. RR-1246, INRIA. 1990. 〈inria-00075312〉

Partager

Métriques

Consultations de la notice

78

Téléchargements de fichiers

40