Memory efficient parallel algorithm for optimal DAG structure search using direct communication

  • Tamada Y
  • 2


    Mendeley users who have this article in their library.
  • N/A


    Citations of this article.


© 2018 Elsevier Inc. We present a novel parallel algorithm that solves the optimal directed acyclic graph search problem using less memory as compared to existing algorithms. Using a dynamic programming approach, the time and space complexity of the problem is found to be O(n⋅2 n ), where n represents the number of vertices. The previous algorithm uses adjacent communication to efficiently exchange data between computation nodes. However, it consumes too much memory, and thus is capable of solving up to n=36. Our novel algorithm, ParaOS-DC, employs direct communication to reduce the memory consumption; this is the main cause of the inefficiency of the previous algorithm. Through computational experiments, we confirmed that our proposed algorithm is much faster than the previous algorithm when memory is insufficient. We also succeeded in solving a problem for n=37 without any constraints, which is the largest problem size solved in literature till date.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Y. Tamada

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free