Performance and evaluation of LISP systems
Performance and evaluation of LISP systems
ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series
Common LISP: the language (2nd ed.)
Common LISP: the language (2nd ed.)
Tabulation Techniques for Recursive Programs
ACM Computing Surveys (CSUR)
On programming of arithmetic operations
Communications of the ACM
Garbage collection in a large LISP system
LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
Lively linear Lisp: “look ma, no garbage!”
ACM SIGPLAN Notices
The Boyer benchmark meets linear logic
ACM SIGPLAN Lisp Pointers
Generational garbage collection and the radioactive decay model
Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation
An experimental study of renewal-older-first garbage collection
Proceedings of the seventh ACM SIGPLAN international conference on Functional programming
Function memoization and unique object representation for ACL2 functions
ACL2 '06 Proceedings of the sixth international workshop on the ACL2 theorem prover and its applications
| Hi-index | 0.00 |
We show how to speed up the Boyer Benchmark by an order of magnitude (46 X faster than the Cray-1) on a Common Lisp system (80860-based OKIstation) using better programming techniques. The resulting program fits nicely within next generation on-chip caches and kills almost all potential parallelism, thus becoming worthless as a general-purpose Lisp benchmark.