Information Graph Visualization Using AlgoView Software Tool
- PDF / 1,243,464 Bytes
- 8 Pages / 612 x 792 pts (letter) Page_size
- 35 Downloads / 222 Views
Information Graph Visualization Using AlgoView Software Tool A. S. Antonov1* and N. I. Volkov1, 2** (Submitted by E. E. Tyrtyshnikov) 1
Research Computing Center, Moscow State University, Moscow, 119991 Russia 2 “TESIS” Company, Moscow, 127083 Russia Received March 31, 2020; revised April 4, 2020; accepted April 15, 2020
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. DOI: 10.1134/S199508022008003X Keywords and phrases: information graph, parallel structure, visualization, level parallel form, AlgoView, AlgoWiki.
1. INTRODUCTION 1.1. Information Graphs Algorithmic parallelism has been an essential feature of high performance computing for decades. Thus, the search for potential parallelism on all possible levels and the choice of an optimal way to parallelize the algorithm are the key milestones one faces when writing an application for highperformance computing system. The answer to these questions depends on, firstly, the algorithm structure and, secondly, on the high-performance system architecture. Even though nowadays we don’t write applications for particular systems, cases of applications that make use of specific hardware architecture families are still common. Meanwhile hardware architecture specifications are normally publically available and thus well-known to developers, specifications for newly developed applications simply do not exist and have to be built from scratch. Algorithm analysis provides a basic framework for coming up with these specifications including key features such as an algorithm’s source of parallelism. A number of classical studies are devoted to methods for analyzing cyclic constructions and iteration spaces, for example, in [1–4]. Currently, several research groups are moving along the path of studying typical algorithmic structures (for example, [5]). But most of these methods have only limited applicability and do not describe the full potential of parallelism of the studied fragment of the program. To get rid of these shortcomings, approaches are used that focus on the use of a concept of an algorithm’s information graph [6]. Information graph of an algorithm is a Directional Acyclic Graph (DAG) [7, 8] that represents the internal structure of the given algorithm. Its vertices correspond to operations within the algorithm and edges correspond to data dependencies betw
Data Loading...
