Please use this identifier to cite or link to this item:
|Title:||Implementing CSAT local search on FPGAs||Authors:||Henz, M.
|Issue Date:||2002||Citation:||Henz, M.,Tan, E.,Yap, R.H.C. (2002). Implementing CSAT local search on FPGAs. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2438 LNCS : 1156-1159. ScholarBank@NUS Repository.||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. © Springer-Verlag Berlin Heidelberg 2002.||Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)||URI:||http://scholarbank.nus.edu.sg/handle/10635/40787||ISBN:||3540441085||ISSN:||03029743|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Oct 14, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.