Change search
ReferencesLink to record
Permanent link

Direct link
On the Efficiency of Optimising Shallow Backtracking in Prolog
Number of Authors: 1
1990 (English)Report (Refereed)
Abstract [en]

The cost of backtracking has been identified as one of the bottlenecks in achieving peak performance in compiled Prolog programs. Much of the backtracking in Prolog programs is shallow, i.e. is caused by unification failures in the head of a clause when there are more alternatives for the same procedure, and so special treatment of this form of backtracking has been proposed as a significant optimisation. This paper describes a modified WAM which optimises shallow backtracking. Four different implementation approaches are compared. A number of benchmark results are presented, measuring the relative tradeoffs between compilation time, code size, and run time. The results show that the speedup gained by this optimisation can be significant.

Place, publisher, year, edition, pages
Kista, Sweden: Swedish Institute of Computer Science , 1990, 1. , 14 p.
SICS Research Report, ISSN 0283-3638 ; R90:03
National Category
Computer and Information Science
URN: urn:nbn:se:ri:diva-21335OAI: diva2:1041369
Original report number R90003.Available from: 2016-10-31 Created: 2016-10-31

Open Access in DiVA

fulltext(80 kB)3 downloads
File information
File name FULLTEXT01.pdfFile size 80 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 3 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

ReferencesLink to record
Permanent link

Direct link