Hybrid CPU-GPU Simulation of Hierarchical Adaptive Random Boolean Networks

  • Kirill Kuvshinov
  • Klavdiya Bochenina
  • Piotr J. Górski
  • Janusz A. Hołyst
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10659)


Random boolean networks (RBNs) as models of gene regulatory networks are widely studied by the means of computer simulation to explore interconnections between their topology, regimes of functioning and patterns of information processing. Direct simulation of random boolean networks is known to be computationally hard because of the exponential growth of attractor lengths with an increase of a network size. In this paper, we propose hybrid CPU-GPU algorithm for parallel simulation of hierarchical adaptive RBNs. The rules of evolution of this type of RBN makes it possible to parallelize calculations both for different subnetworks and for different nodes while updating their states. In the experimental part of the study, we explore the efficiency of OpenMP and CPU-GPU algorithms for different sizes of networks and configurations of hierarchy. The results show that a hybrid algorithm performs better for a smaller number of subnetworks while OpenMP version may be preferable for a limited number of nodes in each subnetwork.



This research is financially supported by The Russian Science Foundation, Agreement 17-71-30029 with co-financing of Bank Saint Petersburg.


  1. 1.
    Kauffman, S.A.: Metabolic stability and epigenesis in randomly constructed genetic nets. J. Theor. Biol. 22(3), 437–467 (1969)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Kauffman, S.A.: The ensemble approach to understand genetic regulatory networks. Physica A 340(4), 733–740 (2004)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Gershenson, C.: Introduction to random Boolean networks. In: Workshop and Tutorial Proceedings, Ninth International Conference on the Simulation and Synthesis of Living Systems (ALife IX), pp. 160–173 (2004)Google Scholar
  4. 4.
    Drossel, B.: Random Boolean networks. Rev. Nonlinear Dyn. Complex. 1, 69–110 (2008)CrossRefzbMATHGoogle Scholar
  5. 5.
    Cheng, D., Qi, H., Li, Z.: Random Boolean networks. In: Cheng, D., Qi, H., Li, Z. (eds.) Analysis and Control of Boolean Networks: A Semi-tensor Product Approach. Communications and Control Engineering, pp. 431–450. Springer, London (2011). CrossRefGoogle Scholar
  6. 6.
    Aldana, M., Coppersmith, S., Kadanoff, L.P.: Boolean dynamics with random couplings. In: Kaplan, E., Marsden, J.E., Sreenivasan, K.R. (eds.) Perspectives and Problems in Nolinear Science, pp. 23–89. Springer, New York (2003). CrossRefGoogle Scholar
  7. 7.
    Derrida, B., Pomeau, Y.: Random networks of automata: a simple annealed approximation. Europhys. Lett. (EPL) 1(2), 45–49 (1986)CrossRefGoogle Scholar
  8. 8.
    Liu, M., Bassler, K.E.: Emergent criticality from coevolution in random Boolean networks. Phys. Rev. E 74(4), 041910 (2006)CrossRefGoogle Scholar
  9. 9.
    Lane, D.: Hierarchy, complexity, society. In: Pumain, D. (ed.) Hierarchy in Natural and Social Sciences. Methodos Series, vol. 3, pp. 81–119. Springer, Dordrecht (2006). CrossRefGoogle Scholar
  10. 10.
    Górski, P.J., Czaplicka, A., Hołyst, J.A.: Coevolution of information processing and topology in hierarchical adaptive random boolean networks. Eur. Phys. J. B 89(2), 1–9 (2016)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Bornholdt, S., Sneppen, K.: Neutral mutations and punctuated equilibrium in evolving genetic networks. Phys. Rev. Lett. 81(1), 236 (1998)CrossRefGoogle Scholar
  12. 12.
    Rohlf, T., Bornholdt, S.: Self-organized criticality and adaptation in discrete dynamical networks. In: Gross, T., Sayama, H. (eds.) Adaptive Networks. Understanding Complex Systems, pp. 73–106. Springer, Heidelberg (2009). CrossRefGoogle Scholar
  13. 13.
    Haruna, T., Tanaka, S.: On the relationship between local rewiring rules and stationary out-degree distributions in adaptive random Boolean network models. In: ALIFE 14: The Fourteenth Conference on the Synthesis and Simulation of Living Systems, vol. 14, pp. 420–426. Citeseer (2014)Google Scholar
  14. 14.
    Paczuski, M., Bassler, K.E., Corral, Á.: Self-organized networks of competing Boolean agents. Phys. Rev. Lett. 84(14), 3185 (2000)CrossRefGoogle Scholar
  15. 15.
    Bastolla, U., Parisi, G.: The modular structure of Kauffman networks. Phys. D: Nonlinear Phenom. 115(3–4), 219–233 (1998)CrossRefzbMATHGoogle Scholar
  16. 16.
    Poblanno-Balp, R., Gershenson, C.: Modular random Boolean networks. Artif. Life 17(4), 331–351 (2011)CrossRefGoogle Scholar
  17. 17.
    Pomerance, A., Ott, E., Girvan, M., Losert, W.: The effect of network topology on the stability of discrete state models of genetic control. Proc. Nat. Acad. Sci. 106(20), 8209–8214 (2009)CrossRefGoogle Scholar
  18. 18.
    Pechenick, D.A., Payne, J.L., Moore, J.H.: The influence of assortativity on the robustness of signal-integration logic in gene regulatory networks. J. Theor. Biol. 296, 21–32 (2012)CrossRefGoogle Scholar
  19. 19.
    Hawick, K.A., James, H.A., Scogings, C.J.: Simulating large random Boolean networks (2007)Google Scholar
  20. 20.
    Bhattacharjya, A., Liang, S.: Power-law distributions in some random Boolean networks. Phys. Rev. Lett. 77(8), 1644 (1996)CrossRefGoogle Scholar
  21. 21.
    Garg, A., Xenarios, I., Mendoza, L., DeMicheli, G.: An efficient method for dynamic analysis of gene regulatory networks and in silico gene perturbation experiments. In: Speed, T., Huang, H. (eds.) RECOMB 2007. LNCS, vol. 4453, pp. 62–76. Springer, Heidelberg (2007). CrossRefGoogle Scholar
  22. 22.
    Zhao, Y., Kim, J., Filippone, M.: Aggregation algorithm towards large-scale Boolean network analysis. IEEE Trans. Autom. Control 58(8), 1976–1985 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  23. 23.
    Zheng, D., Yang, G., Li, X., Wang, Z., Liu, F., He, L.: An efficient algorithm for computing attractors of synchronous and asynchronous Boolean networks. PLoS one 8(4), e60593 (2013)CrossRefGoogle Scholar
  24. 24.
    Guo, W., Yang, G., Wei, W., He, L., Sun, M.: A parallel attractor finding algorithm based on Boolean satisfiability for genetic regulatory networks. PLoS one 9(4), e94258 (2014)CrossRefGoogle Scholar
  25. 25.
    Kuvshinov, K., Bochenina, K., Górski, P.J., Hołyst, J.A.: Parallel simulation of adaptive random Boolean networks. Procedia Comput. Sci. 101, 35–44 (2016)CrossRefGoogle Scholar
  26. 26.
    Knuth, D.E.: The Art of Computer Programming: Seminumerical Methods, vol. 2. Addison-wesley, Boston (1981)zbMATHGoogle Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  • Kirill Kuvshinov
    • 1
  • Klavdiya Bochenina
    • 1
  • Piotr J. Górski
    • 2
  • Janusz A. Hołyst
    • 1
    • 2
  1. 1.ITMO UniversitySaint PetersburgRussia
  2. 2.Faculty of PhysicsWarsaw University of TechnologyWarsawPoland

Personalised recommendations