Tuning Technique for Multiple Precision Dense Matrix Multiplication using Prediction of Computational Time
Mathematical Software
2017-10-06 v1
Abstract
Although reliable long precision floating-point arithmetic libraries such as QD and MPFR/GMP are necessary to solve ill-conditioned problems in numerical simulation, long precision BLAS-level computation such as matrix multiplication has not been fully optimized because tuning costs are very high compared to IEEE float and double precision arithmetic. In this study, we develop a technique to shorten this tuning time by using prediction of computational times in several block sizes for the blocking algorithm, and then selecting the fastest matrix multiplication method for tuning multiple precision dense real matrix multiplication in various precisions, matrix sizes, and degrees of parallelization.
Cite
@article{arxiv.1710.01839,
title = {Tuning Technique for Multiple Precision Dense Matrix Multiplication using Prediction of Computational Time},
author = {Tomonori Kouya},
journal= {arXiv preprint arXiv:1710.01839},
year = {2017}
}