Optimal compilation for exposed datapath architectures with buffered processing units by SAT solvers.
Anoop BhagyanathKlaus SchneiderPublished in: MEMOCODE (2016)
Keyphrases
- sat solvers
- processing units
- propositional satisfiability
- dynamic programming
- orders of magnitude
- parallel computing
- sat solving
- search space
- sat problem
- optimal solution
- sat instances
- constraint satisfaction
- parallel processing
- max sat
- boolean satisfiability
- search strategies
- computing systems
- information retrieval
- heuristic search
- general purpose
- evolutionary algorithm
- clause learning
- information systems