An Open-Source Cloud-FPGA Gene Regulatory Accelerator

  • Lucas Bragança UFV
  • Jeronimo Penha UFV
  • Michael Canesche UFMG
  • Dener Ribeiro UFV
  • José Augusto M. Nacif UFV
  • Ricardo Ferreira UFV


FPGAs are suitable to speed up gene regulatory network (GRN) algorithms with high throughput and energy efficiency. In addition, virtualizing FPGA using hardware generators and cloud resources increases the computing ability to achieve on-demand accelerations across multiple users. Recently, Amazon AWS provides high-performance Cloud's FPGAs. This work proposes an open source accelerator generator for Boolean gene regulatory networks. The generator automatically creates all hardware and software pieces from a high-level GRN description. We evaluate the accelerator performance and cost for CPU, GPU, and Cloud FPGA implementations by considering six GRN models proposed in the literature. As a result, the FPGA accelerator is at least 12x faster than the best GPU accelerator. Furthermore, the FPGA reaches the best performance per dollar in cloud services, at least 5x better than the best GPU accelerator.


Akutsu, T., Kuhara, S., Maruyama, O., and Miyano, S. (1998). A system for identifying genetic networks from gene expression patterns produced by gene disruptions and overexpressions. Genome Informatics, 9:151–160.

Bhattacharjya, A. and Liang, S. (1996). Median attractor and transients in random boolean nets. Physica D: Nonlinear Phenomena, 95(1):29–34.

Borelli, F. F. and et al (2013). Gene regulatory networks inference using a multi-gpu exhaustive search algorithm. BMC bioinformatics, 14(18):1–12.

Braganca, L. and et al (2021). An open source custom k-means generator for aws cloud fpga accelerators. In Brazilian Symp on Computing Systems Engineering (SBESC).

Bragança, L. and et al (2017). Exploring the dynamics of large-scale gene regulatory networks using hardware acceleration on a heterogeneous cpu-fpga platform. In IEEE International Conference on ReConFigurable Computing and FPGAs (ReConFig).

Chaos, A. and et al (2006). From genes to flower patterns and evolution: dynamic models of gene regulatory networks. Journal of Plant Growth Regulation, 25(4):278–289.

Conroy, B. and et al (2014). Design, assessment, and in vivo evaluation of a computational model illustrating the role of cav1 in cd4+ t-lymphocytes. Frontiers in immunology, 5.

Dubrova, E. and Teslenko, M. (2011). A sat-based algorithm for finding attractors in synchronous boolean networks. IEEE Trans. on Comp. Biology and Bioinformatics.

Ferreira, R. and Vendramini, J. (2010). Fpga-accelerated attractor computation of scale free gene regulatory networks. In Field Programmable Logic and Applications (FPL).

Garg, A. and et al (2007). An efficient method for dynamic analysis of gene regulatory In Int Conf on Research in networks and in silico gene perturbation experiments. Computational Molecular Biology.

Guo, W., Yang, G., Wu, W., and Sun, M. (2014). A parallel attractor finding algorithm based on boolean satisfiability for genetic regulatory networks. PloS one, 9(4).

Hashemipour, S. and Ali, M. (2020). Amazon web services (aws)–an overview of the on-demand cloud computing platform. In Int Conf for Emerging Technologies in Computing. Springer.

Helikar, T., Kochi, N., Kowal, B., Dimri, M., Raja, S. M., Band, V., Band, H., and Rogers, J. A. (2013). A comprehensive, multi-scale dynamical model of erbb receptor signal transduction in human mammary epithelial cells. PLoS One, 8(4):e61757.

Irons, D. J. (2006). Improving the efficiency of attractor cycle identification in boolean networks. Physica D: Nonlinear Phenomena, 217(1):7–21.

Lu, J. and et al (2015). Network modelling reveals the mechanism underlying colitis-associated colon cancer and identifies novel combinatorial anti-cancer targets. Scientific reports, 5(1):1–15.

Manica, M., Polig, R., Purandare, M., Mathis, R., Hagleitner, C., and Martinez, M. R. (2020). Fpga accelerated analysis of boolean gene regulatory networks. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 17(6):2141–2147.

Miskov-Zivanov, N. and et al (2011). Emulation of biological networks in reconfigurable hardware. In ACM Conference on Bioinformatics, Computational Biology and Biomedicine, pages 536–540.

Mizera, A., Pang, J., and Yuan, Q. (2019). Gpu-accelerated steady-state computation of large probabilistic boolean networks. Formal Aspects of Computing, 31(1):27–46.

Müssel, C., Hopfensitz, M., and Kestler, H. A. (2010). Boolnet—an r package for generation, reconstruction and analysis of boolean networks. Bioinformatics, 26(10).

Penha, J., Braganca, L., Nacif, J., and Ferreira, R. (2019). Add: Accelerator design and deploy-a tool for fpga high-performance dataflow computing. Concurrency and Computation: Practice and Experience, 31(18):e5096.

Raza, S. and et al (2008). A logic-based diagram of signalling pathways central to macrophage activation. BMC systems biology, 2(1):36.

Samaga, R. and et al (2009). The logic of egfr/erbb signaling: theoretical properties and analysis of high-throughput data. PLoS computational biology, 5(8):e1000438.

Takamaeda-Yamazaki, S. (2015). Pyverilog: A python-based hardware design processing toolkit for verilog hdl. In Applied Reconfigurable Computing, volume 9040 of Lecture Notes in Computer Science, pages 451–460. Springer International Publishing.

Thakar, J., Pathak, A. K., Murphy, L., and Cattadori, I. M. (2012). Network model of immune responses reveals key effectors to single and co-infection dynamics by a respiratory bacterium and a gastrointestinal helminth. PLoS computational biology, 8(1).

Yuan, Q., Mizera, A., and Qu, H. (2019). A new decomposition-based method for detecting attractors in synchronous boolean networks. Science of Computer Programming.
BRAGANÇA, Lucas; PENHA, Jeronimo; CANESCHE, Michael; RIBEIRO, Dener; NACIF, José Augusto M.; FERREIRA, Ricardo. An Open-Source Cloud-FPGA Gene Regulatory Accelerator. In: SIMPÓSIO EM SISTEMAS COMPUTACIONAIS DE ALTO DESEMPENHO (SSCAD), 22. , 2021, Belo Horizonte. Anais [...]. Porto Alegre: Sociedade Brasileira de Computação, 2021 . p. 240-251. DOI: