A Dynamic Moldable Job Scheduling Based Parallel SAT Solver

S. Asghar; E. Aubanel; D. Bremner

DOI:10.1109/ICPP.2013.20

Corpus ID: 15124201

A Dynamic Moldable Job Scheduling Based Parallel SAT Solver

@article{Asghar2013ADM,
  title={A Dynamic Moldable Job Scheduling Based Parallel SAT Solver},
  author={S. Asghar and E. Aubanel and D. Bremner},
  journal={2013 42nd International Conference on Parallel Processing},
  year={2013},
  pages={110-119}
}

S. Asghar, E. Aubanel, D. Bremner

Published 2013

Computer Science

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… CONTINUE READING

View on IEEE

Share This Paper

7 Citations

Background Citations

Methods Citations

Figures, Tables, and Topics from this paper

Figures and Tables

Two-level utilization-based processor allocation for scheduling moldable jobs

Ying-Jhih Wu, Shuo-Ting Yu, K. Lai, Amit Chhabra, Hsi-Ya Chang, K. Huang
Computer Science
The Journal of Supercomputing
2020

Dynamic Resource Management and Job Scheduling for High Performance Computing = Dynamisches Ressourcenmanagement und Job-Scheduling für das Hochleistungsrechnen

S. Prabhakaran
Computer Science
2016

Parallel hybrid genetic algorithm for sat problems based on OpenMP

Guanfeng Wu, Q. Chen, F. Cao, Yang Xu, Xiaomei Zhong
Computer Science
2017 12th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)
2017