You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
PR #113 introduced parallelisation of rmsdwrapper, with the goal of providing a very useful timeout functionality (to avoid hangs in pathological cases where graph isomorphism takes a very long time).
However, the parallelisation over each call is inefficient since the expensive graph isomorphism is computed repeatedly. #113 (comment) describes two potential avenues for more efficient and sensible parallelisation.
Computing the graph isomorphism serially (with timeout) and parallelising over RMSD calculations would also avoid possible clashes with internal parallelisation of the graph isomorphism algorithms.
The text was updated successfully, but these errors were encountered:
PR #113 introduced parallelisation of
rmsdwrapper
, with the goal of providing a very useful timeout functionality (to avoid hangs in pathological cases where graph isomorphism takes a very long time).However, the parallelisation over each call is inefficient since the expensive graph isomorphism is computed repeatedly. #113 (comment) describes two potential avenues for more efficient and sensible parallelisation.
Computing the graph isomorphism serially (with timeout) and parallelising over RMSD calculations would also avoid possible clashes with internal parallelisation of the graph isomorphism algorithms.
The text was updated successfully, but these errors were encountered: