Article

Free access

Queue-based multi-processing LISP

Authors:

Richard P. Gabriel,

John McCarthyAuthors Info & Claims

LFP '84: Proceedings of the 1984 ACM Symposium on LISP and functional programming

Pages 25 - 44

https://doi.org/10.1145/800055.802019

Published: 06 August 1984 Publication History

PDF eReader

Abstract

As the need for high-speed computers increases, the need for multi-processors will be become more apparent. One of the major stumbling blocks to the development of useful multi-processors has been the lack of a good multi-processing language—one which is both powerful and understandable to programmers.

Among the most compute-intensive programs are artificial intelligence (AI) programs, and researchers hope that the potential degree of parallelism in AI programs is higher than in many other applications. In this paper we propose multi-processing extensions to Lisp. Unlike other proposed multi-processing Lisps, this one provides only a few very powerful and intuitive primitives rather than a number of parallel variants of familiar constructs.

References

[1]

Gabriel, R. P., Masinter, L. M. Performance of Lisp Systems, Proceedings of the 1982 ACM Symposium on Lisp and Functional Programming, August 1982.

Digital Library

Google Scholar

[2]

Smith, Burton J., A Pipelined, Shared Resource MIMD Computer in Proceedings of the International Conference on Parallel Processors, 1978.

Google Scholar

[3]

Steele, Guy Lewis Jr., and Sussman, Gerald Jay. The Revised Report on SCHEME: A Dialect of LISP. AI Memo 452, Massachusetts Institute of Technology Artificial Intelligence Laboratory, Cambridge, Massachusetts; January, 1978.

Google Scholar

[4]

Steele, Guy Lewis Jr. et. al. Common Lisp Reference Manual, Digital Press, 1984.

Google Scholar

[5]

Sussman, Gerald Jay, and Steele, Guy Lewis Jr. SCHEME: An Interpreter for Extended Lambda Calculus, Technical Report 349, Massachusetts Institute of Technology Artificial Intelligence Laboratory, Cambridge, Massachusetts, December, 1975.

Digital Library

Google Scholar

Cited By

View all

Cortinas CVassena MRusso A(2020)Securing Asynchronous Exceptions2020 IEEE 33rd Computer Security Foundations Symposium (CSF)10.1109/CSF49147.2020.00023(214-229)Online publication date: Jun-2020
https://doi.org/10.1109/CSF49147.2020.00023
Herzeel CCostanza P(2010)Dynamic parallelization of recursive codeACM SIGPLAN Notices10.1145/1932682.186949145:10(377-396)Online publication date: 17-Oct-2010
https://dl.acm.org/doi/10.1145/1932682.1869491
Herzeel CCostanza PCook WClarke SRinard MSullivan KSteinberg D(2010)Dynamic parallelization of recursive codeProceedings of the ACM international conference on Object oriented programming systems languages and applications10.1145/1869459.1869491(377-396)Online publication date: 17-Oct-2010
https://dl.acm.org/doi/10.1145/1869459.1869491
Show More Cited By

Index Terms

Queue-based multi-processing LISP

Recommendations

Queue-based multi-processing Lisp
Standard LISP (reprint)

When it was first formulated in 1960, (1) the programming language LISP was a truly machine independent language. However, even the earliest computer implementation encountered problems in input-output control and the handling of free variables which ...
A self interpreter for BaLinda Lisp

An intepreter for BaLinda Lisp, a parallel Lisp dialect designed for the Biddle machine[1], is presented. The intepreter is itself written in BaLinda Lisp, and is not at present executable. However, it constitutes a detailed specification of the ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

LFP '84: Proceedings of the 1984 ACM Symposium on LISP and functional programming

August 1984

364 pages

ISBN:0897911423

DOI:10.1145/800055

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: 06 August 1984

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 30 of 109 submissions, 28%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

84
Total Citations
View Citations
531
Total Downloads

Downloads (Last 12 months)87
Downloads (Last 6 weeks)19

Reflects downloads up to 04 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Cortinas CVassena MRusso A(2020)Securing Asynchronous Exceptions2020 IEEE 33rd Computer Security Foundations Symposium (CSF)10.1109/CSF49147.2020.00023(214-229)Online publication date: Jun-2020
https://doi.org/10.1109/CSF49147.2020.00023
Herzeel CCostanza P(2010)Dynamic parallelization of recursive codeACM SIGPLAN Notices10.1145/1932682.186949145:10(377-396)Online publication date: 17-Oct-2010
https://dl.acm.org/doi/10.1145/1932682.1869491
Herzeel CCostanza PCook WClarke SRinard MSullivan KSteinberg D(2010)Dynamic parallelization of recursive codeProceedings of the ACM international conference on Object oriented programming systems languages and applications10.1145/1869459.1869491(377-396)Online publication date: 17-Oct-2010
https://dl.acm.org/doi/10.1145/1869459.1869491
Rager DManolios PWilding M(2006)Adding parallelism capabilities to ACL2Proceedings of the sixth international workshop on the ACL2 theorem prover and its applications10.1145/1217975.1217994(90-94)Online publication date: 15-Aug-2006
https://dl.acm.org/doi/10.1145/1217975.1217994
Kawamoto SIto T(2005)Multi-threaded PaiLisp with granularity adaptive parallel executionTheory and Practice of Parallel Programming10.1007/BFb0026566(94-120)Online publication date: 15-Jun-2005
https://doi.org/10.1007/BFb0026566
Ito T(2005)Efficient evaluation strategies for structured concurrency constructs in parallel Scheme systemsParallel Symbolic Languages and Systems10.1007/BFb0023054(22-52)Online publication date: 10-Jun-2005
https://doi.org/10.1007/BFb0023054
Islam NProdromidis ASquillante M(2005)Dynamic partitioning in different distributed-memory environmentsJob Scheduling Strategies for Parallel Processing10.1007/BFb0022297(244-270)Online publication date: 15-Jun-2005
https://doi.org/10.1007/BFb0022297
Bruggeman CDybvig R(2005)A new architecture design paradigm for parallel computing in schemeParallel Symbolic Computing: Languages, Systems, and Applications10.1007/BFb0018665(362-379)Online publication date: 31-May-2005
https://doi.org/10.1007/BFb0018665
Queinnec CDe Roure D(2005)Design of a concurrent and distributed languageParallel Symbolic Computing: Languages, Systems, and Applications10.1007/BFb0018655(233-259)Online publication date: 31-May-2005
https://doi.org/10.1007/BFb0018655
Queinnec C(2005)A concurrent and distributed extension of schemePARLE '92 Parallel Architectures and Languages Europe10.1007/3-540-55599-4_103(431-446)Online publication date: 14-Jul-2005
https://doi.org/10.1007/3-540-55599-4_103
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

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

Cited By

Index Terms

Recommendations

Queue-based multi-processing Lisp

Standard LISP (reprint)

A self interpreter for BaLinda Lisp