Skip to main content

Abstract

To assess how much faster Lisp programs would run on large multiprocessor systems, several application kernels were modified for parallel execution and simulation of their behavior. The kernels exhibited speed-ups ranging from one to 850 times faster, suggesting that the technique is of no value to a few programs, of great value to a few programs, and of moderate value to most programs. The modifications were originally done manually but now are accomplished by a program. Further manual editing may yield even more parallelism.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. B. Buchanan, and E. Shortliffe, Rule-Based Expert Systems. Reading, MA: Addison-Wesley, 1984.

    Google Scholar 

  2. A. K. Dewdney, “Mandelbrot Sets” (in the column “Computer Recreations”), Scientific American. July 1985.

    Google Scholar 

  3. C. Forgy, A. Gupta, A. Newell, and R. Wedig, “Parallelism in artificial intelligence problem solving: A case study of Hearsay II,” IEEE Trans, on Computers, C-26:98–111, 1977.

    Article  Google Scholar 

  4. R. Gabriel, Performance and Evaluation of Lisp Systems. Cambridge, MA: Press, 1985.

    Google Scholar 

  5. S. Gray, Using futures to exploit parallelism in Lisp, Master’s thesis, MIT, Cambridge, MASS., Feb. 1986.

    Google Scholar 

  6. R. Halstead, “Implementation of Multilisp: Lisp on a multiprocessor,” ACM Symp. on Lisp and Functional Programming, Austin, TX, Aug. 1984.

    Google Scholar 

  7. E. Krall, and P. McGehearty, “A case study of parallel execution of a rule-based expert system,” Int’l. J. Parallel Programming, XV: 1, February 1986.

    Google Scholar 

  8. P. McGehearty, and E. Krall, “Potentials for parallelism of common Lisp programs.” Proc. Sixth Int’l. Confi on Parallel Processing, Aug. 1986.

    Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Kluwer Academic Publishers

About this chapter

Cite this chapter

McGehearty, P.F., Krall, E.J. (1988). Execution of Common Lisp Programs in a Parallel Environment. In: Kowalik, J.S. (eds) Parallel Computation and Computers for Artificial Intelligence. The Kluwer International Series in Engineering and Computer Science, vol 26. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-1989-4_3

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-1989-4_3

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4612-9188-6

  • Online ISBN: 978-1-4613-1989-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics