A Parallel Algorithm for Dot Product over Word-Size Finite Field Using Floating-Point Arithmetic
PEQUAN Team, UPMC University Paris 06, Paris, France
12th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2010
@conference{jean2010parallel,
title={A parallel algorithm for dot product over word-size finite field using floating-point arithmetic},
author={Jean, J. and Graillat, S.},
booktitle={12th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing},
pages={80–87},
year={2010},
organization={IEEE}
}
Recently, parallel computation has become necessary to take full advantage of the gains allowed by Moore’s law. Many scientific and engineering applications exhibit data parallelism but might not make full use of it. Some ubiquitous operations such that the dot product can easily be parallelized and then make good use of available hardware, like multi-core or GPU. In this paper, we provide two slightly different algorithms to perform dot product calculations in a finite field using floating-point arithmetic and implement them on the GPU architecture. To do so, we pack input integers into floating-point numbers and exploit the computational capabilities of GPU to their full extent to get the result efficiently. Using error-free transformations, we show that it is possible to reach speedups between 10 or 40 with the parallel versions, with an algorithm using nearly no modular reduction.
April 10, 2011 by hgpu
