Parallel branch-and-bound search in Parlog |
| |
Authors: | Matthew Huntbach |
| |
Affiliation: | (1) Department of Computer Science, Queen Mary and Westfield College, University of London, Mile End Road, E1 4NS London, England |
| |
Abstract: | The concurrent logic languages, of which Parlog is one, have been promoted as a new generation of software languages specifically designed for parallel programming. This paper investigates their application to a search problem commonly used as an illustration of artificial intelligence techniques, the 8-puzzle. It notes that programs written in the concurrent logic languages which do not pay attention to the parallelism can fall into two possible traps: either there is little real parallelism in them due to data dependencies, or there is too much parallelism and any practical architecture will be overwhelmed. A solution which controls the parallelism using user-defined priorities is proposed. This solution has the advantage of being architecture-independent. |
| |
Keywords: | Concurrency logic programming branch-and-bound search process priorities |
本文献已被 SpringerLink 等数据库收录! |
|