Current Proceedings on Technology

Current Proceedings on Technology

Quine-McCluskey algorithm on GPGPU

Yazarlar: Vladimír Siládi, Tomáš Filo

Cilt 4 , Sayı - , 2013 , Sayfalar -

Konular:-

Anahtar Kelimeler:Quine-McCluskey algorithm,GPGPU,CUDA,Parallel programming

Özet: This paper deals with parallelization of the Quine–McCluskey algorithm. This boolean function minimization algorithm has a limitation when dealing with more than four variables. The problem computed by this algorithm is NP-hard and runtime of the algorithm grows exponentially with the number of variables. The goal is to show that parallel implementation of the Quine–McCluskey algorithm on graphics processing units (GPUs) brings significant acceleration of computing process. Parallelization of the algorithm is implemented through Compute Unified Device Architecture (CUDA), which is a parallel computing platform and programming model created by NVIDIA and implemented by graphics processing units (GPUs).

ATIFLAR
Atıf Yapan Eserler
Henüz Atıf Yapılmamıştır
KAYNAK GÖSTER
BibTex
KOPYALA
@article{2013, title={Quine-McCluskey algorithm on GPGPU}, volume={4}, number={0}, publisher={Current Proceedings on Technology }, author={Vladimír Siládi, Tomáš Filo}, year={2013} }
APA
KOPYALA
Vladimír Siládi, Tomáš Filo. (2013). Quine-McCluskey algorithm on GPGPU (Vol. 4). Vol. 4. Current Proceedings on Technology .
MLA
KOPYALA
Vladimír Siládi, Tomáš Filo. Quine-McCluskey Algorithm on GPGPU. no. 0, Current Proceedings on Technology , 2013.
Atıf Görüntüle
PDF Görüntüle
Kaynak Görüntüle
Paylaş
Dergi Bilgileri