Skip to main navigation Skip to search Skip to main content

A packet based demand/data driven reduction model for the parallel execution of logic programs

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

This paper presents a computational model for Horn-clause logic programs. OR parallelism and a restricted kind of AND parallelism inherent in such programs are exploited. The model is reduction based and utilizes both data driven and demand driven mechanisms for the efficient use of computational resources and control of parallelism. The binding environment of logical variables in a clause is distributed in nature and a form of back-unification is used to reduce communication traffic in a parallel machine architecture. The model is described in a packet reduction framework which makes it possible for implementation on the range of existing parallel machines supporting packet based reduction model for functional programs.

Original languageEnglish
Title of host publicationCONPAR 1986 - Conference on Algorithms and Hardware for Parallel Processing, Proceedings
EditorsWolfgang Handler, Rolf Jeltsch, Otto Lange, Dieter Haupt, Wilfried Juling
Pages214-221
Number of pages8
DOIs
Publication statusPublished - 1986
Externally publishedYes
Event2nd Conference on Algorithms and Hardware for Parallel Processing, CONPAR 1986 - Aachen, Germany
Duration: 17 Sept 1986 → 19 Sept 1986

Publication series

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

Conference

Conference2nd Conference on Algorithms and Hardware for Parallel Processing, CONPAR 1986
Country/TerritoryGermany
CityAachen
Period17/09/86 → 19/09/86

Fingerprint

Dive into the research topics of 'A packet based demand/data driven reduction model for the parallel execution of logic programs'. Together they form a unique fingerprint.

Cite this