A distributed and parallel backtracking algorithm using virtual time

Simple item page
dc.contributor.authorCleary, Johneng
dc.contributor.authorUnger, Brian Weng
dc.contributor.authorLi, Xiningeng
dc.date.accessioned2008-02-27T16:57:02Z
dc.date.available2008-02-27T16:57:02Z
dc.date.computerscience1999-05-27eng
dc.date.issued1987-10-01eng
dc.description.abstractA significant problem in Logic Programming is how to execute Prolog on multiprocessor and distributed systems. For and-parallel Prolog correctly co-ordinating backtracking across many processors is difficult. An algorithm which fully supports such backtracking is described. The algorithm is based on the Virtual Time technique first described by Jefferson and Sowizral in their Time Warp system for concurrent discrete event simulation. The algorithm preserves the standard semantics of Prolog and does not require additional program control other than directives as to where goals should be run. Because of the logical semantics of Prolog optimizations of the basic Time Warp algorithm are possible. These reduce the number of rollbacks necessary and the amount of recomputation necessary after a rollback.eng
dc.identifier.department1987-281-29eng
dc.identifier.doihttp://dx.doi.org/10.11575/PRISM/30524
dc.identifier.urihttp://hdl.handle.net/1880/45827
dc.language.isoEngeng
dc.publisher.corporateUniversity of Calgaryeng
dc.publisher.facultyScienceeng
dc.subjectComputer Scienceeng
dc.titleA distributed and parallel backtracking algorithm using virtual timeeng
dc.typeunknown
thesis.degree.disciplineComputer Scienceeng
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
1987-281-29.pdf
Size:
1.08 MB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
1.86 KB
Format:
Plain Text
Description:
Download
Collections
Science Research & Publications