Nikita I. Volkov

Bio: Nikita I. Volkov is an academic researcher from Moscow State University. The author has contributed to research in topics: Visualization & Graph drawing. The author has an hindex of 2, co-authored 3 publications receiving 10 citations.

An AlgoView Web-visualization System for the AlgoWiki Project

Abstract: There are countless ways to define an algorithm structure, which are mostly organized by flow of data, by executed tasks or by data decomposition The so-called information graph provides a combination of these patterns A possibility to investigate visually the information graph of a particular algorithm is, therefore, an adequate tool that helps to understand the algorithm itself, determining its resource of parallelism and figuring out how to code it better for parallel computing systems In this paper, we present our approach to the information graphs visualization system, where online availability and low computational cost are the primary goals

Interactive 3D Representation as a Method of Investigating Information Graph Features

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.

Information Graph Visualization Using AlgoView Software Tool

Abstract: One of the approaches to the study of the information structure of algorithms is the analysis of information graphs. These are complex objects, the understanding of the structure of which can significantly facilitate their visualization. However, it is difficult to visualize large graphs, while maintaining clarity of the information structure of the algorithm is generally very difficult. Therefore, we are developing a tool for three-dimensional interactive visualization of information graphs called AlgoView, designed to facilitate this task. At the moment, AlgoView is embedded as a visualizer on separate pages of the AlgoWiki Open encyclopedia of parallel algorithmic features, and in the near future it is planned to obtain a stand-alone version of this system.

Algo500—A New Approach to the Joint Analysis of Algorithms and Computers

Abstract: The described project is aimed at a complete solution to the problem of joint analysis of the properties of algorithms and features with the architecture of computing systems. This problem arose in the mid-70s of the last century, and over time, its importance in the practice of using computer systems is constantly growing. The main reason is a significant complication of the architecture of computers, which determines a strong dependence of the efficiency of their work on the properties of algorithms and programs. Exactly this dependence leads in practice to a huge gap between real and peak performance indicators, which is typical for all classes of computers from mobile devices to supercomputers of the highest performance range. It is this dependence that leads to a decrease in the quality of work of supercomputer centers and a drop in the efficiency of computer systems below a fraction of a percent. And at the same time, the fundamental nature of the problem itself determines two important facts. First, it is characteristic of all computer systems and centers of the world without exception. Second, practically all scientific groups of the world in all science areas conducting research using high-performance computing systems face this problem.

Interactive 3D Representation as a Method of Investigating Information Graph Features

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.

Information Graph Visualization Using AlgoView Software Tool

Abstract: One of the approaches to the study of the information structure of algorithms is the analysis of information graphs. These are complex objects, the understanding of the structure of which can significantly facilitate their visualization. However, it is difficult to visualize large graphs, while maintaining clarity of the information structure of the algorithm is generally very difficult. Therefore, we are developing a tool for three-dimensional interactive visualization of information graphs called AlgoView, designed to facilitate this task. At the moment, AlgoView is embedded as a visualizer on separate pages of the AlgoWiki Open encyclopedia of parallel algorithmic features, and in the near future it is planned to obtain a stand-alone version of this system.

The Algorithms Properties and Structure Study as a Mandatory Element of Modern IT Education

Abstract: The paper describes the system of mass practical assignments formed in the framework of the course “Supercomputing Simulation and Technologies” at the Faculty of Computational Mathematics and Cybernetics at Lomonosov Moscow State University. The practical assignments were held for four years, from 2016 to 2019, and each year about 200 students of the second year of the magistracy passed through them. These practical assignments are aimed at developing skills in the efficient use of parallel computing systems and knowledge of properties of parallel algorithms. The basics of performing the described assignments is the deep analysis of parallel algorithms and use of the concept of the information structure of algorithms and programs. This concept is extremely important for writing efficient parallel programs, so it should be the cornerstone of modern IT education.