1984 Reports
LPS Algorithms: A Critical Analysis
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.
Subjects
Files
-
cucs-113-84.pdf application/pdf 474 KB Download File
More About This Work
- Academic Units
- Computer Science
- Publisher
- Department of Computer Science, Columbia University
- Series
- Columbia University Computer Science Technical Reports, CUCS-113-84
- Published Here
- February 17, 2012