Abstract
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.
Publisher
Association for Computing Machinery (ACM)
Reference10 articles.
1. Tabulation Techniques for Recursive Programs
2. Boyer R. "Rewrite Rule Compilation". TR AI-194-86-P M.C.C. Austin TX 1986. Boyer R. "Rewrite Rule Compilation". TR AI-194-86-P M.C.C. Austin TX 1986.
3. Deutsch L. Peter. "An Interactive Program Verifier". Xerox PARC TR CSL-73-1 1973. Deutsch L. Peter. "An Interactive Program Verifier". Xerox PARC TR CSL-73-1 1973.
4. On programming of arithmetic operations
5. Gabriel R.P. Performance and Evaluation of Lisp Systems. MIT Press Camb. MA 1985. Gabriel R.P. Performance and Evaluation of Lisp Systems . MIT Press Camb. MA 1985.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献