Observations from Parallelising Three Maximum Common (Connected) Subgraph Algorithms - Archive ouverte HAL
Communication Dans Un Congrès Année : 2018

Observations from Parallelising Three Maximum Common (Connected) Subgraph Algorithms

Résumé

We discuss our experiences adapting three recent algorithms for maximum common (connected) subgraph problems to exploit multi-core parallelism. These algorithms do not easily lend themselves to parallel search, as the search trees are extremely irregular, making balanced work distribution hard, and runtimes are very sensitive to value-ordering heuristic behaviour. Nonetheless, our results show that each algorithm can be parallelised successfully, with the threaded algorithms we create being clearly better than the sequential ones. We then look in more detail at the results, and discuss how speedups should be measured for this kind of algorithm. Because of the difficulty in quantifying an average speedup when so-called anomalous speedups (superlinear and sublinear) are common, we propose a new measure called aggregate speedup.
Fichier principal
Vignette du fichier
cpaior18.pdf (8.07 Mo) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01728184 , version 1 (10-03-2018)

Identifiants

  • HAL Id : hal-01728184 , version 1

Citer

Ruth Hoffmann, Ciaran Mccreesh, Samba Ndojh Ndiaye, Patrick Prosser, Craig Reilly, et al.. Observations from Parallelising Three Maximum Common (Connected) Subgraph Algorithms. 15th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR), 2018, Delft, Netherlands. pp.298-315. ⟨hal-01728184⟩
147 Consultations
106 Téléchargements

Partager

More