论文标题
使用Actor模型对定向无环图的平行探索
Parallel Exploration of Directed Acyclic Graphs using the Actor Model
论文作者
论文摘要
在本文中，我们描述了一种从图形的一个或多个“根”开始的定向无环图的通用方案。我们的方案是为具有以下属性的图形设计的，（i）在任何节点上发现邻居需要非平凡的计算，这不是一个简单的查找； （ii）一旦处理了一个节点，就会发现其所有邻居； （iii）每个节点可以通过多个路径发现，但只能处理一次。几个计算问题可以简化为遍历此类图，目标是探索图形并构建遍历路线图。为了证明我们计划在达到并行性时实现速度的有效性的概念，我们使用Easal方法实施了平行探索装配景观的方案。
In this paper we describe a generic scheme for the parallel exploration of directed acyclic graphs starting from one or more `roots' of the graph. Our scheme is designed for graphs with the following properties, (i) discovering neighbors at any node requires a non-trivial amount of computation, it is not a simple lookup; (ii) once a node is processed, all its neighbors are discovered; (iii) each node can be discovered through multiple paths, but should only be processed once. Several computational problems can be reduced to traversing such graphs, where the goal is to explore the graph and build a traversal roadmap. As a proof of concept for the effectiveness of our scheme at achieving speedup due to parallelism, we implement the scheme for the parallel exploration of assembly landscape using the EASAL methodology.
