Quine-McCluskey algorithm on GPGPU

Vladimir Siladi, Tomas Filo
Matej Bel University, Tajovskeho 40, Banska Bystrica 974 01, Slovak Republic
AWERProcedia Information Technology and Computer Science, Vol 4 (2013): 3rd World Conference on Innovation and Computer Science (INSODE-2013), 2013


   title={Quine-McCluskey algorithm on GPGPU},

   author={Sil{‘a}di, Vladim{‘i}r and Filo, Tom{‘a}{v{s}}},

   journal={AWERProcedia Information Technology and Computer Science},





Download Download (PDF)   View View   Source Source   



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).
Rating: 2.5/5. From 1 vote.
Please wait...

* * *

* * *

HGPU group © 2010-2021 hgpu.org

All rights belong to the respective authors

Contact us: