Am Dienstag, 17. Juni 2008 22:37 schrieb Dan Doel: > I'll attach new, hopefully bug-free versions of the benchmark to this > message.
With -O2 -fvia-C -optc-O3, the difference is small (less than 1%), but today, ByteArr is faster more often. > > Of course, without the list overhead, the ByteArr appears to allocate much > more than Ptr for large arrays, because the n*w byte array shows up in the > heap allocation, whereas the malloced memory does not. None of this should > be a factor in the actual fannkuch benchmark, of course, which only > allocates 3 arrays of size 11. > > Cheers, > -- Dan Cheers, Daniel _______________________________________________ Glasgow-haskell-users mailing list Glasgow-haskell-users@haskell.org http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
