Parallel Tiled Code for Computing General Linear Recurrence Equations
In this article, we present a technique that allows us to generate parallel tiled code to calculate general linear recursion equations (GLRE). That code deals with multidimensional data and it is computing-intensive. We demonstrate that data dependencies available in an original code computing GLREs...
Main Authors: | Włodzimierz Bielecki, Piotr Błaszyński |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2021-08-01
|
Series: | Electronics |
Subjects: | |
Online Access: | https://www.mdpi.com/2079-9292/10/17/2050 |
Similar Items
-
High-Performance Computation of the Number of Nested RNA Structures with 3D Parallel Tiled Code
by: Piotr Błaszyński, et al.
Published: (2023-02-01) -
Efficient Subpopulation Based Parallel TLBO Optimization Algorithms
by: Alejandro García-Monzó, et al.
Published: (2018-12-01) -
Improving Security at Work with Software that Uses OpenMP
by: P. S. Polishuk
Published: (2010-03-01) -
Load Balancing Strategies for Slice-Based Parallel Versions of JEM Video Encoder
by: Héctor Migallón, et al.
Published: (2021-11-01) -
A partition strategy to speedup Goldstein’s phase unwrapping algorithm on a multi-core architecture
by: Abel López-Ocaña, et al.
Published: (2018-02-01)