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
When using the memory checking tool developed for #59, we noted that frequent heap checking (MallocCheckHeapEach set to 6) causes the K_{3,3} search to run substantially slower than the other extensions. This suggests that the implementation uses dynamically allocated memory during its execution. It would be good to look through the code to find those allocations and make some stories here to convert them to allocations during gp_InitGraph() and similar locations so that there is less memory churn during algorithm execution.
The text was updated successfully, but these errors were encountered:
When using the memory checking tool developed for #59, we noted that frequent heap checking (
MallocCheckHeapEach
set to 6) causes theK_{3,3}
search to run substantially slower than the other extensions. This suggests that the implementation uses dynamically allocated memory during its execution. It would be good to look through the code to find those allocations and make some stories here to convert them to allocations duringgp_InitGraph()
and similar locations so that there is less memory churn during algorithm execution.The text was updated successfully, but these errors were encountered: