The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.04 - April (2000 vol.33)
pp: 58-60
ABSTRACT
<p>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.</p> <p>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.</p>
CITATION
Marco Platzner, "Reconfigurable Accelerators for Combinatorial Problems", Computer, vol.33, no. 4, pp. 58-60, April 2000, doi:10.1109/2.839322
18 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool