ИСТИНА

There are countless ways to define an algorithm structure, which mostly follow either organization by flow of data, by executed tasks or by data decomposition. So-called information graph provides a combination of these patterns. A possibility to investigate the information graph of a particular algorithm visually is thereby a great tool that helps in understanding the algorithm itself, determining it’s resource of parallelism and figuring out how to better code it for parallel computing systems. In this paper, we present our approach on the information graphs visualization system, where online availability and low computational cost stand for primary goals.