article
Using Approximate Computing for the Calculation of Inverse Matrix p-th Roots
published
Michael
Lass
author 241350000-0002-5708-7632
Thomas
Kühne
author 49079
Christian
Plessl
author 161530000-0001-5728-9982
27
department
518
department
304
department
Performance and Efficiency in HPC with Custom Computing
project
Computing Resources Provided by the Paderborn Center for Parallel Computing
project
Approximate computing has shown to provide new ways to improve performance
and power consumption of error-resilient applications. While many of these
applications can be found in image processing, data classification or machine
learning, we demonstrate its suitability to a problem from scientific
computing. Utilizing the self-correcting behavior of iterative algorithms, we
show that approximate computing can be applied to the calculation of inverse
matrix p-th roots which are required in many applications in scientific
computing. Results show great opportunities to reduce the computational effort
and bandwidth required for the execution of the discussed algorithm, especially
when targeting special accelerator hardware.
IEEE2018
eng
Embedded Systems Letters
1943-0663
1943-0671
1703.0228310.1109/LES.2017.2760923
102 33-36
M. Lass, T. Kühne, C. Plessl, Embedded Systems Letters 10 (2018) 33–36.
M. Lass, T. Kühne, and C. Plessl, “Using Approximate Computing for the Calculation of Inverse Matrix p-th Roots,” <i>Embedded Systems Letters</i>, vol. 10, no. 2, pp. 33–36, 2018.
Lass, Michael, et al. “Using Approximate Computing for the Calculation of Inverse Matrix P-Th Roots.” <i>Embedded Systems Letters</i>, vol. 10, no. 2, IEEE, 2018, pp. 33–36, doi:<a href="https://doi.org/10.1109/LES.2017.2760923">10.1109/LES.2017.2760923</a>.
Lass, Michael, Thomas Kühne, and Christian Plessl. “Using Approximate Computing for the Calculation of Inverse Matrix P-Th Roots.” <i>Embedded Systems Letters</i> 10, no. 2 (2018): 33–36. <a href="https://doi.org/10.1109/LES.2017.2760923">https://doi.org/10.1109/LES.2017.2760923</a>.
Lass M, Kühne T, Plessl C. Using Approximate Computing for the Calculation of Inverse Matrix p-th Roots. <i>Embedded Systems Letters</i>. 2018;10(2):33-36. doi:<a href="https://doi.org/10.1109/LES.2017.2760923">10.1109/LES.2017.2760923</a>
Lass, M., Kühne, T., & Plessl, C. (2018). Using Approximate Computing for the Calculation of Inverse Matrix p-th Roots. <i>Embedded Systems Letters</i>, <i>10</i>(2), 33–36. <a href="https://doi.org/10.1109/LES.2017.2760923">https://doi.org/10.1109/LES.2017.2760923</a>
@article{Lass_Kühne_Plessl_2018, title={Using Approximate Computing for the Calculation of Inverse Matrix p-th Roots}, volume={10}, DOI={<a href="https://doi.org/10.1109/LES.2017.2760923">10.1109/LES.2017.2760923</a>}, number={2}, journal={Embedded Systems Letters}, publisher={IEEE}, author={Lass, Michael and Kühne, Thomas and Plessl, Christian}, year={2018}, pages={33–36} }
202017-07-25T14:41:08Z2019-09-19T08:55:06Z