• Corpus ID: 1062256

Elastic Solver: Balancing Solution Time and Energy Consumption

  title={Elastic Solver: Balancing Solution Time and Energy Consumption},
  author={Barry Hurley and Deepak Mehta and Barry O’Sullivan},
Combinatorial decision problems arise in many different domains such as scheduling, routing, packing, bioinformatics, and many more. Despite recent advances in developing scalable solvers, there are still many problems which are often very hard to solve. Typically the most advanced solvers include elements which are stochastic in nature. If a same instance is solved many times using different seeds then depending on the inherent characteristics of a problem instance and the solver, one can… 

Figures and Tables from this paper

Combinatorial search from an energy perspective
Learning Sequential and Parallel Runtime Distributions for Randomized Algorithms
This work uses machine learning to predict performance of sequential and parallel local search algorithms, and considers data on the sequential runtime distributions of a local search method to predict with a high accuracy the parallel computation time of a large class of instances.


Expected Gains from Parallelizing Constraint Solving for Hard Problems
Evaluated the speedup as function of connectivity and search difficulty for the particular case of graph coloring with a standard heuristic search method, which requires examining the full search cost distribution rather than just the more commonly reported mean and variance.
SATzilla: Portfolio-based Algorithm Selection for SAT
SATzilla is described, an automated approach for constructing per-instance algorithm portfolios for SAT that use so-called empirical hardness models to choose among their constituent solvers and is improved by integrating local search solvers as candidate solvers, by predicting performance score instead of runtime, and by using hierarchical hardness models that take into account different types of SAT instances.
Statistical Regimes and Runtime Prediction
It is shown that the top three solvers from the 2014 SAT Competition could have been ranked in any permutation, demonstrating the need for more statistically well-founded regimes in empirical evaluations.
Algorithm runtime prediction: Methods & evaluation
ISAC - Instance-Specific Algorithm Configuration
Experiments on a variety of different constrained optimization and constraint satisfaction solvers show that automatic algorithm configuration vastly outperforms manual tuning and frequently leads to significant speed-ups over instance-oblivious configurations.
Exploiting Runtime Variation in Complete Solvers
The digital signal processor with an ASIC wrapper of this invention together provide super-bus-mastering to access the entire memory space in the system, including the entire virtual memory space accessible by the host processor.
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
The following book can be a great choice for constraint programming foundations of artificial intelligence sources when you need to find knowledge and lesson everywhere you want.
Integer Programming
The principles of integer programming are directed toward finding solutions to problems from the fields of economic planning, engineering design, and combinatorial optimization. This highly respected
Frontiers in Artificial Intelligence and Applications
This work traces the roots of ontology-drive information systems (ODIS) back to early work in artificial intelligence and software engineering, and examines two critical ideas in software engineering: raising the level of abstraction, and the use of formal methods.
Minisat 2
  • 2013