A Methodology for Speeding up MVM for Regular, Toeplitz and Bisymmetric Toeplitz Matrices

KELEFOURAS, Vasileios, KRITIKAKOU, Angeliki, SIOUROUNIS, Konstantinos and GOUTIS, Costas (2014). A Methodology for Speeding up MVM for Regular, Toeplitz and Bisymmetric Toeplitz Matrices. Journal of Signal Processing Systems, 77 (3), 241-255.

Full text not available from this repository.
Official URL: https://link.springer.com/article/10.1007/s11265-0...
Link to published version:: https://doi.org/10.1007/s11265-013-0812-9


The Matrix Vector Multiplication algorithm is an important kernel in most varied domains and application areas and the performance of its implementations highly depends on the memory utilization and data locality. In this paper, a new methodology for MVM including different types of matrices, i.e. Regular, Toeplitz and Bisymmetric Toeplitz, is presented in detail. This methodology achieves higher execution speed than the software state of the art library, ATLAS (speedup from 1.2 up to 4.4), and other conventional software implementations, for both general (SIMD unit is used) and embedded processors. This is achieved by fully and simultaneously exploiting the combination of software and hardware parameters as one problem and not separately.

Item Type: Article
Departments - Does NOT include content added after October 2018: Faculty of Science, Technology and Arts > Department of Computing
Identification Number: https://doi.org/10.1007/s11265-013-0812-9
Page Range: 241-255
Depositing User: Vasileios Kelefouras
Date Deposited: 05 Apr 2018 13:29
Last Modified: 18 Mar 2021 15:19
URI: https://shura.shu.ac.uk/id/eprint/18336

Actions (login required)

View Item View Item


Downloads per month over past year

View more statistics