Skip to main content

A Volunteer-Computing-Based Grid Architecture Incorporating Idle Resources of Computational Clusters

  • Conference paper
  • First Online:
Numerical Analysis and Its Applications (NAA 2016)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10187))

Included in the following conference series:


In this paper, we suggest a new architecture of a computational grid that involves resources of BOINC-based volunteer computing projects and idle resources of computational clusters. We constructed a computational grid of the proposed kind, based on several computational clusters and the volunteer computing project SAT@home. This project, launched and maintained by us, is aimed at solving hard computational problems, which can be effectively reduced to Boolean satisfiability problem. In the constructed grid several new combinatorial designs based on diagonal Latin squares of order 10 were found, and also several weakened cryptanalysis problems for the Bivium cipher were solved.

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

Access this chapter

USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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


  1. 1.


  1. Anderson, D.P., Fedak, G.: The computational and storage potential of volunteer computing. In: Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGrid 2006), Singapore, 16–19 May 2006, pp. 73–80. IEEE Computer Society (2006)

    Google Scholar 

  2. Biere, A., Heule, M.J.H., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications, vol. 185. IOS Press, Amsterdam (2009)

    Google Scholar 

  3. Brown, J., Cherry, F., Most, L., Parker, E., Wallis, W.: Completion of the spectrum of orthogonal diagonal latin squares. In: Lecture Notes in Pure and Applied Mathematics, vol. 139, pp. 43–49 (1992)

    Google Scholar 

  4. Cannière, C.: Trivium: a stream cipher construction inspired by block cipher design principles. In: Katsikas, S.K., López, J., Backes, M., Gritzalis, S., Preneel, B. (eds.) ISC 2006. LNCS, vol. 4176, pp. 171–186. Springer, Heidelberg (2006). doi:10.1007/11836810_13

    Chapter  Google Scholar 

  5. Colbourn, C.J., Dinitz, J.H.: The CRC Handbook of Combinatorial Designs. CRC Press, Inc., Boca Raton (1996)

    Book  MATH  Google Scholar 

  6. Eén, N., Sörensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502–518. Springer, Heidelberg (2004). doi:10.1007/978-3-540-24605-3_37

    Chapter  Google Scholar 

  7. Eibach, T., Pilz, E., Völkel, G.: Attacking bivium using SAT solvers. In: Kleine Büning, H., Zhao, X. (eds.) SAT 2008. LNCS, vol. 4996, pp. 63–76. Springer, Heidelberg (2008). doi:10.1007/978-3-540-79719-7_7

    Chapter  Google Scholar 

  8. Epema, D., Livny, M., van Dantzig, R., Evers, X., Pruyne, J.: A worldwide flock of condors: load sharing among workstation clusters. Future Gener. Comput. Syst. 12, 53–65 (1996)

    Article  Google Scholar 

  9. Evtushenko, Y., Posypkin, M., Sigal, I.: A framework for parallel large-scale global optimization. Comput. Sci. Res. Dev. 23(3), 211–215 (2009)

    Article  Google Scholar 

  10. Farkas, Z., Kacsuk, P., Balaton, Z., Gombás, G.: Interoperability of BOINC and EGEE. Future Gener. Comput. Syst. 26(8), 1092–1103 (2010)

    Article  Google Scholar 

  11. Foster, I.: Designing and Building Parallel Programs: Concepts and Tools for Parallel Software Engineering. Addison-Wesley Longman Publishing Co., Inc., Boston (1995)

    MATH  Google Scholar 

  12. Lynce, I., Ouaknine, J.: Sudoku as a SAT problem. In: International Symposium on Artificial Intelligence and Mathematics (ISAIM 2006), Fort Lauderdale, Florida, USA, 4–6 January 2006

    Google Scholar 

  13. Maximov, A., Biryukov, A.: Two trivial attacks on Trivium. In: Adams, C., Miri, A., Wiener, M. (eds.) SAC 2007. LNCS, vol. 4876, pp. 36–55. Springer, Heidelberg (2007). doi:10.1007/978-3-540-77360-3_3

    Chapter  Google Scholar 

  14. Semenov, A., Zaikin, O.: Algorithm for finding partitionings of hard variants of boolean satisfiability problem with application to inversion of some cryptographic functions. SpringerPlus 5(1), 1–16 (2016)

    Article  Google Scholar 

  15. Zaikin, O., Kochemazov, S.: The search for systems of diagonal Latin squares using the SAT@home project. In: Second International Conference BOINC-Based High Performance Computing: Fundamental Research and Development (BOINC: FAST 2015), Petrozavodsk, Russia, 14–18 September 2015, vol. 1502, pp. 52–63. CEUR-WS (2015)

    Google Scholar 

  16. Zaikin, O., Semenov, A., Otpuschennikov, I.: Solving weakened cryptanalysis problems for the Bivium cipher in the volunteer computing project SAT@home. In: Second International Conference BOINC-Based High Performance Computing: Fundamental Research and Development (BOINC: FAST 2015), Petrozavodsk, Russia, 14–18 September 2015, vol. 1502, pp. 22–30. CEUR-WS (2015)

    Google Scholar 

  17. Zaikin, O., Vatutin, E., Zhuravlev, A., Manzyuk, M.: Applying high-performance computing to searching for triples of partially orthogonal Latin squares of order 10. In: 10th Annual International Scientific Conference on Parallel Computing Technologies, Arkhangelsk, Russia, 29–31 March 2016, vol. 1576, pp. 155–166. CEUR-WS (2016)

    Google Scholar 

  18. Zhang, H.: Combinatorial Designs by SAT Solvers, pp. 533–568. In: Biere et al. [2], vol. 185, February 2009

    Google Scholar 

Download references


The research was funded by Russian Science Foundation (project no. 16-11-10046). We thank all SAT@home participants for their resources and fruitful feedback.

Author information

Authors and Affiliations


Corresponding author

Correspondence to Oleg Zaikin .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Zaikin, O., Manzyuk, M., Kochemazov, S., Bychkov, I., Semenov, A. (2017). A Volunteer-Computing-Based Grid Architecture Incorporating Idle Resources of Computational Clusters. In: Dimov, I., Faragó, I., Vulkov, L. (eds) Numerical Analysis and Its Applications. NAA 2016. Lecture Notes in Computer Science(), vol 10187. Springer, Cham.

Download citation

  • DOI:

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-57098-3

  • Online ISBN: 978-3-319-57099-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics