Skip to main content

The DelPhi Multiprocessor Inference Machine

  • Conference paper
ALPUK92

Part of the book series: Workshops in Computing ((WORKSHOPS COMP.))

Abstract

In 1986 I proposed a new principle of executing Horn Clause programs with low overhead on multiple processors. This method does not involve the sharing of memory or the copying of computation state between processors. Under certain conditions, the method has the remarkable property of executing a given program in the minimum time theoretically required. Such optimal operation is not always possible, but performance of the implemented system is such as to render it of practical use. This paper describes the experience of implementing the method on a network of processors and of executing programs according to the method. This paper is more a retrospective than a tutorial, and so readers are referred to previous papers for introductory material and technical details.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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. H. Alshawi and D.B. Moran. The Delphi model and some preliminary experiments. Proc 5th Conf Symp Log Prog (ed Kowalski and Bowen), MIT Press, 1578–1589.

    Google Scholar 

  2. W.F. Clocksin, 1987. Principles of the DelPhi parallel inference machine. Computer Journal 30(5), 386–391.

    Google Scholar 

  3. W.F. Clocksin, 1988. A technique for translating clausal specifications of numerical methods into efficient programs. Journal of Logic Programming 5, 231–242

    Article  MathSciNet  MATH  Google Scholar 

  4. W.F. Clocksin and H. Alshawi, 1986. A method for efficiently executing Horn Clause programs using multiple processors. Technical Report CCSC-3, SRI International (Cambridge Computer Science Centre).

    Google Scholar 

  5. W.F. Clocksin and H. Alshawi, 1988. A method for efficiently executing Horn Clause programs using multiple processors. New Generation Computing 5, 361–376.

    Article  Google Scholar 

  6. C.S. Klein, 1991. Exploiting or-parallelism in Prolog using multiple sequential machines. PhD dissertation. Reprinted as Technical Report 216, Computer Laboratory, University of Cambridge.

    Google Scholar 

  7. D.H.D. Warren, 1987. OR-parallel execution models of Prolog. Technical Report, Department of Computer Science, University of Manchester.

    Google Scholar 

  8. K.L. Wrench, 1990. A distributed and-or parallel prolog network. PhD dissertation. Available in summary form as Technical Report 212, Computer Laboratory, University of Cambridge.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1993 British Computer Society

About this paper

Cite this paper

Clocksin, W.F. (1993). The DelPhi Multiprocessor Inference Machine. In: Broda, K. (eds) ALPUK92. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3421-3_11

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-3421-3_11

  • Publisher Name: Springer, London

  • Print ISBN: 978-3-540-19783-6

  • Online ISBN: 978-1-4471-3421-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics