Solving satisfiability problems on FPGAs

Takayuki Suyama, Makoto Yokoo, Hiroshi Sawada

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

8 引用 (Scopus)

抜粋

This paper presents a report on a new approach for solving satisfiability problems (SAT), i.e., creating a specialized logic circuit to solve each problem instance on Field Programmable Gate Arrays (FP-GAs). Recently, due to advances in FPGA technologies, users can now create their own reconfigurable logic circuits. Furthermore, by using current automatic logic synthesis technologies, users are able to design logic circuits automatically using a high level hardware description language (HDL). The combination of these two technologies have enabled users to rapidly create logic circuits specialized for solving individual problem instances. Satisfiability problems (SAT) were chosen because they make up an important subclass of NP-hard problems. We have developed a new algorithm called parallel-checking, which is suitable for this approach. In the algorithm, all variable values are assigned simultaneously, and all constraints are checked concurrently. Simulation results show that the order of the search tree size in this algorithm is approximately the same as that in the Davis-Putnam procedure. Then, we show how the parallel-checking algorithm can be implemented on FPGAs.

元の言語英語
ホスト出版物のタイトルField-Programmable Logic
ホスト出版物のサブタイトルSmart Applications, New Paradigms and Compilers - 6th International Workshop on Field-Programmable Logic and Applications, FPL 1996, Proceedings
編集者Reiner W. Hartenstein, Manfred Glesner
出版者Springer Verlag
ページ136-145
ページ数10
ISBN(印刷物)9783540617303
DOI
出版物ステータス出版済み - 1 1 1996
外部発表Yes
イベント6th International Workshop on Field-Programmable Logic and Applications, FPL 1996 - Darmstadt, ドイツ
継続期間: 9 23 19969 25 1996

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
1142
ISSN(印刷物)0302-9743
ISSN(電子版)1611-3349

その他

その他6th International Workshop on Field-Programmable Logic and Applications, FPL 1996
ドイツ
Darmstadt
期間9/23/969/25/96

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント Solving satisfiability problems on FPGAs' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用

    Suyama, T., Yokoo, M., & Sawada, H. (1996). Solving satisfiability problems on FPGAs. : R. W. Hartenstein, & M. Glesner (版), Field-Programmable Logic: Smart Applications, New Paradigms and Compilers - 6th International Workshop on Field-Programmable Logic and Applications, FPL 1996, Proceedings (pp. 136-145). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 1142). Springer Verlag. https://doi.org/10.1007/3-540-61730-2_14