Re: [boost] SIMD implementation of uBLAS

Subject: Re: [boost] SIMD implementation of uBLAS
From: Karsten Ahnert (karsten.ahnert_at_[hidden])
Date: 2013-05-29 02:27:40

On 05/29/2013 07:33 AM, Aditya Avinash wrote:
> @Gaetano: Thank you for the comments. I'll change accordingly and post it
> back. I am using T because, the code need to run double precision float
> also.
> @Joel: The Boost.SIMD is generalized. Designing algorithms specific to
> uBLAS increases the performance. Odeint have their own simd backend.

odeint has no simd backend, At least i am not aware of an simd backend. 
Having one would be really great.

>
> On Wed, May 29, 2013 at 10:36 AM, Joel Falcou <joel.falcou_at_[hidden]> wrote:
>
>> On 29/05/2013 06:45, Gaetano Mendola wrote:
>>
>>> On 29/05/2013 06.13, Aditya Avinash wrote:
>>>
>>>> Hi, i have developed vector addition algorithm which exploits the
>>>> hardware
>>>> parallelism (SSE implementation).
>>>>
>>>
>>> A few comments:
>>>
>>> - That is not C++ but just C in disguise of C++ code
>>> . SSE1 CTOR doesn't use initialization list
>>> . SSE1 doesn't have a DTOR and the user has to
>>> explicit call the Free method
>>>
>>> - const-correctness is not in place
>>> - The SSE namespace should have been put in a "detail"
>>> namespace
>>> - Use memcpy instead of explicit for
>>> - Why is SSE1 template when it works only when T is a
>>> single-precision, floating-point value ?
>>>
>>>
>>> Also I believe a nice interface whould have been:
>>>
>>> SSE1::vector A(1024);
>>> SSE1::vector B(1024);
>>> SSE1::vector C(1024);
>>>
>>> C = A + B;
>>>
>>>
>>> Regards
>>> Gaetano Mendola
>>>
>>>
>> See our work on Boost.SIMD ...
>>
>>
>>
>> ______________________________**_________________
>> Unsubscribe & other changes: http://lists.boost.org/**
>> mailman/listinfo.cgi/boost<http://lists.boost.org/mailman/listinfo.cgi/boost>
>>
>
>
>