Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Data parallelism in logic programming

  • Conference paper
  • First Online:
Parallel Execution of Logic Programs (PLP 1991)

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

Included in the following conference series:

Abstract

Many researchers have been trying to use the implicit parallelism of logic languages parallelizing the execution of independent clauses. However this approach has the disadvantage of requiring a heavy overhead for processes scheduling and synchronizing, for data migration and for collecting the results. In this paper it is proposed a different approach, the data parallel one. The focus is on large collections of data and the core idea is to parallelize the execution of element-wise operations. The target language is SEL, a Subset Equational Language. An abstract machine for it, the SAM (Subset Abstract Machine), is outlined, which, under certain points of views, belongs to the WAM family. The data parallel structure of the SAM is here explained and some examples of how it works are given. Eventually it is explained the role of abstract analyzers in this framework and it is presented the plan for the future research.

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.

Similar content being viewed by others

References

  1. H. Aït-Kaci. The WAM: A (Real) Tutorial. Digital — Paris Research Laboratory, January 1990.

    Google Scholar 

  2. B. Jayaraman. Implementation of Subset-Equational Programs. The Journal Of Logic Programming, 1991.

    Google Scholar 

  3. B. Jayaraman and A. Nair. Subset-Logic Programming: Application and Implementation. In 5th International Logic Programming Conference, Seattle, August 1988.

    Google Scholar 

  4. J. Marino and G. Succi. Data Structure for the Parallel Execution of Functional Languages. In G. Gries and J. Hartmanis, editors, PARLE '89, pages 346–356. Springer-Verlag, June 1989.

    Google Scholar 

  5. A. Nair. Compilation of Subset-Logic Programs, December 1988. University of North Carolina at Chapel Hill-Master Thesis.

    Google Scholar 

  6. G. Succi and J. Marino. Abstract Analyzers for Data Parallel Declarative Languages. Technical report, DIST — Università di Genova, 1991.

    Google Scholar 

  7. G. Succi and J. Marino. A New Abstract Machine for Subset Equational Languages. Technical report, DIST — Università di Genova, 1991.

    Google Scholar 

  8. G. Succi. Set Representations in a Subset-Equational Language, February 1991. State University of New York at Buffalo-Master Thesis.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DIST - Università di Genova, via Opera Pia 11a, I-16145, Genova, Italia

    Giancarlo Succi & Giuseppe Marino

Authors
  1. Giancarlo Succi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Giuseppe Marino
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

A. Beaumont G. Gupta

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Succi, G., Marino, G. (1991). Data parallelism in logic programming. In: Beaumont, A., Gupta, G. (eds) Parallel Execution of Logic Programs. PLP 1991. Lecture Notes in Computer Science, vol 569. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55038-0_13

Download citation

  • DOI: https://doi.org/10.1007/3-540-55038-0_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55038-9

  • Online ISBN: 978-3-540-46673-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation