Parallel-Inference Algorithms and Research of their Efficiency on Computer Systems


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

This article presents the results of research conducted on cluster systems with multicore nodes to create a method and an algorithm that implement parallel inference in the proof of formulas in first-order logic. The algorithm is based on of J. Robinson’s resolution method of inference. A procedure for its parallelization, which allows one to dynamically control the uniform division of the set of resolvents distributed to the nodes of a computer system for inferring, is proposed. A number of heuristics, which make it possible to significantly reduce the time of implementing inference control decisions, are also introduced. Experiments here show that the effect on acceleration is higher than that of the previously studied parallel-inference algorithms.

作者简介

V. Vagin

Department of Applied Mathematics

编辑信件的主要联系方式.
Email: vagin@appmat.ru
俄罗斯联邦, Moscow, 111250

A. Derevyanko

Department of Applied Mathematics

编辑信件的主要联系方式.
Email: derevyankoanv@gmail.com
俄罗斯联邦, Moscow, 111250

V. Kutepov

Department of Applied Mathematics

编辑信件的主要联系方式.
Email: kutepov@appmat.ru
俄罗斯联邦, Moscow, 111250

补充文件

附件文件
动作
1. JATS XML

版权所有 © Allerton Press, Inc., 2018