Parallel and scalable architecture for solving SATisfiability on reconfigurable FPGA
Yazarlar (4)
T. Pagarani
Case School of Engineering, Amerika Birleşik Devletleri
Case School of Engineering, Amerika Birleşik Devletleri
Doç. Dr. Fatih KOÇAN Case School of Engineering, Amerika Birleşik Devletleri
D. G. Saab
Case School of Engineering, Amerika Birleşik Devletleri
Case School of Engineering, Amerika Birleşik Devletleri
J. A. Abraham
The University of Texas At Austin, Amerika Birleşik Devletleri
The University of Texas At Austin, Amerika Birleşik Devletleri
| Makale Türü | Özgün Makale (SCOPUS dergilerinde yayınlanan tam makale) | ||
| Dergi Adı | Proceedings of the Custom Integrated Circuits Conference | ||
| Dergi ISSN | 0886-5930 | ||
| Makale Dili | İngilizce | Basım Tarihi | 01-2000 |
| Cilt / Sayı / Sayfa | 0 / 1 / 147–150 | DOI | 10.1109/CICC.2000.852637 |
| Makale Linki | http://ieeexplore.ieee.org/document/852637/ | ||
| UAK Araştırma Alanları |
|
||
| Özet |
| In this paper, we present different architectures and implementation for solving the general SATisfiability (SAT) problem on reconfigurable devices. In particular, we address the solution of this basic and important problem using multiple small FPGAs. Our approach utilizes partitioning and decomposition to map any large SAT problem on more than one small FPGA. First, a SAT problem is decomposed into several independent sub-problems. This way, all sub-problems may be solved on different FPGAs simultaneously. If any of the sub-problems can not fit on a single FPGA, then a second technique is used to divide the sub-problem into dependent parts. We compute the solution time and hardware resources for both approaches and also compare our results with the previously published results. |
| Anahtar Kelimeler |
BM Sürdürülebilir Kalkınma Amaçları
| Atıf Sayıları |