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 …

Develo** efficient graph algorithms implementations is an extremely important problem of
modern computer science, since graphs are frequently used in various real-world …

The main goal of this paper is to demonstrate that the newest generation of NEC SX-Aurora
TSUBASA architecture can perform large-scale graph processing extremely efficiently. This …

This paper describes a modification of the algorithm classification, which forms the basis of
the AlgoWiki Open encyclopedia of parallel algorithmic features. The previously existing …

Develo** efficient graph algorithm implementations is a significant important problem of
modern computer science since graphs are frequently used in various real-world …

Abstract The lower–upper Symmetric-Gauss–Seidel (LU-SGS) method is one of typical
implicit methods, especially for an application that requires high convergence and accuracy …

Modern vector architectures are tend to be equipped with high-bandwidth memory, what
makes them an interesting candidate for solving large-scale graph processing problems …

Efficiency is a major weakness in modern supercomputers. Low efficiency of user
applications is one of the main reasons for that. There are many software tools for analyzing …

Abstract Breadth-First Search (BFS) is an important computational kernel used as a building-
block for many other graph algorithms. Different algorithms and implementation approaches …

This paper describes the world-first attempt to develop distributed graph algorithm
implementations, aimed for modern NEC SX-Aurora TSUBASA vector systems. Such …