[Haskell-cafe] Crypto-api performance

Johan Brinch brinchj at gmail.com
Wed May 4 08:56:52 CEST 2011

On Tue, May 3, 2011 at 23:14, Daniel Fischer
<daniel.is.fischer at googlemail.com> wrote:
> did you notice that the comment says 128KB strings for ps and lps, but they
> are in fact 1MB strings:
> -- 128KB strings
> ps = B.replicate (2^20) 0
> lps = L.replicate (2^20) 0
> ? If not, the throughput would look much better, wouldn't it?

Ah, I failed to mention this in my previous mail. I changed the test
values from 128KB to 1MB to see if it would help the throughput (by
lowering overhead in the framework). So I've already compensated for
this in the MB/s calculations.

Nice catch, though :-)

Johan Brinch

More information about the Haskell-Cafe mailing list