[comp.lang.prolog] Tech. Reports: AND-parallelism & Intelligent Backtracking

kumar@ut-sally.UUCP (Vipin Kumar) (02/11/88)

The following reports are available:

(1) AND-parallel execution of Logic Programs on a
Shared Memory Multiprocessor : A Summary of Results
by
Yow-Jian Lin and Vipin Kumar

Abstract:
This paper presents the implementation of an AND-parallel execution model of
logic programs on a shared-memory multiprocessor.
The major features of the implementation are (i) dependency analysis
between literals of a clause is done dynamically without incurring
excessive runtime overhead;
(ii) backtracking is done intelligently at the clause level without
incurring any extra cost for the determination of the backtrack literal;
(iii) the implementation is based upon 
the Warren's Abstract Machine (WAM), hence retains most of the
efficiency of the WAM for sequential segments of logic programs.
Preliminary results on Sequent Balance 21000 show that
our parallel implementation
can achieve reasonable speedup 
on dozens of processors.



(2) An Execution Model for Exploiting AND-Parallelism in Logic Programs
by Yow-Jian Lin and Vipin Kumar.
To appear in New Generation Computing, 1988.
Also available as a Tech. Report, Artificial Intelligence Lab,
Computer Science Department, University of Texas, Austin, Texas 78712.



(3) A Data-Dependency Based Intelligent Backtracking Scheme for Prolog
by
Vipin Kumar & Yow-Jian Lin.
To appear in Journal of Logic Programming, 1988.
Also available as a Tech. Report, Artificial Intelligence Lab,
Computer Science Department, University of Texas, Austin, Texas 78712.


US Mail: Dr. Vipin Kumar
         Assistant Professor
         Computer science Department
         University of Texas at Austin
         Austin, TX 78712

Arpanet: kumar@sally.utexas.edu
uucp: ....{harvard,ihnp4}!ut-sally!kumar