Abstract
An algorithm information graph is a structure of wide variety. It can tell a lot about algorithm features, such as computational complexity and resource of parallelism, as well as about sequential operations blocks within an algorithm. Graphs of different algorithms often share similar regular structures — their presence is an indicator of potentially similar algorithm behavior. Convenient, interactive 3D representation of an information graph is a decent method of researching it; it can demonstrate algorithm characteristics listed above and its structural features. In this article we investigate an approach to creating such representations, implement it using our AlgoView system and give examples of using a resulting tool.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Voevodin, V., Voevodin, Vl.: Parallel Computing. BHV-Petersburg, St. Petersburg (2002)
Hu, Y.I., Shi, L.: Visualizing large graphs. WIREs Comput. Stat. 7(2), 115–136 (2015). https://doi.org/10.1002/wics.1343
Gold, R.: Control flow graphs and code coverage. Appl. Math. Comput. Sci. 20(4), 739–749 (2010). https://doi.org/10.2478/v10006-010-0056-9
Voevodin, V., Antonov, A., Dongarra, J.: AlgoWiki: an open encyclopedia of parallel algorithmic features. Supercomput. Front. Innovations 2(1), 4–18 (2015). https://doi.org/10.14529/jsfi150101
Voevodin, V., Antonov, A., Dongarra, J.: Why is it hard to describe properties of algorithms? Procedia Comput. Sci. 101, 4–7 (2016). https://doi.org/10.1016/j.procs.2016.11.002
Open Encyclopedia of Parallel Algorithmic Features. http://algowiki-project.org/en. Accessed 13 Apr 2018
Antonov, A., Teplov, A.: Generalized approach to scalability analysis of parallel applications. In: Carretero, J. (ed.) ICA3PP 2016. LNCS, vol. 10049, pp. 291–304. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-49956-7_23
Antonov, A., Voevodin, V., Voevodin, Vl., Teplov, A.: A study of the dynamic characteristics of software implementation as an essential part for a universal description of algorithm properties. In: 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing Proceedings, pp. 359–363, 17–19 February 2016.https://doi.org/10.1109/PDP.2016.24
Antonov, A.S., Volkov, N.I.: An algoview web-visualization system for the AlgoWiki project. In: Sokolinsky, L., Zymbler, M. (eds.) PCT 2017. CCIS, vol. 753, pp. 3–13. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-67035-5_1
Householder (reflections) method for the QR decomposition of a square matrix, real point-wise version. http://algowiki-project.org/en/Householder_(reflections)_method_for_the_QR_decomposition_of_a_ square_matrix,_real_point-wise_version. Accessed 13 Apr 2018
Givens method. http://algowiki-project.org/en/Givens_method. Accessed 13 Apr 2018
Dense matrix multiplication (serial version for real matrices). http://algowiki-project.org/en/Dense_matrix_multiplication_(serial_version_for_real_matrices). Accessed 13 Apr 2018
Acknowledgements
The results described in Sects. 1, 2 and 4 were obtained in Lomonosov Moscow State University with the financial support of the Russian Science Foundation (Agreement № 14–11–00190). The research is carried out using the equipment of the shared research facilities of HPC computing resources at Lomonosov Moscow State University supported by the project RFMEFI62117X0011.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Antonov, A., Volkov, N. (2019). Interactive 3D Representation as a Method of Investigating Information Graph Features. In: Voevodin, V., Sobolev, S. (eds) Supercomputing. RuSCDays 2018. Communications in Computer and Information Science, vol 965. Springer, Cham. https://doi.org/10.1007/978-3-030-05807-4_50
Download citation
DOI: https://doi.org/10.1007/978-3-030-05807-4_50
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-05806-7
Online ISBN: 978-3-030-05807-4
eBook Packages: Computer ScienceComputer Science (R0)