article

Free access

Restructuring Lisp programs for concurrent execution

Authors:

James R. Larus,

Paul N. HilfingerAuthors Info & Claims

ACM SIGPLAN Notices, Volume 23, Issue 9

Pages 100 - 110

https://doi.org/10.1145/62116.62126

Published: 01 January 1988 Publication History

Abstract

This paper describes the techniques that the program transformation system CURARE uses to restructure Lisp programs for concurrent execution in multiprocessor Lisp systems and discusses the problems inherent in producing concurrent programs in a flexible and dynamic programming language such as Lisp.

CURARE's overall organization is similar to other program restructuring systems: it detects potential conflicts between statements in a program, then transforms the program to improve its concurrent performance, and finally inserts synchronization to ensure the program's concurrent behavior. However, the language and programs that CURARE transforms are very different from the FORTRAN programs that are the traditional targets of program restructuring and so CURARE requires new algorithms and approaches, which are described in this paper.

References

[1]

Donald C. Allen, Seth A. Steinberg, and Lawrence A. Stabile. Recent Developments in Butterfly Lisp. In Proceedings of AAAI-87 Sixlh National Conference on Artificial Intelligence, pages 2--6, July 1987.

[2]

A. J. Bernsteln. Analysis of Programs for Parallel Processing. IEEE Transaelions on Eleelronic Computers, EC-15(5):757-763, October 1966.

[3]

R. S. Bird. Notes on Recursion Elimination. Communications of the A CM, 20(6):434-439, June 1977.

Digital Library

[4]

Michael Burke and Ron Cytron. lnterprocedural Dependence Analysis and Parallelization. in Proceedings of the A CM SIGPLAN '86 Symposium on Compiler Cons~ructiou~ pages 162-175, June 1986.

Digital Library

[5]

J. Darlington and R. M. Burstall. A System which Automatically Improves Programs. A cia Informatica, 6(1):41-60, 1976.

[6]

Jeanne Ferrante, Karl J. Ottenstein, and Joe D. Warren. The Program Dependence Graph and its Use in Optimization. A CM Transactions on Programming Languages and Systems, 9(3):319- 349, July 1987.

Digital Library

[7]

David K. Gifford, Pierre Jouvelot, John M. Lucassen, and Mark A. Sheldon. FX-87 Reference Manual. Technical Report MIT/LCS/TR-407, MIT Laboratory for Computer Science, September 1987.

[8]

Sharon L. Gray. Using Futures to Exploit Parallelism in Lisp. Master's thesis, MIT, February 1986. MS report.

[9]

Robert H. ttalstead, Jr. Multilisp: A Language for Concurrent Symbolic Computation. A CM Transactions on Programming Languages and Systems, 7(4):501-538, October 1985.

Digital Library

[10]

W. Ludwell Harrison, III and David A. Padua. Representing S-Expressions for the Efficient Evaluation of Lisp on Parallel Processors. In Proceedings of the 1986 International Conference on Parallel Processing, pages 703-710, August 1986.

[11]

Susan Horwitz, Jan Prins, and Thomas Reps. Integrating Non-Interfering Versions of Programs. In Conference Record of the Fifteenth Annual A CM Symposium on Principles of Programming Languages, p~ges 133-145, San Diego, California, January 1988.

Digital Library

[12]

G~rard Huet and Bernard Lang. Proving and Applying Program Transformations Expressed with Second-Order Patterns. Acta Iuformatica, 11(1):31-55, 1978.

Digital Library

[13]

Morris J. Katz. ParaTran: A Transparent, Transaction Based Runtime Mechanism for Par: allel Execution of Scheme. Master's thesis, MIT, June 1986.

[14]

Tom Knight. An Architecture for Mostly Functional Languages. In Proceedings of the 1986 A CM Conference on LISP and Functional Programming, pages 105-112, Cambridge, Massachusetts, August 1986.

Digital Library

[15]

Clyde P. Kruskal, Larry Rudolph, and Marc Snir. The Power of Parallel Prefix. IEEE Transactions on Computers, C-34(10):965-968, October 1985.

[16]

James R. Larus and Paul N. Hilfinger. Detecting Conflicts Between Structure A'ccesses. In Proceedings of the SIGPLAN '88 Conference on Programming Language Design and Implementation, June 1988. To appear.

Digital Library

[17]

Samuel P. Midkiff and David A. Padua. Compiler Algorithms for Synchronization. IEEE Transaclions on Compuiers, C-36(12):1485- 1495, December 1987.

Digital Library

[18]

Eugene W. Myers. A Precise Inter-Procedural Data Flow Algorithm. in Conference Record of ~he Eighth Annual A CM Symposium on Principles of Programming Languages, pages 219-230, :I anuary 1981.

Digital Library

[19]

David A. Padua, David J. Kuck, and Duncan H. Lawrie. High-Speed Multiprocessors and Compilation Techniques. IEEE Transactions on Computers, C-29(9):763-776, September 1980.

Digital Library

[20]

Guy L. Steele Jr. and W. Daniel Hillis. Connection Machine LISP" Fine-Grained Parallel Symbolic Processing. In Proceedings of the 1986 ACM Conference on LISP and Functional Programming, pages 279-297, Cambridge~ Massachusetts, August 1986.

Digital Library

[21]

Michael :I. Wolfe. Optimizing Supercompilers for Supercomputers. Technical Report UIUCDCS- R-82-1105, Dept. of Computer Science, Univ. of Illinois at Urbana-Champaign, October 1982. PhD dissertation.

