Analysis of standard and new algorithms for the integer ans linear constraint satisfaction problem - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1992

Analysis of standard and new algorithms for the integer ans linear constraint satisfaction problem

Abstract

The integer and linear constraint satisfaction problem, which consists in proving the emptiness of the set of integer points satisfying a set of linear constraints or the existence of a solution, is very frequent in the field of computer science (vectorization, code scheduling, etc.). Most methods proposed in the literature deal with various specific instances of this problem. In this paper, the problem is considered in its general form. Some standard methods are analyzed. Some new algorithms are proposed, either to simplify the problem, or to solve exactly (by cutting plane methods) the reduced for of the problem. A sequence of such algorithms is implemented in the automatic parallelizer available under PIAF, an interactive programming environment for FORTRAN. However, these algorithms could be applied to more difficult problems than the usual ones appearing in data dependence analysis.

Domains

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

Dates and versions

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

Identifiers

  • HAL Id : inria-00074844 , version 1

Cite

Jean-Claude Sogno. Analysis of standard and new algorithms for the integer ans linear constraint satisfaction problem. [Research Report] RR-1828, INRIA. 1992. ⟨inria-00074844⟩
92 View
99 Download

Share

Gmail Facebook Twitter LinkedIn More