We demonstrate Dagster, a system that implements new approach to scheduling interdependent (Boolean) SAT search activities in high-performance computing (HPC) environments. Our takes as input set of disjunctive clauses (i.e., DIMACS CNF) and labelled directed acyclic graph (DAG) structure describing how the are decomposed into interrelated problems. Component problems solved using standard syst...

A parallel hybrid method for solving the satisfiability (SAT) problem that combines cellular genetic algorithms (GAs) and the random walk SAT (WSAT) strategy of greedy SAT (GSAT) is presented. The method, called cellular genetic WSAT (CGWSAT), uses a cellular GA to perform a global search from a random initial population of candidate solutions and a local selective generation of new strings. Gl...

Abstract This study presents an asynchronous parallel evolutionary algorithm based on message passing model (MAPEA) for solving complex function optimization problems with constraints. The MAPEA combines a local search into the global search. The local search is based on Tabu search, and the radius of neighborhood is self-adaptive. The MAPEA is implemented in Parallel Virtual Machine (PVM) prog...

This paper presents a sophisticated and efficient parallel scheme for the DIRECT global optimization algorithm of Jones et al. (1993). Although several sequential implementations for this algorithm have been successfully applied to large scale MDO problems, few parallel versions of the DIRECT algorithm have addressed well algorithm characteristics such as a single starting point, an unpredictab...

In this paper we prove global convergence for asynchronous parallel pattern search. In standard pattern search, decisions regarding the update of the iterate and the step-length control parameter are synchronized implicitly across all search directions. We lose this feature in asynchronous parallel pattern search since the search along each direction proceeds semiautonomously. By bounding the v...