A pure hardware k-SAT solver for FPGA

被引:0
|
作者
Bousmar, Khadija [1 ]
机构
[1] Moroccan Sch Engn Sci EMSI, Pluridisciplinary Res & Innovat Lab LPRI, Casablanca, Morocco
关键词
SAT; NP-complete; hardware solver; FPGA implementation;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, two main aspects are developed to solve a problem of management of industrial production resources. These aspects are, on the one hand, the basic principles of operation and resolution of a generic SAT configurable solver and, on the other hand, methods adapted to the operating principle adopted for the hardware solver. Indeed, although targeting goals comparable to those of the software approach (optimization of the search space path), the material approach requires the development of specific resolution methods. These have been specifically optimized for the target application area of industry. The effectiveness of the material approach developed showed satisfactory results on FPGA card "Nexys Video" of Digilent Xilinx Vivado 15.4 suite, point of view of the number of variables used and resolution time on the problems tested.
引用
收藏
页码:481 / 485
页数:5
相关论文
共 50 条
  • [1] A pure hardware k-SAT solver architecture for FPGA based on generic tree-search
    Bousmar, Khadija
    Monteiro, Fabrice
    Habbas, Zineb
    Dellagi, Sofiene
    Dandache, Abbas
    2017 29TH INTERNATIONAL CONFERENCE ON MICROELECTRONICS (ICM), 2017, : 108 - 112
  • [2] FYalSAT: High-Throughput Stochastic Local Search K-SAT Solver on FPGA
    Choi, Young-Kyu
    Kim, Changsoo
    IEEE ACCESS, 2024, 12 : 65503 - 65512
  • [3] kcnfs:: An efficient solver for random k-SAT formulae
    Dequen, G
    Dubois, O
    THEORY AND APPLICATIONS OF SATISFIABILITY TESTING, 2004, 2919 : 486 - 501
  • [4] An Efficient Hardware Implementation of a SAT Problem Solver on FPGA
    Ivan, Teodor
    Aboulhamid, El Mostapha
    16TH EUROMICRO CONFERENCE ON DIGITAL SYSTEM DESIGN (DSD 2013), 2013, : 209 - 216
  • [5] Complexity of k-SAT
    Impagliazzo, R
    Paturi, R
    FOURTEENTH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 1999, : 237 - 240
  • [6] On the complexity of k-SAT
    Impagliazzo, R
    Paturi, R
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2001, 62 (02) : 367 - 375
  • [7] Polarised random k-SAT
    Danielsson, Joel Larsson
    Markstrom, Klas
    COMBINATORICS PROBABILITY AND COMPUTING, 2023, 32 (06) : 885 - 899
  • [8] The number of k-SAT functions
    Bollobás, B
    Brightwell, GR
    RANDOM STRUCTURES & ALGORITHMS, 2003, 22 (03) : 227 - 247
  • [9] The asymptotic k-SAT threshold
    Coja-Oghlan, Amin
    Panagiotou, Konstantinos
    ADVANCES IN MATHEMATICS, 2016, 288 : 985 - 1068
  • [10] An Approximation Algorithm for #k-SAT
    Thurley, Marc
    29TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, (STACS 2012), 2012, 14 : 78 - 87