Optimization of Computations on Related Sets in CUDA
<p>Many algorithms for solving problems of analysis and synthesis of complex system structures have a large margin of internal parallelism. However, in their implementation in a specific parallel computing system an acceleration factor can be ultra low. First of all, such behaviour is because...
Main Authors: | G. S. Ivanova, A. A. Golovkov |
---|---|
Format: | Article |
Language: | Russian |
Published: |
MGTU im. N.È. Baumana
2015-01-01
|
Series: | Nauka i Obrazovanie |
Subjects: | |
Online Access: | http://technomag.edu.ru/jour/article/view/160 |
Similar Items
-
Parallel programming technologies on computer complexes
by: S. A. Pryadko, et al.
Published: (2020-09-01) -
Design of a Mutual Exclusion and Deadlock Algorithm in PCBSD – FreeBSD
by: Libertad Caicedo Acosta, et al.
Published: (2014-12-01) -
Evaluating Efficiency of Parallel Algorithms of Transformation Operations with Graph Model
by: G. S. Ivanova, et al.
Published: (2014-01-01) -
A Comparative Study of the Implementation of SJF and SRT Algorithms on the GPU Processor Using CUDA
by: Youness Rtal, et al.
Published: (2021-02-01) -
Developing a High Performance Software Library with MPI and CUDA for Matrix Computations
by: Bogdan Oancea, et al.
Published: (2014-04-01)