Skip to main content
SpringerLink
Log in

Executing bounded quantifications on shared memory multiprocessors

  • Conference paper
  • First Online:
Progamming Language Implementation and Logic Programming (PLILP 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 714))

Abstract

We present a schema for executing bounded quantifications on shared memory multiprocessors, using the WAM-based abstract machine designed for recursion parallel execution developed by Bevemyr, Lindgren and Millroth. Preliminary results indicate almost linear speed-up on 24 processors for some quantified expressions. The parallelization overhead is low, in the order of 10–15%.

A best speed-up of 34.38 for a bounded quantification program compared with sequential execution of a corresponding recursive program, and 19.18 compared with sequential execution of the bounded quantification, was achieved using 24 processors.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arro, H., Barklund, J. and Bevemyr, J., Parallel Bounded Quantifications-Preliminary Results, to appear in ACM SIGPLAN Notices, 1993.

    Google Scholar 

  2. Barklund, J. and Millroth, H., Providing Concurrency and Iteration in Logic Programming through Bounded Quantifications, in: H. Tanaka (ed.), Proc. Intl. Conf. on Fifth Generation Computer Systems 1992, Ohmsha, Tokyo, 1992.

    Google Scholar 

  3. Barklund, J. and Bevemyr, J., Prolog with Arrays and Bounded Quantifications, in: A. Voronkov (ed.), Proc. 4th Intl. Conf. on Logic Programming and Automated Reasoning, Springer-Verlag, Berlin, 1993.

    Google Scholar 

  4. Bevemyr, J., The Luther WAM Emulator, UPMAIL Technical Report No. 72, Computing Science Dept., Uppsala Univ., 1992.

    Google Scholar 

  5. Bevemyr, J., Lindgren, T. and Millroth, H., Reform Prolog: The Language and its Implementation, to be presented at the International Conference on Logic Programming, 1993.

    Google Scholar 

  6. Bevemyr, J., A Recursion Parallel Prolog Engine, Ph.L. Thesis, Computing Science Dept., Uppsala Univ., 1993.

    Google Scholar 

  7. Millroth, H., Reforming Compilation of Logic Programs, in: V. Saraswat, K. Ueda (eds.) Proc. 1991 Intl. Symp. on Logic Programming, MIT Press, Cambridge, Mass., 1991.

    Google Scholar 

  8. Naish, L., Parallelizing Nu-Prolog, in: R. A. Kowalski and K. A. Bowen (eds.), Proc. Fifth Intl. Conf. and Symp. on Logic Programming, MIT Press, Cambridge, Mass., 1988.

    Google Scholar 

  9. Tang, P. and Yew, P.-C, Processor Self-Scheduling for Multiple Nested Parallel Loops, in: Proc. 1986 Intl. Conf. on Parallel Processing, 1986.

    Google Scholar 

  10. Voronkov, A., Logic Programming with Bounded Quantifiers, in: A. Voronkov (ed.), Logic Programming-Proc. Second Russian Conf. on Logic Programming, LNCS 592, Springer-Verlag, Berlin, 1992.

    Google Scholar 

  11. Voronkov, A. A., Logic programming with bounded quantifiers, Technical Report ECRC-92-29, ECRC, Munich, 1992.

    Google Scholar 

  12. Warren, D. H. D., An Abstract Prolog Instruction Set, SRI Tech. Note 309, SRI International, Menlo Park, CA, USA, 1983.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. UPMAIL, Computing Science Department, Uppsala University, Box 311, S-751 05, Uppsala, Sweden

    Jonas Barklund & Johan Bevemyr

Authors
  1. Jonas Barklund
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Johan Bevemyr
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Maurice Bruynooghe Jaan Penjam

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Barklund, J., Bevemyr, J. (1993). Executing bounded quantifications on shared memory multiprocessors. In: Bruynooghe, M., Penjam, J. (eds) Progamming Language Implementation and Logic Programming. PLILP 1993. Lecture Notes in Computer Science, vol 714. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57186-8_87

Download citation

  • DOI: https://doi.org/10.1007/3-540-57186-8_87

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57186-5

  • Online ISBN: 978-3-540-47945-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation