Playing SIMD

[Iakh via Digitalmars-d]

On Monday, 26 October 2015 at 15:03:12 UTC, Iakh wrote:

> (Binary)Searching in large sorted continuous array e. g. 1 MB 
> of bytes
> 1 MB = 2 ^^ 20 bytes
> Imagine 4 binary levels pass in 4 ticks. So 20 levels in 20 
> ticks. With SIMD last 4 levels would be done in 2 or 3 ticks. 
> For 20 levels 18 - 19 ticks. So overall improvement is 5-10%. 
> Furthermore think of cache and memory pages misses on firs 
> levels.
>
> IMO SIMD needed for unsorted data(strings?) or for trees.

But yeah... Who needs 1000_000 0..256 values(sorted :D )?