Abstract
The calculation of an exact minimal cover of a Boolean function is an NP-complete problem which has important applications in circuit design. We could reduce the required time for the calculation by a factor of more than \(3.5 *10^7\) in [9], more than \(8 *10^8\) in [8], and even \(9 *10^9\) using a single CPU-core. Using a GPU, we achieved in [7] even a factor of improvement of \(1.2 *10^{11}\) [7].
In this paper we compare our so far best approach with a powerful algorithm for the same problem recently published by other authors [1]. The second aim of this paper is the optimization of our so far fastest algorithm which solves the Unate Covering Problem on a GPU. An extended abstract of this paper was published in [6].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Borowik, G., Łuba, T.: Fast algorithm of attribute reduction based on the complementation of Boolean function. In: Klempous, R., Nikodem, J., Jacak, W., Chaczko, Z. (eds.) Advanced Methods and Applications in Computational Intelligence, pp. 25–40. Springer, Heidelberg (2014)
Brayton, R.K., Hachtel, G.D., McMullen, C.T., Sangiovanni-Vincentelli, A.: Logic Minimization Algorithms for VLSI Synthesis. Kluwer Academic Publishers, Dordrecht (1984)
Cordone, R., Ferrandi, F., Sciuto, D., Wolfler Calvo, R.: An efficient heuristic approach to solve the unate covering problem. In: Proceedings of the Conference on Design, Automation and Test in Europe, Paris, France, pp. 364–371 (2000)
Posthoff, C., Steinbach, B.: Logic Functions and Equations - Binary Models for Computer Science. Springer, Dordrecht (2004)
Steinbach, B., Posthoff, Ch.: An extended theory of Boolean normal forms. In: Proceedings of the 6th Annual Hawaii International Conference on Statistics, Mathematics and Related Fields, Honolulu, Hawaii, pp. 1124–1139 (2007)
Steinbach, B., Posthoff, Ch.: Evaluation and optimization of unate covering algorithms. In: EUROCAST 2015, pp. 195–196. IUCTC Universidad de Las Palmas, Grand Canaries (2015)
Steinbach, B., Posthoff, C.: Fast calculation of exact minimal unate coverings on both the CPU and the GPU. In: Moreno-Díaz, R., Pichler, F., Quesada-Arencibia, A. (eds.) EUROCAST 2013. LNCS, vol. 8112, pp. 234–241. Springer, Heidelberg (2013)
Steinbach, B., Posthoff, C.: Improvements of the construction of exact minimal covers of Boolean functions. In: Moreno-Díaz, R., Pichler, F., Quesada-Arencibia, A. (eds.) EUROCAST 2011, Part II. LNCS, vol. 6928, pp. 272–279. Springer, Heidelberg (2012)
Steinbach, B., Posthoff, C.: Parallel solution of covering problems super-linear speedup on a small set of cores. GSTF Int. J. Comput. Singap. 1(2), 113–122 (2011). Global Science and Technology Forum (GSTF), Singapore
Acknowledgment
We thank Grzegorz Borowik for providing us his executable program that solves the UCP using the algorithm presented in [1].
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Steinbach, B., Posthoff, C. (2015). Evaluation and Optimization of GPU Based Unate Covering Algorithms. In: Moreno-Díaz, R., Pichler, F., Quesada-Arencibia, A. (eds) Computer Aided Systems Theory – EUROCAST 2015. EUROCAST 2015. Lecture Notes in Computer Science(), vol 9520. Springer, Cham. https://doi.org/10.1007/978-3-319-27340-2_76
Download citation
DOI: https://doi.org/10.1007/978-3-319-27340-2_76
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-27339-6
Online ISBN: 978-3-319-27340-2
eBook Packages: Computer ScienceComputer Science (R0)