Productivity- and Performance-aware Parallel Distributed Depth-First Search

Chapel implementation of a Productivity- and Performance-aware Parallel Distributed Depth-First Search algorithm, named P3D-DFS. The latter is a generic algorithm that can be instantiated on numerous tree-based problems. It is based on the DistBag-DFS distributed data structure, which employs an underlying Work Stealing (WS) mechanism to balance workload across multiple Chapel's locales