PARALLEL BRANCH-AND-BOUND SEARCH IN PARLOG

被引：0

作者：

HUNTBACH, M ^{[1
]}

机构：

[1] UNIV LONDON,QUEEN MARY & WESTFIELD COLL,DEPT COMP SCI,LONDON E1 4NS,ENGLAND

来源：

INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING | 1992年 / 20卷 / 04期

关键词：

CONCURRENCY; LOGIC PROGRAMMING; BRANCH-AND-BOUND SEARCH; PROCESS PRIORITIES;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

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.

引用

页码：299 / 314

页数：16