ACM Home Page
Please provide us with feedback. Feedback
Parallel execution of sequential scheme with ParaTran
Full text PdfPdf (1.06 MB)
Source Conference on LISP and Functional Programming archive
Proceedings of the 1988 ACM conference on LISP and functional programming table of contents
Snowbird, Utah, United States
Pages: 28 - 39  
Year of Publication: 1988
ISBN:0-89791-273-X
Authors
Pete Tinker  Rockwell International Science Center, Thousand Oaks, CA
Morry Katz  Rockwell International Science Center, Thousand Oaks, CA
Sponsors
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): 2,   Downloads (12 Months): 19,   Citation Count: 10
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/62678.62682
What is a DOI?

ABSTRACT

This paper describes a system called ParaTran for executing sequential Scheme in parallel. It supports arbitrary side effects without requiring user annotations. The ParaTran runtime system detects and corrects data dependency violations using an automatic history and rollback mechanism. ParaTran is first described by analogy with Time Warp, a system for distributed simulation; this description is followed by a discussion of ParaTran's implementation and presentation of preliminary results.


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
K.M. Chandy and J. Misra. Distributed simulation: a case study in design and verification of distributed programs. IEEE Transactions on Software Engineering, SE-5(5):440-452, 1979.
 
3
Richard M. Fujimoto. Performance measurements of distributed simulation strategies. In Dislribuied Simulation Conference, Society for Computer Simulation, San Diego, CA, February 1988 (to appear).
4
5
6
 
7
W. Ludwell Harrison IIi. Compiling Lisp for Evaluation on a Tightly Coupled Multiprocessor. PhD thesis, University of Illinois, Urbana- Champaign, March 1986.
8
 
9
Morris J. Katz. ParaTran: A Transparent, Transaction Based Runiime Mechanism for Parallel Execution of Scheme. Master's thesis, MIT, Cambridge, MA, June 1986.
10
 
11
D.J. Kuck, R.H. Kuhn, B. Leasure, and M. Wolfe. Analysis and transformation of programs for parallel computation. In Fourth International Computer Software and Applications Conference, October 1980.
12
 
13
Greg Lomow, John Cleary, Brian Unger, and Darrin West. A performance study of Time Warp. In Distributed Simulation Conference, Society for Computer Simulation, San Diego, CA, February 1988 (to appear).
 
14
James Slocum Miller. MultiScheme: A Parallel Processing System Based on MIT Scheme. PhD thesis, MIT, August 1987.
15
 
16
Jonathan Rees and Williiam Clinger et al. Revised 3 Report on the Algorithmic Language Scheme. AI Memo 848a, MIT, September 1986.
 
17
Curtis Scott. Butterfly Lisp Reference Manual. BBN Laboratories, Cambridge, MA, April 1986.
 
18
Seth Steinberg et al. Butterfly Lisp system. In Proceedings of the AAAI, 1986.

CITED BY  10