Efficient Adaptive Algorithms for Transposing Small and Large Matrices on Symmetric Multiprocessors
Citations Over Time
Abstract
Matrix transpose in parallel systems typically involves costly all-to-all communications. In this paper, we provide a comparative characterization of various efficient algorithms for transposing small and large matrices using the popular symmetric multiprocessors (SMP) architecture, which carries a relatively low communication cost due to its large aggregate bandwidth and low-latency inter-process communication. We conduct analysis on the cost of data sending / receiving and the memory requirement of these matrix-transpose algorithms. We then propose an adaptive algorithm that can minimize the overhead of the matrix transpose operations given the parameters such as the data size, number of processors, start-up time, and the effective communication bandwidth.
Related Papers
- Research and implementation of matrix transpose for real-time SAR imaging system(2011)
- → IKONIC IMAGERY IN THE SEVERELY SUBNORMAL(1972)3 cited
- Study on Matrix Transpose Algorithms(2011)
- → Adaptive Modified Transpose Jacobian Control of a Two-fingered Robotic Hand(2021)
- → Comparison between TRANSPOSE and MTF Algorithm with Closure Property(2023)