LPS Algorithms: A Critical Analysis

Lowry, Andy; Taylor, Stephen; Stolfo, Salvatore

We are interested in high speed execution of logic programs using a particular model of parallel computing devices. In a companion paper we present a detailed explanation of current implementation strategies and develop an abstract proof procedure encompassing those algorithms as well as the standard sequential Prolog algorithm. Here we explore a number of alternative strategies and provide a comparative analysis in the context of that abstract procedure. We investigate issues of performance, storage requirements, and applicability of the algorithms under various assumptions concerning the program under execution.



More About This Work

Academic Units
Computer Science
Department of Computer Science, Columbia University
Columbia University Computer Science Technical Reports, CUCS-113-84
Published Here
February 17, 2012