DocumentCode
273696
Title
Reordering of Prolog programs with AND-parallelism
Author
Gooley, Markian M. ; Wah, Benjamin W.
Author_Institution
Coordinated Sci. Lab., Illinois Univ., Urbana, IL, USA
fYear
1988
fDate
29-31 Aug 1988
Firstpage
219
Lastpage
224
Abstract
A method that allows reordering of Prolog causes without reordering their solutions, called order tracking, is presented. Reordering clauses enables the execution of a program at lower cost, as well as more goals to be run in AND-parallel; order tracking ensures that the reordered clauses behave exactly like their originals. The Markov-chain model is extended for estimating probability and cost, adding order tracking and a model for AND-parallel execution. This allows for estimation of when reordering and AND-parallelism will speed execution and when they will slow it
Keywords
Markov processes; PROLOG; parallel programming; AND-parallelism; Markov-chain model; Prolog clause reordering; cost estimation; goals; order tracking; probability estimation; program execution speed; Automation; Conferences; Costs; Educational institutions; Hardware; Law; Legal factors; Runtime; Testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Languages for Automation: Symbiotic and Intelligent Robots, 1988., IEEE Workshop on
Conference_Location
College Park, MD
Print_ISBN
0-8186-0890-0
Type
conf
DOI
10.1109/LFA.1988.24976
Filename
24976
Link To Document