Subject: Re: [boost] Accelerating algorithms with SIMD - Segmented iterators and alternatives
From: joel falcou (joel.falcou_at_[hidden])
Date: 2010-10-12 14:38:25
On 12/10/10 20:32, Manjunath Kudlur wrote:
>> More on that, I'm eager to know how dynamically geenrating code (in a string
>> ? in a file ? as soem bytecode array ?) THEN
>> running a compiler then executing the resulting binary can beat statically
>> compiled code dealing with vector register.
>> Explain this to me and I convert my self.
> I looked at Intel's array building blocks and tried to understand how
> they were doing JIT. More here :
> Basically, they use a mix of operator overloading and some cleverly
> named macros to make C++ statements "generate" abstract syntax trees
> at run time, then JIT it to SSE supported by thread building blocks.
I can't see how different it is from ET and what are the benefit of
doing static code geenration at runtime...
I must be really dense but I can't see this winning any race ...
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk