Hi, I have certain code, which is the implementation of a probabilistic data structure called Bloom filters. For those unfamiliar with this, click here:
http://en.wikipedia.org/wiki/Bloom_filterI'm comparing two different implementations. One is supposed to be faster than the other one, no matter which OS it runs in. So far, either in Ubuntu or Windows, one is faster than the other. BUT:
The problem that makes my head crazy, is, is it possible that the difference in time is huge in Ubuntu (let's say 9 times faster), but only 2 times faster in Windows? is the same code, BUT:
I'm using BCC32 in Windows and GCC in UBuntu. Besides that, I'm using the -O2 option in GCC, but none in Windows (I don't know of any similar). Does anybody knows a similar compiling option in BCC32?
thanx, Miguel
Start Free Trial