ACM Home Page
Please provide us with feedback. Feedback
Performance of Lisp systems
Full text PdfPdf (1.45 MB)
Source Conference on LISP and Functional Programming archive
Proceedings of the 1982 ACM symposium on LISP and functional programming table of contents
Pittsburgh, Pennsylvania, United States
Pages: 123 - 142  
Year of Publication: 1982
ISBN:0-89791-082-6
Authors
Sponsors
ACM: Association for Computing Machinery
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGPLAN: ACM Special Interest Group on Programming Languages
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 10,   Downloads (12 Months): 28,   Citation Count: 13
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/800068.802143
What is a DOI?

ABSTRACT

This paper describes the issues involved in evaluating the performance of Lisp systems. We explore the various levels at which quantitative statements can be made about the performance of a Lisp system, giving examples from existing implementations wherever possible. Our thesis is that benchmarking is most effective when performed in conjunction with an analysis of the underlying Lisp implementation and computer architecture. We examine some simple benchmarks which have been used to measure Lisp systems, and examine some of the complexities of evaluating the resulting timings. This paper will explain in detail the technical issues and trade-offs that determine the efficiency and usability of a Lisp implementation; though there will appear to be a plethora of facts, we will only discuss those aspects of a Lisp implementation that we feel are the most important for evaluation. Throughout we will talk about the impact of these issues and trade-offs on benchmarks and benchmarking methodologies.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
3
4
5
 
6
Burton, R. R, et. al. Interlisp-D Overview in "Papers on Interlisp-D", Xerox Palo Alto Research Center, CIS-5 (SSL-80-4), 1981.
7
 
8
Correll, Steven. S-1 Uniprocessor Architecture (SMA-4) in "The S-1 Project 1979 Annual Report", Chapter 4. Lawrence Livermore National Laboratory, Livermore, California, 1979.
9
 
10
Foderaro, J. K., Sklower, K. L. "The FRANZ Lisp Manual", University of California, Berkeley, Berkeley, California, April 1982.
11
12
 
13
 
14
Masinter, L. M., Deutsch, L. P. Local Optimization For a Compiler for Stack-based Lisp Machines in "Papers on Interlisp-D", Xerox Palo Alto Research Center, CIS-5 (SSL-80-4), 1981.
 
15
Steele, Guy Lewis Jr. Data Representations in PDP-10 MacLisp, Proceedings of the 1977 MACSYMA Users' Conference. NASA Scientific and Technical Information Office, Washington, D.C., July 1977.
 
16
Steele, Guy Lewis Jr. Fast Arithmetic in MacLisp, Proceedings of the 1977 MACSYMA Users' Conference. NASA Scientific and Technical Information Office, Washington, D.C., July 1977.
 
17
Steele, Guy Lewis Jr., Sussman, G. J. The Dream of a Lifetime: A Lazy Scoping Mechanism, Massachusetts Institute of Technology AI Memo 527, November 1979.
18
 
19
Teitelman, Warren, et. al. "Interlisp Reference Manual", Xerox Palo Alto Research Center, Palo Alto, California, 1978.
 
20
 
21
Weyhrauch, R. W., Talcott, C. T., Scherlis, W. L., Gabriel, R. P.; personal communication and involvement.
 
22
White, J. L., NIL: A Perspective, Proceedings of the 1979 MACSYMA Users Conference, July 1979.

CITED BY  13

Collaborative Colleagues:
Richard P. Gabriel: colleagues
Larry M. Masinter: colleagues