I'm teaching a junior-level algorithms course, and assigned my students to implement three different matrix-multiplication algorithms and benchmark them. So I had to do it myself too :-)
In untyped Racket, most of the runs took seconds or minutes, but others (only twice as large, so I would expect roughly 8 times the run-time) have been running for days without result. So I decided to try porting everything to TR, to see whether that saved any significant (presumably constant-factor) time. Once I'd gotten everything to type-check in TR, I revised the untyped version to resemble the typed version as closely as possible. The results so far: the typed version is taking 20-30 times longer than the untyped version. Huh? I've installed the optimization coach, and am looking through its recommendations. For the untyped version, it suggested a couple of inlinings. For the typed version, nothing. Stephen Bloch sbl...@adelphi.edu GPG key at http://adelphi.edu/sbloch/sbloch.pubkey.asc
PGP.sig
Description: This is a digitally signed message part
____________________ Racket Users list: http://lists.racket-lang.org/users
