Abstract
Parallel versions of a genetic algorithm based on the hybrid MPI—OpenMP model are implemented to optimize circulant networks, which are of practical interest in the design of supercomputer systems and systems on a chip. An analysis of the efficiency of parallel programs with different numbers of MPI processes and OpenMP threads on a cluster of Kunpeng processors has been carried out. The speed-up of several hybrid parallel computing schemes was experimentally evaluated and analyzed. Two bottlenecks in terms of efficiency in parallel execution of the algorithm are identified and methods for their solution are proposed. By means of the parallel genetic algorithm the descriptions of circulant networks with better average distance and bisection width for the known large circulant networks were obtained.
REFERENCES
F. K. Hwang, ‘‘A survey on multi-loop networks,’’ Theor. Comput. Sci. 299, 107–121 (2003).
E. Monakhova, ‘‘A survey on undirected circulant graphs,’’ Discrete Mathematics, Algorithms Appl. 4, 1250002 (2012).
M. A. Fiol, ‘‘On congruence in Zn and the dimension of a multidimensional circulant,’’ Discrete Math. 141, 123–134 (1995).
E. Monakhova, A. Romanov, and E. Lezhnev, ‘‘Shortest path search algorithm in optimal two-dimensional circulant networks: Implementation for networks-on-chip,’’ IEEE Access 8, 215010–215019 (2020).
X. Huang, A. F. Ramos, and Y. Deng, ‘‘Optimal circulant graphs as low-latency network topologies,’’ J. Supercomput. 78, 13491–13510 (2022). https://doi.org/10.1007/s11227-022-04396-5
O. Monakhov, E. Monakhova, A. Romanov, A. Sukhov, and E. Lezhnev, ‘‘Adaptive shortest path search algorithm in optimal two-dimensional circulant networks: Implementation for networks-on-chip,’’ IEEE Access 9, 160836–160846 (2021).
D. Bevan, G. Erskine, and R. Lewis, ‘‘Large circulant graphs of fixed diameter and arbitrary degree,’’ Ars Math. Contemp. 13, 275–291 (2017).
E. Monakhova and O. Monakhov, ‘‘Searching for large circulant graphs using a parallel genetic algorithm,’’ Discret. Anal. Operations Research 22 (6), 29–39 (2015).
R. Lewis, ‘‘The degree-diameter problem for circulant graphs of degree 8 and 9,’’ Electron. J. Combin. 21 (4), P4.50 (2014).
R. Lewis, ‘‘The degree-diameter problem for circulant graphs of degrees 10 and 11,’’ Discrete Math. 341, 2553–2566 (2018).
Y. Deng, M. Guo, A. F. Ramos, et al., ‘‘Optimal low-latency network topologies for cluster performance enhancement,’’ J. Supercomput. 76, 9558–9584 (2020). https://doi.org/10.1007/s11227-020-03216-y
O. Monakhov and E. Monakhova, ‘‘A comparative analysis of bioinspired algorithms for solving the problem of optimization of circulant and hypercirculant networks,’’ in Proceedings of the 15th International Asian School-Seminar Optimization Problems of Complex Systems OPCS 2019 (IEEE, 2019), pp. 100–103. https://doi.org/10.1109/OPCS.2019.8880247
R. Feria-Puron, J. Ryan, and H. Perez-Roses, ‘‘Searching for large multi-loop networks,’’ Electron. Notes Disc. Math. 46, 233–240 (2014).
O. Monakhov and E. Monakhova, ‘‘Parallel genetic algorithm for synthesis of optimal circulant networks on Kunpeng processors,’’ in Proceedings of the 2022 IEEE International Multi-Conference on Engineering, Computer and Information Sciences SIBIRCON OPCS 2022, Novosibirsk, Russia (2022), pp. 950–953. https://doi.org/10.1109/SIBIRCON56155.2022.10017065
R. Rabenseifner, G. Hager, G. Jost, and R. Keller, ‘‘Hybrid MPI and OpenMP parallel programming,’’ in Recent Advances in Parallel Virtual Machine and Message Passing Interface, EuroPVM/MPI 2006, Lect. Notes Comput. Sci. 4192 (2006). https://doi.org/10.1007/11846802_10
D. A. Mallon et al., ‘‘Performance evaluation of MPI, UPC and OpenMP on multicore architectures,’’ in Recent Advances in Parallel Virtual Machine and Message Passing Interface EuroPVM/MPI 2009, Lect. Notes Comput. Sci. 5759, 174–184 (2009). https://doi.org/10.1007/978-3-642-03770-2_24
G. Hager and G. Wellein, Introduction to High Performance Computing for Scientists and Engineers (Chapman and Hall/CRC Press, Boca Raton, FL, 2011).
A. Pirova, ‘‘Hybrid MPI + OpenMP algorithm for symmetric spare matrix reordering and its application to the solving systems of linear equations,’’ Probl. Inform., No. 1, 28–41 (2022).
K. Sabelfeld and A. Kireeva, ‘‘Supercomputer simulation of cathodoluminescence transients in the vicinity of threading dislocations,’’ in Proceedings of the PCT 2018 and International Conference on Cloud Computing and Intelligence Systems CCIS, Ed. by L. Sokolinsky and M. Zymbler (2018), Vol. 910, pp. 280–293. https://doi.org/10.1007/978-3-319-99673-8_20
E. Cantu-Paz, Efficient and Accurate Parallel Genetic Algorithms (Springer, New York, NY, 2001).
A. P. Karpenko, Modern Algorithms of Search Engine Optimization (MGTU Baumana, Moscow, 2014) [in Russian].
G. Luque and E. Alba, Parallel Genetic Algorithms: Theory and Real-World Applications (Springer, Berlin, 2011).
V. Skorpil and V. Oujezsky, ‘‘Parallel genetic algorithms implementation using a scalable concurrent operation in Python,’’ Sensors 22, 2389-1–19 (2022).
D. S. Knysh and V. M. Kureichik, ‘‘Parallel genetic algorithms: a survey and problem state of the art,’’ J. Comput. Syst. Sci. Int. 49, 579–589 (2010).
Genetic Algorithms in Applications, Ed. by R. Popa (IntechOpen, Rijeka, Croatia, 2012).
S. Loosemore, The GNU C Library Reference Manual (Free Software Foundation, 2007).
B. Qiong-Fang, H. Ting-ting, L. Hui, and F. Mu-yun, ‘‘Research on the diameter and average diameter of undirected double-loop networks,’’ in Proceedings of the 9th International Conference on Grid and Cloud Computing (IEEE, 2010), pp. 461–466.
Funding
Supported by state assignment of ICMMG SB RAS no. 0251-2022-0005.
Author information
Authors and Affiliations
Corresponding authors
Additional information
(Submitted by V. V. Voevodin )
Rights and permissions
About this article
Cite this article
Monakhov, O.G., Monakhova, E.A. & Kireev, S.E. Parallel Optimization and Performance Tuning on a Kunpeng Cluster of Genetic Algorithm for Synthesis of Circulant Networks. Lobachevskii J Math 44, 3130–3139 (2023). https://doi.org/10.1134/S1995080223080425
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1995080223080425