Info: Zenodo’s user support line is staffed on regular business days between Dec 23 and Jan 5. Response times may be slightly longer than normal.

There is a newer version of the record available.

Published November 17, 2022 | Version 1.0
Software Open

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

Creators

  • 1. Université de Lille, CNRS/CRIStAL UMR 9189, Inria Lille-Nord Europe
  • 2. Inria Lille-Nord Europe
  • 3. Université du Luxembourg, FSTM
  • 4. Université du Luxembourg, DCS-FSTM/SnT

Description

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.

Files

P3D-DFS-main.zip

Files (87.0 kB)

Name Size Download all
md5:6d6a965370843bdb3854dce995dcd0b2
87.0 kB Preview Download