[GSoC 2018] Benchmarking Haskell graph libraries

Previous Topic Next Topic
 
classic Classic list List threaded Threaded
1 message Options
Reply | Threaded
Open this post in threaded view
|

[GSoC 2018] Benchmarking Haskell graph libraries

Alexandre Moine
[ Results are here:
https://github.com/haskell-perf/graphs/tree/master/results/ ]

Hi,

I am french 2nd year student in maths and computer sciences and I am
running a {Google,Haskell} Summer of Code now.

One of my goals is to write a benchmarking suite for graphs libraries in
Haskell (Fgl, Alga, Containers and Hash-Graph) and I reached a state
where I can produce reasonable numbers.

If you are interested, I have wrote a little blog article explaining the
results I obtained:
https://blog.nyarlathotep.one/2018/07/benchmarking-haskell-graph-libraries/

Feel free to comment or to send feedback on the Github :)

--
Alexandre Moine
_______________________________________________
Haskell-Cafe mailing list
To (un)subscribe, modify options or view archives go to:
http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell-cafe
Only members subscribed via the mailman list are allowed to post.