Re: [julia-users] Algorithm performance comparison with python

Yes, this is a good example – I reopened the issue because we should do it. On Tue, Mar 8, 2016 at 6:35 PM, Jérémy Béjanin wrote: > On Tuesday, March 8, 2016 at 5:49:05 PM UTC-5, Stefan Karpinski wrote: > >> >> You're writing the same matrix location each time so the

Re: [julia-users] Algorithm performance comparison with python

On Tue, Mar 8, 2016 at 5:30 PM, Jérémy Béjanin wrote: > > Yep, that was my mistake, thanks (strange I thought I had compared the > outputs and they were the same, oh well...). > You're writing the same matrix location each time so the results are the same.

Re: [julia-users] Algorithm performance comparison with python

> > We currently allocate an uninitialized array and then call the bzero > function to fill it with zeros – this takes a long time for large arrays. > We should instead mmap /dev/zero since that allows the kernel to lazily > allocate pages. I suspect this is what NumPy is doing, which in this

Re: [julia-users] Algorithm performance comparison with python

I have. I don't see anything in particular that would help me here... > >

Re: [julia-users] Algorithm performance comparison with python

Hi Jérémy, Have you had the chance to read through the Julia performance tips yet? http://docs.julialang.org/en/release-0.4/manual/performance-tips/ Cheers, Kevin On Tuesday, March 8, 2016, Jérémy Béjanin wrote: > Hello, > > By curiosity, I have translated a

[julia-users] Algorithm performance comparison with python

Hello, By curiosity, I have translated a simple algorithm from python to julia in order to compare their performance (gist here ). I am still a relative newcomer and so am not sure why I am seeing worse performance from julia. The code was