ACM Home Page
Please provide us with feedback. Feedback
A parallel virtual machine for efficient scheme compilation
Full text PdfPdf (1.35 MB)
Source Conference on LISP and Functional Programming archive
Proceedings of the 1990 ACM conference on LISP and functional programming table of contents
Nice, France
Pages: 119 - 130  
Year of Publication: 1990
ISBN:0-89791-368-X
Authors
Marc Feeley  Brandeis University, Waltham, MA
James S. Miller  Brandeis University, Waltham, MA
Sponsors
INRIA : Institut Natl de Recherche en Info et en Automatique
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
SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 10,   Downloads (12 Months): 44,   Citation Count: 8
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/91556.91606
What is a DOI?

ABSTRACT

Programs compiled by Gambit, our Scheme compiler, achieve performance as much as twice that of the fastest available Scheme compilers. Gambit is easily ported, while retaining its high performance, through the use of a simple virtual machine (PVM). PVM allows a wide variety of machine-independent optimizations and it supports parallel computation based on the future construct. PVM conveys high-level information bidirectionally between the machine-independent front end of the compiler and the machine-dependent back end, making it easy to implement a number of common back end optimizations that are difficult to achieve for other virtual machines. PVM is similar to many real computer architectures and has an option to efficiently gather dynamic measurements of virtual machine usage. These measurements can be used in performance prediction for ports to other architectures as well as design decisions related to proposed optimizations and object representations.


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.

 
2
Joel Bartlett. $chm~e->g a portable Scheme-to-C compiler. Technical Report 8911, Digital Equipment Corp. Western Research Lab., 1989.
 
3
John Befall, Edmund Goodhue, Chris Hanson, Howie Shrobe,. Richard M. Stallman, and Gerald Jay Sussman. The Scheme-81 architecture- system and chip. in Paul Penfield Jr., editor, Proc. of the MiT Confer. ence on Advanced Research in VLSi~ Dedham, Mass., 1982. Artech House.
 
4
 
5
J6r6me Chailloux. La machine LLM3. Rapport interne du projet vlsi, INRIA, May 1984. Corresponds to LeLisp version 15.
 
6
 
7
Martin L. Griss and Anthony C. Hearn. A portable LISP compiler. Software Practice and Experience, 11:541-605, 1981.
8
9
 
10
Jack Holloway, Guy Lewis Steele Jr., Gerald Jay Sussman, and Alan Bell. The Scheme-79 chip. Technical Report AI Memo 559, Mass. Inst. of Technology, Artificial intelligence Laboratory, 1980.
11
 
12
Mass. inst. of Technology, Cambridge, MA. MIT Scheme Reference, Scheme Release 7, 1988.
 
13
James Miller. MtdtiScheme: A Parallel Processing System Based on MIT Scheme. PhD thesis, Mass. Inst. of Technology, August 1987. Available as MIT LCS/TR/402.
 
14
 
15
James Miller and Christopher Hanson. IEEE Draft Standard for the Programming Language Scheme. iEEE. forthcoming.
 
16
 
17
Guillermo Rozas. Liar, an Algol-like compiler for Scheme. Bachelor's thesis, Mass. Inst. of Technology, 1984.
 
18
Guy Lewis Steele Jr. Rabbit: A compiler for Scheme. Master's thesis, Mass. Inst. of Technology, 1978.

CITED BY  8

Collaborative Colleagues:
Marc Feeley: colleagues
James S. Miller: colleagues