Y. Hamadi, C. Bessiere, J. Quinqueton
The GSAT procedure is a greedy local search procedure. Its aim is to find a satisfiable instanciation of logical formula under conjunctive normal form. Infinite by nature, this algorithm has showed all its ability to deal with formulas of large dimensions which axe not accessible to cl'~ssical exhaustive methods. These formulas can bc used for encoding any constraint satisfaction problem (CSP). The purpose of this paper is the presentation of a fully distributed version of the GSAT procedure. Our aim is to provide a new version of the algorithm for taking advantage of future hardware. Massively parallel macl~ines will permit faster convergence for our distributed algorithm.