Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/142088
Title: Efficient realization of householder transform through algorithm-architecture co-design for acceleration of QR factorization
Authors: Merchant, Farhad
Vatwani, Tarun
Chattopadhyay, Anupam
Raha, Soumyendu
Nandy, Soumitra Kumar
Narayan, Ranjani
Keywords: Engineering::Computer science and engineering
Issue Date: 2018
Source: Merchant, F., Vatwani, T., Chattopadhyay, A., Raha, S., Nandy, S. K., & Narayan, R. (2018). Efficient realization of householder transform through algorithm-architecture co-design for acceleration of QR factorization. IEEE Transactions on Parallel and Distributed Systems, 29(8), 1707-1720. doi:10.1109/tpds.2018.2803820
Journal: IEEE Transactions on Parallel and Distributed Systems
Abstract: QR factorization is a ubiquitous operation in many engineering and scientific applications. In this paper, we present efficient realization of Householder Transform (HT) based QR factorization through algorithm-architecture co-design where we achieve performance improvement of 3-90x in-terms of Gflops/watt over state-of-the-art multicore, General Purpose Graphics Processing Units (GPGPUs), Field Programmable Gate Arrays (FPGAs), and ClearSpeed CSX700. Theoretical and experimental analysis of classical HT is performed for opportunities to exhibit higher degree of parallelism where parallelism is quantified as a number of parallel operations per level in the Directed Acyclic Graph (DAG) of the transform. Based on theoretical analysis of classical HT, an opportunity to re-arrange computations in the classical HT is identified that results in Modified HT (MHT) where it is shown that MHT exhibits 1.33x times higher parallelism than classical HT. Experiments in off-the-shelf multicore and General Purpose Graphics Processing Units (GPGPUs) for HT and MHT suggest that MHT is capable of achieving slightly better or equal performance compared to classical HT based QR factorization realizations in the optimized software packages for Dense Linear Algebra (DLA). We implement MHT on a customized platform for Dense Linear Algebra (DLA) and show that MHT achieves 1.3x better performance than native implementation of classical HT on the same accelerator. For custom realization of HT and MHT based QR factorization, we also identify macro operations in the DAGs of HT and MHT that are realized on a Reconfigurable Data-path (RDP). We also observe that due to re-arrangement in the computations in MHT, custom realization of MHT is capable of achieving 12 percent better performance improvement over multicore and GPGPUs than the performance improvement reported by General Matrix Multiplication (GEMM) over highly tuned DLA software packages for multicore and GPGPUs which is counter-intuitive.
URI: https://hdl.handle.net/10356/142088
ISSN: 1045-9219
DOI: 10.1109/TPDS.2018.2803820
Rights: © 2018 IEEE. All rights reserved.
Fulltext Permission: none
Fulltext Availability: No Fulltext
Appears in Collections:SCSE Journal Articles

Google ScholarTM

Check

Altmetric


Plumx

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.