[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
[Gcl-devel] Re: Can Windows CL compilers be as fast as CMUCL ?
From: |
Camm Maguire |
Subject: |
[Gcl-devel] Re: Can Windows CL compilers be as fast as CMUCL ? |
Date: |
19 Feb 2005 16:48:15 -0500 |
User-agent: |
Gnus/5.09 (Gnus v5.9.0) Emacs/21.2 |
The following message is a courtesy copy of an article
that has been posted to comp.lang.lisp as well.
Greetings! GCL is pretty competitive with CMUCL performance-wise in
my experience, and is supported on Windows.
Take care,
Wade Humeniuk <address@hidden> writes:
> Marc Battyani wrote:
>
> > Does not look very slow.
> > OK those declaration are not pretty but you only need them in some parts.
> >
>
> Well it does look slow to me. With vector based CPU instructions that
> routine could be reduced to one instruction. On the vector based
> machines I was familiar with (the old CYBER 205) there was a single
> machine instruction to multiply a vector by a scalar. I assume the
> newer x86 instructions provide something similar. Perhaps if
> the Lisp vendors provided an API to embed machine instructions
> directly and allow some low level access to get at the internal
> representation of vectors, then this would all be academic.
>
> Wade
>
--
Camm Maguire address@hidden
==========================================================================
"The earth is but one country, and mankind its citizens." -- Baha'u'llah
[Prev in Thread] |
Current Thread |
[Next in Thread] |
- [Gcl-devel] Re: Can Windows CL compilers be as fast as CMUCL ?,
Camm Maguire <=