Skip to main content

A Parallel CPU/GPU Bees Swarm Optimization Algorithm for the Satisfiability Problem

  • Conference paper
  • First Online:
Trends and Innovations in Information Systems and Technologies (WorldCIST 2020)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 1160))

Included in the following conference series:

Abstract

Metaheuristics and especially Swarm Intelligence represents one of the mostly used aspect of Artificial Intelligence. In fact, these algorithms are exploited in several domains from theoretical problem solving to air traffic management. The evaluation of such methods is defined by the quality of solution they provide or effectiveness and the spent time to reach this solution or efficiency.

We explore, in this paper, the technology offered by the Graphic Processing Unit -GPU- to improve the efficiency of the Bees Swarm Optimization algorithm -BSO- by proposing a novel and parallel CPU/GPU version of the later algorithm. The algorithm being greedy when the problem size is important, which is almost always the case.

The proposed parallel algorithm is integrated in the proposed method of clustering-solving hard problems presented in [1], adding the exploitation of GPU performance to that of data mining to improve the resolution of hard and complex problems such as Satisfiability problem.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Hireche, C., Drias, H.: Density based clustering for satisfiability solving. In: World Conference on Information Systems and Technologies, pp. 899-908. Springer, Heidelberg (2018)

    Google Scholar 

  2. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide of the Theory of NP-Completeness. A Series of Books in the Mathematical Sciences, p. x+338. W.H. Freeman and Co., New York (1979). ISBN 0-7167-1045-5. MR 519066

    MATH  Google Scholar 

  3. Cook, S.: The complexity of theorem-proving procedures. In: Proceeding 3rd Annual ACM Symposium on the Theory of Computing, New York, pp. 151-198 (1971)

    Google Scholar 

  4. Glover, F., Kochenberger, G.A.: Handbook of Metaheuristics. Springer, US (2005). ISBN: 978-1-4020-7263-5. https://doi.org/10.1007/b101874.

  5. Drias, H., Sadeg, S., Yahi, S.: Cooperatives bees swarm for solving the maximum weighted satisfiability problem. In: Proceeding of IWANN 2005, LNCS, vol. 3512, pp. 318-325. Springer, Barcelona (2005)

    Google Scholar 

  6. Seeley, T.D., Camazine, S., Sneyd, J.: Collective decision-making in honey bees: how colonies choose among nectar sources. Behav. Ecol. Sociobiol. 28, 277–290 (1991)

    Article  Google Scholar 

  7. NVIDIA CUDA C programming guide version 4.0. Nvidia Corporation (2012)

    Google Scholar 

  8. Kirk, D.B., Wen-Mei, W.H.: Programming Massively Parallel Processors: A Hands-on Approach. Morgan Kaufmann, Burlington (2016)

    Google Scholar 

  9. Han, J., et al.: Data mining, concepts and techniques. Third Edition (The Morgan Kaufmann Series in Data Management Systems) (2011)

    Google Scholar 

  10. Davis, M., Logemann, G., Loveland, D.: A machine program for theorem proving. Commun. ACM 5(7), 394–397 (1962)

    Article  MathSciNet  Google Scholar 

  11. Biere, A., Cimatti, A., Clarke, E., Zhu, Y.: Symbolic model checking without BDDs. In: The Proceedings of the Workshop on Tools and Algorithms for the Construction and Analysis of Systems (TACAS99), LNCS. Springer, Heidelberg (1999)

    Google Scholar 

  12. BMC. http://www.satcompetition.org/2013/downloads.shtml

  13. Artificially Generated Random. https://baldur.iti.kit.edu/sat-competition-2016/index.php?cat=benchmarks

  14. Random SAT. https://baldur.iti.kit.edu/sat-competition-2016/index.php?cat=benchmarks

  15. Hireche, C., Drias, H.: Multidimensional appropriate clustering and DBSCAN for SAT solving . Data Technol. Appl. J. (2019). Emerald Publishing Limited

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Celia Hireche .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Hireche, C., Drias, H. (2020). A Parallel CPU/GPU Bees Swarm Optimization Algorithm for the Satisfiability Problem. In: Rocha, Á., Adeli, H., Reis, L., Costanzo, S., Orovic, I., Moreira, F. (eds) Trends and Innovations in Information Systems and Technologies. WorldCIST 2020. Advances in Intelligent Systems and Computing, vol 1160. Springer, Cham. https://doi.org/10.1007/978-3-030-45691-7_53

Download citation

Publish with us

Policies and ethics