Mallob: Scalable SAT Solving On Demand With Decentralized Job Scheduling

Peter Sanders; Dominik Schreiber

doi:10.21105/joss.04591

Mallob: Scalable SAT Solving On Demand With Decentralized Job Scheduling

Python Submitted 29 June 2022 • Published 09 August 2022

Review

Editor: @danielskatz (all papers)
Reviewers: @ARMartinelli (all reviews), @massimotorquati (all reviews)

Authors

Peter Sanders (0000-0003-3330-9349), Dominik Schreiber (0000-0002-4185-1851)

Citation

Sanders et al., (2022). Mallob: Scalable SAT Solving On Demand With Decentralized Job Scheduling. Journal of Open Source Software, 7(76), 4591, https://doi.org/10.21105/joss.04591

@article{Sanders2022, doi = {10.21105/joss.04591}, url = {https://doi.org/10.21105/joss.04591}, year = {2022}, publisher = {The Open Journal}, volume = {7}, number = {76}, pages = {4591}, author = {Peter Sanders and Dominik Schreiber}, title = {Mallob: Scalable SAT Solving On Demand With Decentralized Job Scheduling}, journal = {Journal of Open Source Software} }

Copy citation string · Copy BibTeX

Tags

C++ online job scheduling malleability load balancing propositional satisfiability SAT solving parallel processing HPC

Altmetrics

Markdown badge

License

Authors of JOSS papers retain copyright.

This work is licensed under a Creative Commons Attribution 4.0 International License.

Table of Contents
Public user content licensed CC BY 4.0 unless otherwise specified.
ISSN 2475-9066