Using Constraint Programming to Achieve Optimal Prefetch Scheduling for Dependent Tasks on Run-Time Reconfigurable Devices.
Yang QuJuha-Pekka SoininenJari NurmiPublished in: SoC (2006)
Keyphrases
- constraint programming
- constraint satisfaction problems
- constraint propagation
- combinatorial problems
- constraint satisfaction
- integer programming
- symmetry breaking
- search strategies
- global constraints
- finite domain
- dynamic programming
- constraint solving
- column generation
- low cost
- constraint problems
- np hard problems
- arc consistency
- propositional satisfiability
- constraint logic programming
- constraint optimization
- hard and soft constraints
- heuristic search
- prefetching
- itemset mining
- worst case
- optimal solution
- backtrack search