<abstract xmlns="http://www.w3.org/1999/xhtml">

The Parallel and Distributed Computing group belonging to the Integrated Technological Research Complex (CITI). has been engaged in the creation of general-purpose components that support the processing of large volumes of information that characterize the problems involved in parallel computing.
Using the oblivious cache model, which works independently of the computer architecture, and the divide and conquer principle, an algorithm for matrix transposition is implemented to reduce the execution time of this algebraic operation. The algorithm ensures that most of the data content is loaded to the cache for fast processing, and makes the most of its stay in the cache to minimize missed reads and achieve greater speed.
The work includes conclusions and statistical tests carried out from experiments on computers with different architectures, reflecting the superiority of the algorithm that uses oblivious cache from an order of matrix determined according to the characteristics of each PC.
</abstract>

The Parallel and Distributed Computing group belonging to the Integrated Technological Research Complex (CITI). has been engaged in the creation of general-purpose components that support the processing of large volumes of information that characterize the problems involved in parallel computing.
Using the oblivious cache model, which works independently of the computer architecture, and the divide and conquer principle, an algorithm for matrix transposition is implemented to reduce the execution time of this algebraic operation. The algorithm ensures that most of the data content is loaded to the cache for fast processing, and makes the most of its stay in the cache to minimize missed reads and achieve greater speed.
The work includes conclusions and statistical tests carried out from experiments on computers with different architectures, reflecting the superiority of the algorithm that uses oblivious cache from an order of matrix determined according to the characteristics of each PC.

Matrix Transposition Algorithm Using Cache Oblivious

Technological University of Havana José Antonio Echeverría

Journal of Automation, Mobile Robotics and Intelligent Systems

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

{"article-title":"Matrix Transposition Algorithm Using Cache Oblivious"}

The Parallel and Distributed Computing group belonging to the Integrated Technological Research Complex (CITI). has been engaged in the creation of...

Matrix Transposition Algorithm Using Cache Oblivious

Published Online: Mar 14, 2024

Page range: 1 - 7

Received: Jan 11, 2023

Accepted: Mar 18, 2023

DOI: https://doi.org/10.14313/jamris/4-2023/25

Keywords
Cache oblivious, Matrix transposition, Missed readings

© 2023 Samuel Guzmán López et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Matrix Transposition Algorithm Using Cache Oblivious

Published Online: Mar 14, 2024

Page range: 1 - 7

Received: Jan 11, 2023

Accepted: Mar 18, 2023

DOI: https://doi.org/10.14313/jamris/4-2023/25

KeywordsCache oblivious, Matrix transposition, Missed readings

© 2023 Samuel Guzmán López et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Keywords
Cache oblivious, Matrix transposition, Missed readings