A hybrid scheme for detecting AND-parallelism in prolog programs

Authors:
H. Xia;W. K. , Giloi
Affiliations:
GMD-FIRST and TU Berlin, W. Germany;GMD-FIRST and TU Berlin, W. Germany
Venue:
ICS '88 Proceedings of the 2nd international conference on Supercomputing
Year:
1988

Citing 3
Cited 0

Programming in Prolog (2nd ed.)

Programming in Prolog (2nd ed.)
Advanced compiler optimizations for supercomputers

Communications of the ACM - Special issue on parallelism
High performance execution of prolog programs based on a static data dependency analysis (and-parallelism, semi-intelligent backtracking)

High performance execution of prolog programs based on a static data dependency analysis (and-parallelism, semi-intelligent backtracking)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present a hybrid scheme for detecting AND-parallelism in Prolog programs, in which data dependency analysis is conducted partly at runtime and partly at compile time. The philosophy reflected in the hybrid scheme is to do as much as possible at compile time and leave only things that must be dynamically accomplished to runtime. With tolerable runtime overhead, our methodology can achieve sufficient accuracy and can thus remedy the weakness both in dynamic detection and in static data dependency analysis (SDDA). In addition, the hybrid scheme greatly supports the combining exploitation of AND- and OR-parallelism of Prolog.