Digital Library

Cited By

Carlisle MRogers AReppy JHendren L(2005)Early experiences with OldenLanguages and Compilers for Parallel Computing10.1007/3-540-57659-2_1(1-20)Online publication date: 31-May-2005
https://doi.org/10.1007/3-540-57659-2_1
Wu PPadua D(2000)Beyond Arrays — A Container-Centric Approach for Parallelization of Real-World Symbolic ApplicationsLanguages and Compilers for Parallel Computing10.1007/3-540-48319-5_13(197-212)Online publication date: 12-May-2000
https://doi.org/10.1007/3-540-48319-5_13
Furnari MPolychronopoulos C(1992)Run-time management of Lisp parallelism and the Hierarchical Task Graph program representationLanguages and Compilers for Parallel Computing10.1007/BFb0038670(266-282)Online publication date: 1992
https://doi.org/10.1007/BFb0038670
Show More Cited By

Index Terms

Restructuring Lisp programs for concurrent execution
1. Computer systems organization
  1. Architectures
    1. Parallel architectures
      1. Multiple instruction, multiple data
2. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language types
  2. Software organization and properties
    1. Contextual software domains
      1. Operating systems
        Process management
        Concurrency control

Recommendations

Restructuring Lisp programs for concurrent execution
PPEALS '88: Proceedings of the ACM/SIGPLAN conference on Parallel programming: experience with applications, languages and systems

This paper describes the techniques that the program transformation system CURARE uses to restructure Lisp programs for concurrent execution in multiprocessor Lisp systems and discusses the problems inherent in producing concurrent programs in a ...
Restructuring Symbolic Programs for Concurrent Execution on
Restructuring symbolic programs for concurrent execution on multiprocessors

Comments

Information & Contributors

Information

Published In

cover image ACM SIGPLAN Notices

ACM SIGPLAN Notices Volume 23, Issue 9

Proceedings of the ACM/SIGPLAN PPEALS 1988

Sept. 1988

246 pages

ISSN:0362-1340

EISSN:1558-1160

DOI:10.1145/62116

Editor:
Richard L. Wexelblat
Philips Labs., Briarcliff Manor, NY

Issue’s Table of Contents

PPEALS '88: Proceedings of the ACM/SIGPLAN conference on Parallel programming: experience with applications, languages and systems
January 1988
246 pages
ISBN:0897912764
DOI:10.1145/62115
Editor:
Richard L. Wexelblat
Philips Labs., Briarcliff Manor, NY

Copyright © 1988 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 January 1988

Published in SIGPLAN Volume 23, Issue 9

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

29
Total Citations
View Citations
459
Total Downloads

Downloads (Last 12 months)89
Downloads (Last 6 weeks)12

Reflects downloads up to 06 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Carlisle MRogers AReppy JHendren L(2005)Early experiences with OldenLanguages and Compilers for Parallel Computing10.1007/3-540-57659-2_1(1-20)Online publication date: 31-May-2005
https://doi.org/10.1007/3-540-57659-2_1
Wu PPadua D(2000)Beyond Arrays — A Container-Centric Approach for Parallelization of Real-World Symbolic ApplicationsLanguages and Compilers for Parallel Computing10.1007/3-540-48319-5_13(197-212)Online publication date: 12-May-2000
https://doi.org/10.1007/3-540-48319-5_13
Furnari MPolychronopoulos C(1992)Run-time management of Lisp parallelism and the Hierarchical Task Graph program representationLanguages and Compilers for Parallel Computing10.1007/BFb0038670(266-282)Online publication date: 1992
https://doi.org/10.1007/BFb0038670
Zedan H(1990)Key references in distributed computer systems 1959–1989Distributed Computer Systems10.1016/B978-0-408-02938-4.50016-4(193-295)Online publication date: 1990
https://doi.org/10.1016/B978-0-408-02938-4.50016-4
Halstead R(1990)New ideas in parallel lisp: Language design, implementation, and programming toolsParallel Lisp: Languages and Systems10.1007/BFb0024149(1-57)Online publication date: 1990
https://doi.org/10.1007/BFb0024149
Larus J(1990)Compiling Lisp programs for parallel executionLisp and Symbolic Computation10.1007/BF018060614:1(29-99)Online publication date: 1-Dec-1990
https://dl.acm.org/doi/10.1007/BF01806061
Giacalone AMishra PPrasad S(1990)Facile: a symmetric integration of concurrent and functional programmingInternational Journal of Parallel Programming10.1007/BF0149121318:2(121-160)Online publication date: 1-Apr-1990
https://dl.acm.org/doi/10.1007/BF01491213
Horwitz SPfeiffer PReps T(1989)Dependence analysis for pointer variablesACM SIGPLAN Notices10.1145/74818.7482124:7(28-40)Online publication date: 21-Jun-1989
https://dl.acm.org/doi/10.1145/74818.74821
Horwitz SPfeiffer PReps T(1989)Dependence analysis for pointer variablesProceedings of the ACM SIGPLAN 1989 conference on Programming language design and implementation10.1145/73141.74821(28-40)Online publication date: 21-Jun-1989
https://dl.acm.org/doi/10.1145/73141.74821
Griswold WOpdyke W(2015)The Birth of Refactoring: A Retrospective on the Nature of High-Impact Software Engineering ResearchIEEE Software10.1109/MS.2015.10732:6(30-38)Online publication date: 28-Oct-2015
https://dl.acm.org/doi/10.1109/MS.2015.107
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents