[Maxima] Questions for using Lisp language to built the computeralgebra systems.
fateman at cs.berkeley.edu
Tue Sep 18 09:43:14 CDT 2007
Pointers do not point into random memory so much as point to the very next
cell. Compacting GCs make this happen quite often, so that linked lists are
often on the same cache line. Papers on this subject have been written by
Douglas Clarke (many years ago) and more recent papers by others (including
me) show that pointers can be linearized, essentially. If you have any
evidence that cdr-coding would make lisp faster on today's machines, you
should publish these results.
Basically, caches today are quite large relative to what is usually needed
for lisp, even with pointers.
From: maxima-bounces at math.utexas.edu [mailto:maxima-bounces at math.utexas.edu]
On Behalf Of mrkmhrsh at yahoo.co.jp
Sent: Tuesday, September 18, 2007 3:49 AM
To: maxima at math.utexas.edu
Subject: [Maxima] Questions for using Lisp language to built the
I think the most drawback of the computer algebra system built on the Lisp
is that since the Lisp system makes so much pointer references
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the Maxima