Развиваются методы ускорения сходимости итерационного процесса, основанные на
использовании геометрических и алгебраических многосеточных технологий …

This chapter faces the All-Pair Shortest-Path problem for sparse graphs combining parallel
algorithms and parallel-productivity methods in heterogeneous systems. As this problem can …

The All-Pair Shortest-Path (APSP) problem is a well-known problem in graph theory whose
objective is to find the shortest paths between any pair of nodes. Computing the distances …

In the field of computational biology, sequence alignment is a very important methodology.
BLAST is a very common tool for performing sequence alignment in bioinformatics provided …

This paper reports the adaptation of the Multidimensional Multiscale Parser (MMP) algorithm
to CUDA. Specifically, we focus on memory optimization issues, such as the layout of data …

Nowadays there is a growing need for efficient modelling and simulation software, given the
increasing complexity of engineering and scientific problems faced by the academia and …

Pre-stack Kirchhoff time migration (PKTM) is one of the most widely used migration
algorithms in seismic imaging area. However, PKTM takes considerable time due to its high …

1.1 Background Due to the nature of computer graphics, GPUs (Graphics Processing Units)
are built for highly parallel tasks. A high throughput is achieved by including a large number …

Uma instalação hidráulica é um conjunto de dispositivos hidromecânicos e tubos com a
função de transportar um fluido. O controle do escoamento deste fluido ocorre por meio de …

Les applications auto-adaptatives, dont le comportement évolue en fonction de
l'environnement, sont un élément clé des systèmes de demain. L'utilisation de matériel …