A Dynamic Moldable Job Scheduling Based Parallel SAT Solver

  title={A Dynamic Moldable Job Scheduling Based Parallel SAT Solver},
  author={Sajjad Asghar and Eric E. Aubanel and David Bremner},
  journal={2013 42nd International Conference on Parallel Processing},
In a shared cluster facility scheduling of parallel jobs is an important factor that can affect the performance and turnaround time of the submitted jobs. To solve hard tree search problems, we have designed the Dynamic Moldable Tree Search (DMTS) framework. The DMTS framework allows existing serial tree search applications to run in parallel with very little development effort. The DMTS framework is designed to run on parallel computing infrastructures, including clusters, computational grids… 
Two-level utilization-based processor allocation for scheduling moldable jobs
This research work on developing new processor allocation approaches for moldable job scheduling based on two-level resource utilization calculation, preemptive job execution, and dual-criteria iterative improvement demonstrates significant performance improvement in terms of average turnaround time.
Dynamic Resource Management and Job Scheduling for High Performance Computing = Dynamisches Ressourcenmanagement und Job-Scheduling für das Hochleistungsrechnen
This thesis presents dynamic scheduling methods for evolving jobs and presents a unique scheduling technique for malleable jobs and an algorithm for the combined scheduling of all four types of jobs in a cluster environment, which improves the resiliency of cluster systems.
Parallel hybrid genetic algorithm for sat problems based on OpenMP
This article describes the design and implementation of CGPHGA, a parallel Hybrid GA based on the Coarse-Grained Model that improves the success rate and efficiency of the SAT problem and combines GA with the Local Search Algorithm (LSA) and improves the sort algorithm.
A Multilevel Pseudo-Boolean Satisfiability-Based Approach for Segmented Channel Routing
This paper utilizes the compelling advancements in satisfiability (SAT) solvers to propose a multilevel pseudo-Boolean SAT-based approach to segmented channel routing and shows that the unroutability of a given circuit can be proved by the approach.
Evaluating the SAT problem on P systems for different high-performance architectures
This paper analyzes the simulation of a family of recognizer P systems with active membranes that solves the satisfiability problem in linear time on three different architectures: a shared memory multiprocessor, a distributed memory system, and a manycore graphics processing unit (GPU).
Some Multicolor Ramsey Numbers Involving Cycles
Some Multicolor Ramsey Numbers Involving Cycles David E. Narvaez, M.S. Rochester Institute of Technology, 2015 Supervisor: Dr. Stanis law P. Radziszowski Establishing the values of Ramsey numbers is,
Traceless automated design debugging of liveness properties using property directed reachability
This thesis presents two novel automated techniques to perform design debugging in the absence of an error trace, using the use of PDR to avoid the memory-intensive ILA representation, making it possible to solve larger problem instances.


A Parallelization Scheme Based on Work Stealing for a Class of SAT Solvers
This paper proposes a parallelization scheme for a class of SAT solvers based on the DPLL procedure that uses a dynamic load-balancing mechanism based on work-stealing techniques to deal with the irregularity of SAT problems.
Using Moldability to Improve the Performance of Supercomputer Jobs
This dissertation shows that the request that submits a moldable job can be automatically selected in a way that often reduces the job's turn-around time, and introduces and evaluates SA, an application scheduler that chooses which request to use to submit a Moldable job on behalf of the user.
A fast parallel SAT-solver — efficient workload balancing
A fast parallel SAT-solver on a message based MIMD machine using optimized data structures to modify Boolean formulas and efficient workload balancing algorithms are used, to achieve a uniform distribution of workload among the processors.
PSATO: a Distributed Propositional Prover and its Application to Quasigroup Problems
A distributed/parallel prover for propositional satisfiability (SAT), called PSATO, for networks of workstations based on the sequential SAT prover SATO, which is an efficient implementation of the Davis –Putnam algorithm.
GrADSAT: A Parallel SAT Solver for the Grid
GrADSAT is compared against the best sequential solver using a wide variety of problem instances and shows that GrADSAT delivers speed-up on most instances and is capable of solving problem instance which were never solved before.
PMSat: a parallel version of MiniSAT
PMSat: a parallel version of MiniSAT with MPI (Message Passing Interface) technology, to be executed in clusters or grids of computers, with main features: search modes, search space pruning and share of learnt clauses.
Parallel Branch and Cut
The results illustrate the degree to which various sources of parallel overhead affect scalability and demonstrate that properties of the problem class itself can dictate the effectiveness of a particular methodology.
ManySAT: a Parallel SAT Solver
In this paper, ManySAT a new portfolio-based parallel SAT solver is thoroughly described. The design of ManySAT benefits from the main weaknesses of modern SAT solvers: their sensitivity to parameter
Multithreaded SAT Solving
Results show that in single threaded mode, MiraXT compares well to other state of the art solvers on industrial problems, and provides cutting edge performance, as speedup is obtained on both SAT and UNSAT instances.
Effective Selection of Partition Sizes for Moldable Scheduling of Parallel Jobs
The proposed scheduling strategy is shown to provide significant benefits over a rigid scheduling model and is also considerably better than a previously proposed approach to moldable job scheduling.