Efficient SIMD numerical interpolation

Authors:
Hossein Ahmadi;Maryam Moslemi Naeini;Hamid Sarbazi-azad
Affiliations:
Sharif University of Technology, Tehran, Iran;Sharif University of Technology, Tehran, Iran;IPM School of Computer Science, Tehran, Iran
Venue:
HPCC'05 Proceedings of the First international conference on High Performance Computing and Communications
Year:
2005

Citing 4
Cited 1

Lagrange interpolation on a processor tree with ring connections

Journal of Parallel and Distributed Computing
Cost-optimal parallel B-spline interpolations

ICS '90 Proceedings of the 4th international conference on Supercomputing
Advanced Computer Architecture: Parallelism,Scalability,Programmability

Advanced Computer Architecture: Parallelism,Scalability,Programmability
Internet Streaming SIMD Extensions

Computer

Importance of explicit vectorization for CPU and GPU software performance

Journal of Computational Physics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper reports the results of SIMD implementation of a number of interpolation algorithms on common personal computers. These methods fit a curve on some given input points for which a mathematical function form is not known. We have implemented four widely used methods using vector processing capabilities embedded in Pentium processors. By using SSE (streaming SIMD extension) we could perform all operations on four packed single-precision (32-bit) floating point values simultaneously. Therefore, the running time decreases three times or even more depending on the number of points and the interpolation method. We have implemented four interpolation methods using SSE technology then analyzed their speedup as a function of the number of points being interpolated. A comparison between characteristics of developed vector algorithms is also presented.