Parallel Exploration of Directed Acyclic Graphs using the Actor Model

TL;DR

This paper presents a generic parallel scheme for exploring directed acyclic graphs with complex neighbor discovery, implemented for assembly landscape exploration to demonstrate speedup through parallelism.

Contribution

It introduces a novel parallel exploration scheme for DAGs with complex neighbor discovery, applicable to various computational problems.

Findings

Achieved speedup in exploring assembly landscapes.

Demonstrated the scheme's effectiveness for complex neighbor discovery.

Applicable to multiple graph traversal problems.

Abstract

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.