Feature #14328

SIMD vectorization

Added by ahorek (Pavel Rosick√Ĺ) 4 months ago. Updated 4 months ago.

Target version:


in order to make ruby faster, I'd like to propose an optional SIMD optimization for some cases. I want to target SSE2 which is available in all modern x86 processors. (Pentium 4, Athlon 64 and newer).

this is usually automatically handled by GCC during compilation time, but because of dynamic nature of ruby, redefinitions etc. It's very hard to preoptimize it before the actual execution.

use auto-vectorization provided by JIT ( )

GCC can do that, but I'm not sure how reliable and effective it is today

we don't have to do anything, let GCC do the job
bigger scope for optimizations

slower compilation

specialize known bottlenecks by hand

predictable performace
without increased compilation time

code complexity

unfortunatelly using SIMD isn't for free, there's an overhead, it needs a large data set to be effective. It's useful mainly for math operations, sum, min, max, arrays, matrixes, string manipulations etc. There probably won't be any significant benefit for appliactions like Rails.

what do you think about it?


#1 [ruby-core:84832] Updated by naruse (Yui NARUSE) 4 months ago

I had tried to use SIMD in some parts.
But its performance improvement is limited.

Of course it can improve performance so much, but it is only in special use cases.
In usual Ruby handles small data and they can't ignore SIMD overhead.

math operations

Ruby uses GMP if exist.

sum, min, max, arrays, matrixes

Normal array can store any type.
To use SIMD power, the array should be typed array like NArray.
It's not Ruby itself's issue.

string manipulations

I tried to use SSE2 for coderange_scan() in string.c, but it doesn't improve performance so much.

SSE 4.2 STTNI is also interesting but I don't find a good use case which can pay for increasing code complexity.

Also available in: Atom PDF