Hi Jesus,
On 25/07/2013 11:29, Jesus Aransay wrote:
Jose Divas?n and I wrote a short paper for a Spanish workshop on functional programming ("Taller de Programaci?n Funcional 2013", http://babel.ls.fi.upm.es/tpf2013/) in which we test a SML program obtained with the Isabelle code generator tool to perform the Gauss Jordan elimination algorithm over matrices.
That is interesting work. Is it possible to get a copy of the code you ran for the various tests so I can check this out?
Briefly, the results show that:
- Poly/ML 5.5 performs better than MLton with matrices over Z2 (see page 6);
- MLton behaves better than Poly/ML with matrices whose inputs are
fractions of "IntInf.int" (see page 7);
- Poly/ML 5.2 outperforms MLton over matrices of type "Real.real", but
reaches a segmentation fault with matrices of size 800 * 800 (in computers with a RAM of 4GB). Quite surprisingly for us, Poly/ML 5.5 performs worse than Poly/ML 5.2 over matrices with inputs of type "Real.real".
Did you get the seg fault when you ran it with 5.5 or was this only with 5.2? I'd certainly like to fix any seg faults in the current version. I did find a problem in the 5.5 garbage collector with large arrays that may account for the worse performance compared with 5.2. That was fixed in commit 1705 in SVN but it would be good to check that out.
Anyway, thanks for posting that.
Best regards, David