Observations from Parallelising Three Maximum Common (Connected) Subgraph Algorithms

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [37 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01728184
Contributor : Christine Solnon <>
Submitted on : Saturday, March 10, 2018 - 9:00:13 AM
Last modification on : Tuesday, February 26, 2019 - 4:00:07 PM
Long-term archiving on : Monday, June 11, 2018 - 12:16:36 PM

File

cpaior18.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01728184, version 1

Citation

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⟩

Share

Metrics

Record views

139

Files downloads

171