>>>>> "Thomas" == Thomas Fischbacher <[EMAIL PROTECTED]> writes:
Thomas> My apologies for this message - I should have done a bit more thinking
Thomas> before hacking...
Thomas> (1) Yes, there _is_ a speed gain by implementing evaluation
Thomas> "at compile time" - which may seem a bit strange, considering the
Thomas> tremendous amount of instruction-level parallelism in current processors,
Thomas> but you can expect roughly about 20% for a 10-th order polynomial with
Thomas> nonsparse coefficients.
How did you arrive at this conclusion? CMUCL with and without
"compile-time" evaluation? Really just curious.
CMUCL isn't particularly smart about array references and doesn't do
any kind of instruction scheduling, so I would guess (wildly) that
cmucl would not beath C++. Maybe equal, but not faster. Unless you
take advantage of some special structure of the polynomial, perhaps.
Ray
This communication is confidential and intended solely for the addressee(s). Any
unauthorized review, use, disclosure or distribution is prohibited. If you believe
this message has been sent to you in error, please notify the sender by replying to
this transmission and delete the message without disclosing it. Thank you.
E-mail including attachments is susceptible to data corruption, interruption,
unauthorized amendment, tampering and viruses, and we only send and receive e-mails on
the basis that we are not liable for any such corruption, interception, amendment,
tampering or viruses or any consequences thereof.
