King, Andy and Shen, Kish and Benoy, Florence
Lower-bound Time-Complexity Analysis of Logic Programs.
In: Maluszynski, Jan, ed.
International Symposium on Logic programming.
MIT Press, pp. 261-276.
(Full text available)
The paper proposes a technique for inferring conditions on goals that, when satisfied, ensure that a goal is sufficiently coarse-grained to warrant parallel evaluation. The method is powerful enough to reason about divide-and-conquer programs, and in the case of quicksort, for instance, can infer that a quicksort goal has a time complexity that exceeds 64 resolution steps (a threshold for spawning) if the input list is of length 10 or more. This gives a simple run-time tactic for controlling spawning. The method has been proved correct, can be implemented straightforwardly, has been demonstrated to be useful on a parallel machine, and, in contrast with much of the previous work on time-complexity analysis of logic programs, does not require any complicated difference equation solving machinery.
- Depositors only (login required):