Exploiting parallelism in tabled evaluations

Juliana Freire, Rui Hu, Terrance Swift, David S. Warren

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper addresses general issues involved in parallelizing tabled evaluations by introducing a model of shared-memory parallelism which we call table-parallelism, and by comparing it to traditional models of parallelizing SLD. A basic architecture for supporting table-parallelism in the framework of the SLG-WAM[14] is also presented, along with an algorithm for detecting termination of sub computations.

Original languageEnglish (US)
Title of host publicationProgramming Languages
Subtitle of host publicationImplementations, Logics and Programs - 7th International Symposium, PLILP 1995, Proceedings
EditorsManuel Hermenegildo, S. Doaitse Swierstra
PublisherSpringer Verlag
Pages115-132
Number of pages18
ISBN (Print)354060359X, 9783540603597
DOIs
StatePublished - Jan 1 1995
Event7th International Symposium on Programming Languages: Implementations, Logics and Programs, PLILP 1995 - Utrecht, Netherlands
Duration: Sep 20 1995Sep 22 1995

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume982
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other7th International Symposium on Programming Languages: Implementations, Logics and Programs, PLILP 1995
CountryNetherlands
CityUtrecht
Period9/20/959/22/95

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Exploiting parallelism in tabled evaluations'. Together they form a unique fingerprint.

Cite this