Implementing CSAT Local Search on FPGAs

DMCA

Implementing CSAT Local Search on FPGAs

Cached

Download Links

[www.comp.nus.edu.sg]
[www.comp.nus.edu.sg]

Other Repositories/Bibliography

DBLP

by Martin Henz , Edgar Tan , H. C. Yap

BibTeX

@MISC{Henz_implementingcsat,
    author = {Martin Henz and Edgar Tan and H. C. Yap},
    title = {Implementing CSAT Local Search on FPGAs},
    year = {}
}

OpenURL

Abstract

Abstract. Stochastic local search methods such as GSAT, WalkSAT and their variants have been used successfully at solving propositional satisfiability problems (SAT). The key operation in these local search algorithms is the speed of variable flipping. We present a parallel FPGA designs for CSAT capable of one flip per clock cycle which is achieved by exploiting maximal parallelism and “multi-try ” pipelining. Experimental results show that a speedup of two orders of magnitude over software implementations can be achieved. 1

Keyphrases

csat local search variable flipping multi-try pipelining key operation stochastic local search method parallel fpga design csat capable software implementation local search algorithm propositional satisfiability problem experimental result maximal parallelism clock cycle

DMCA