This Article 
 Bibliographic References 
 Add to: 
Reconfigurable Accelerators for Combinatorial Problems
April 2000 (vol. 33 no. 4)
pp. 58-60

Reconfigurable accelerators can improve process time on combinatorial problems with fine-grained parallelism. Such problems contain a huge number of logical operations (NOT, AND, and OR) that can evaluate simultaneously, a characteristic that varies considerably from problem to problem. Because of this variability, such combinatorial problems are approached using instance-specific reconfiguration--hardware tailored to a specific algorithm and a specific set of input data.

Boolean satisfiability (SAT for short) is a common combinatorial problem that exhibits fine-grained parallelism. SAT varies considerably based on the situation. Its solution is thus an ideal candidate for improvements based on instance-specific reconfiguration. In fact, simulations of an instance-specific accelerator show potential speed-ups by a factor of up to 140,000 in execution time over the solution by a software solver. The authors detail the results of their prototype that leads to an order of magnitude speedup in the execution of difficult satisfiability problems.

Marco Platzner, "Reconfigurable Accelerators for Combinatorial Problems," Computer, vol. 33, no. 4, pp. 58-60, April 2000, doi:10.1109/2.839322
Usage of this product signifies your acceptance of the Terms of Use.