Journal ArticleDOI
Reconfigurable accelerators for combinatorial problems
Reads0
Chats0
TLDR
The authors detail the results of their prototype that results an order-of-magnitude speed-up in the execution of difficult satisfiability problems and suggest an ideal candidate for improvements based on instance-specific reconfiguration.Abstract:
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, simulation 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 results an order-of-magnitude speed-up in the execution of difficult satisfiability problems.read more
Citations
More filters
Book ChapterDOI
Cancelable key-based fingerprint templates
TL;DR: This work considers a key–dependent geometric transform that is applied to the features extracted from a fingerprint, to generate a key-dependent cancelable template for the fingerprint, and investigates performance of an authentication system that uses this cancelable fingerprint when a fingerprint matching algorithm is used for detection.
Journal ArticleDOI
Reconfigurable hardware SAT solvers: a survey of systems
TL;DR: In this paper, the state-of-the-art in reconfigurable hardware SAT satisfiers is presented, and the analysis and classification of existing systems has been performed according to such criteria as algorithmic issues, reconfiguration modes, the execution model, the programming model, logic capacity, and performance.
Patent
Multiprocessor with each processor element accessing operands in loaded input buffer and forwarding results to FIFO output buffer
Jon M. Huppenthal,Paul A. Leskar +1 more
TL;DR: An enhanced memory algorithmic processor (MAP) as discussed by the authors is an architecture for multiprocessor computer systems which comprises an assembly that may include an array of field programmable gate arrays (FPGAs) functioning as the memory algorithms.
Patent
System and method for accelerating web site access and processing utilizing a computer system incorporating reconfigurable processors operating under a single operating system image
TL;DR: A system and method for accelerating web site access and processing utilizing a multiprocessor computer system incorporating reconfigurable and standard microprocessors as the web site server is described in this paper.
Journal ArticleDOI
Reconfigurable models of finite state machines and their implementation in FPGAs
TL;DR: This paper examines some models of finite state machines (FSMs) that can be implemented in dynamically and statically reconfigurable FPGAs and shows that such reusable circuits require very limited FPGA resources and they can be reprogrammed in much the same way as for software development.
References
More filters
Journal ArticleDOI
A Computing Procedure for Quantification Theory
Martin Davis,Hilary Putnam +1 more
TL;DR: In the present paper, a uniform proof procedure for quantification theory is given which is feasible for use with some rather complicated formulas and which does not ordinarily lead to exponentiation.
Proceedings ArticleDOI
GRASP—a new search algorithm for satisfiability
TL;DR: Experimental results obtained from a large number of benchmarks, including many from the field of test pattern generation, indicate that application of the proposed conflict analysis techniques to SAT algorithms can be extremely effective for aLarge number of representative classes of SAT instances.
Algorithms for the Satisfiability (SAT) Problem: A Survey,
TL;DR: This survey presents a general framework (an algorithm space) that integrates existing SAT algorithms into a unified perspective and describes sequential and parallel SAT algorithms including variable splitting, resolution, local search, global optimization, mathematical programming, and practical SAT algorithms.
Book ChapterDOI
Acceleration of Satisfiability Algorithms by Reconfigurable Hardware
TL;DR: A design tool flow and prototype implementation of an instance-specific satisfiability solver are presented and the results prove that many of the DIMACS examples can be accelerated with current FPGA technology.
Proceedings ArticleDOI
Dynamic circuit generation for Boolean satisfiability in an object-oriented design environment
Oskar Mencer,M. Plazner +1 more
TL;DR: This work considers reconfigurable hardware accelerators for the NP-complete Boolean satisfiability problem and integrates the advantages of an object-oriented design environment with full control over placement at every level of abstraction with commercial FSM synthesis and optimization.