Comments on: Lisp Fourier Transform Library Faster http://nklein.com/2009/10/lisp-fourier-transform-library-faster/ software development and consulting Sun, 20 May 2012 18:07:58 +0000 hourly 1 http://wordpress.org/?v=3.3.2 By: pat http://nklein.com/2009/10/lisp-fourier-transform-library-faster/comment-page-1/#comment-380 pat Tue, 13 Oct 2009 02:42:13 +0000 http://nklein.com/?p=973#comment-380 For that matter, I should probably rebuild Clozure under Snow Leopard. I also need to get ECL and CMUCL and such running again since I've installed Snow Leopard. For that matter, I should probably rebuild Clozure under Snow Leopard. I also need to get ECL and CMUCL and such running again since I’ve installed Snow Leopard.

]]> By: pat http://nklein.com/2009/10/lisp-fourier-transform-library-faster/comment-page-1/#comment-379 pat Tue, 13 Oct 2009 02:36:58 +0000 http://nklein.com/?p=973#comment-379 No, I didn't bother mentioning that the 512 by 512 in SBCL runs in about 0.25 seconds. And, I never bothered waiting for the 512 by 512 by 16 with Clozure... but here it is... the 512 by 512 by 16 in Clozure takes 131.71 seconds (single-threaded). To be fair, I know there are different ways to declare things so that Clozure knows more of the data types. I haven't spent any time yet trying to make the Clozure run faster. I've been focused on the SBCL until now. Actually, I just kicked my memory-allocation problem with SBCL, so I will probably release a new version tomorrow that does the 512 by 512 in 0.14 seconds under SBCL and does the 512 by 512 by 16 in 3.79 seconds (which used to takes more than 9 seconds in version 1.2 and took more than 25 seconds in version 1.0). The latest version does a 1,048,576 in 0.73 seconds. Bordeaux-FFT does it in 0.57 seconds. So, I'm pretty close now... especially considering where I started. I'll have to look and make sure I'm still spitting out the right answers. If so, then I'll get this released tomorrow and start working on optimizing for other Lisp implementations. I'll push it to git right now though. No, I didn’t bother mentioning that the 512 by 512 in SBCL runs in about 0.25 seconds. And, I never bothered waiting for the 512 by 512 by 16 with Clozure… but here it is… the 512 by 512 by 16 in Clozure takes 131.71 seconds (single-threaded).

To be fair, I know there are different ways to declare things so that Clozure knows more of the data types. I haven’t spent any time yet trying to make the Clozure run faster. I’ve been focused on the SBCL until now.

Actually, I just kicked my memory-allocation problem with SBCL, so I will probably release a new version tomorrow that does the 512 by 512 in 0.14 seconds under SBCL and does the 512 by 512 by 16 in 3.79 seconds (which used to takes more than 9 seconds in version 1.2 and took more than 25 seconds in version 1.0). The latest version does a 1,048,576 in 0.73 seconds. Bordeaux-FFT does it in 0.57 seconds. So, I’m pretty close now… especially considering where I started.

I’ll have to look and make sure I’m still spitting out the right answers. If so, then I’ll get this released tomorrow and start working on optimizing for other Lisp implementations. I’ll push it to git right now though.

]]> By: william lederer http://nklein.com/2009/10/lisp-fourier-transform-library-faster/comment-page-1/#comment-378 william lederer Mon, 12 Oct 2009 23:47:55 +0000 http://nklein.com/?p=973#comment-378 Is it true that the sample matrix is the same between SBCL and Clozure? Since in the SBCL phrase you mention an additonal x16 that is not in the Clozure. If that is true, does that mean that Clozure is faster than SBCL? Is it true that the sample matrix is the same between SBCL and Clozure? Since in the SBCL phrase you mention an additonal x16 that is not in the Clozure.

If that is true, does that mean that Clozure is faster than SBCL?

]]>