SOME ASPECTS OF TOPOLOGICAL MODELING AND ANALYSIS OF FAILURE TOLERANCE OF NETWORK STRUCTURES
Keywords:
networks, topology, high-performance computer system, fault tolerance, transition popularityAbstract
The article considers the methodological and algorithmic aspects and features of the implementation of software tools for the analysis of topologies of network structures, aimed at building high-performance and fault-tolerant computer systems.
References
Yuefan Deng. Applied Parallel Computing. World Scientific, 2013 - 207 p., ISBN9814307602, 9789814307604.
Top500 – [Electronic resource] – Access mode: https://top500.org/lists/top500/2024/06/ – Access date: May 2025.
Frontier’s Architecture. OAK RIDGE National Laboratory – [Electronic resource] – Access mode: https://olcf.ornl.gov/wp-content/uploads/Frontiers-Architecture-Frontier-Training-Series-final.pdf – Access date: June 2024.
Bhatele, N. Jain, Y. Livnat, V. Pascucci, and P. T. Bremer, “Analyzing network health and congestion in dragonfly-based supercomputers,” in 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp. 93–102.
Loutskii H., Volokyta A., et al. Increasing the fault tolerance of distributed systems for the Hyper de Bruijn topology with excess code. 2019 IEEE International Conference on Advanced Trends in Information Theory : proceedings. Kyiv, Ukraine, 18–20 December 2019 / IEEE. 2019. P. 1–6. DOI:10.1109/ATIT49449.2019.9030487.
Lee algorithm – Wikipedia [Electronic resource] – Access mode: https://en.wikipedia.org/wiki/Lee_algorithm – Access date: May 2025.
Dijkstra's algorithm – Wikipedia [Electronic resource] – Access mode: https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm – Access date: May 2025.
Betweenness centrality – Wikipedia [Electronic resource] – Access mode: https://en.wikipedia.org/wiki/Betweenness_centrality – Access date: May 2025.
