|
Boost : |
Subject: Re: [boost] Accelerating algorithms with SIMD - Segmented iteratorsand alternatives
From: Robert Ramey (ramey_at_[hidden])
Date: 2010-10-15 14:06:04
David Abrahams wrote:
>> By the way, I did run a comparison between a segmented iteration,
>> with nested for-loops, and a flattened iteration. I was very much
>> surprised in the runtime difference. It obviously depends on the
>> operation you do per iteration, but for just incrementing a counter,
>> the difference was 2 or 3 orders of magnitude. Needless to say, I'm
>> more convinced of the value of exposing the segmentation of data
>> structures now.
2 or 3 orders of magnitude? 100 to 1000 times faster? is that right?
Robert Ramey
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk