Published November 13, 2024 | Version 1.2
Software Open

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

Authors/Creators

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

Description

Chapel-based 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-v1.2.zip

Files (8.2 MB)

Name Size Download all
md5:5fccf3d02bde81d7e6dba5e4f2370f6a
8.2 MB Preview Download

Additional details

Related works

Is referenced by
Journal article: 10.1002/cpe.7874 (DOI)

Funding

Agence Nationale de la Recherche
UltraBO - Ultra-scale Computing for solving Big Optimization Problems ANR-22-CE46-0011

Software

Repository URL
https://github.com/Guillaume-Helbecque/P3D-DFS
Programming language
Chapel , C
Development Status
Active