The Boyer benchmark at warp speed (1992)
by
Henry G. Baker
| Venue: | In ACM Lisp Pointers, Volume 3, July–September |
| Citations: | 6 - 1 self |
BibTeX
@INPROCEEDINGS{Baker92theboyer,
author = {Henry G. Baker},
title = {The Boyer benchmark at warp speed},
booktitle = {In ACM Lisp Pointers, Volume 3, July–September},
year = {1992},
pages = {13--14}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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. A.
Citations
| 136 | Garbage collection in a large LISP system - Moon - 1984 |
| 100 | Performance and Evaluation of Lisp Systems - Gabriel - 1985 |
| 66 | Tabulation techniques for recursive programs - Bird - 1980 |
| 37 | On programming of arithmetic operations - Ershov - 1959 |
| 30 | Monocopy and associative algorithms in extended Lisp - Goto - 1974 |
| 23 | An Interactive Program Verifier - Deutsch - 1973 |
| 22 | Applicative caching - Keller, Sleep - 1986 |
| 9 | Neun: Implementing and Optimizing Lisp for the Cray - Anderson, Galway, et al. - 1987 |
| 2 | Rewrite Rule Compilation - Boyer - 1986 |
