An exact algorithm for the constraint satisfaction problem : application to dependance computing in automatic parallelization - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 1990

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

H. Bennaceur
  • Function : Author
G. Plateau
  • Function : Author
F. Thomasset
  • Function : Author

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.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-1246.pdf (569.83 Ko) Télécharger le fichier

Dates and versions

inria-00075312 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00075312 , version 1

Cite

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⟩
36 View
16 Download

Share

Gmail Facebook Twitter LinkedIn More