Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Parallel search benchmark (WIP) #288

Open
wants to merge 6 commits into
base: master
Choose a base branch
from

Conversation

alexfrolov
Copy link
Contributor

Hi!

Here is a very simple test (parallel search) which makes asynchronous parallel search of all reachable vertices from the specified root. In contrast to bfs it does not have level synchronization. And completes when all messages (delegates) are processed.

I used recursive lambda function for implementing it. Not because I wanted to, but rather do not know how to avoid it. May by it is not the right way to do it. I do not know how to pass arguments (parent etc.) to update in this way (usually it is done via capture list, but here it is impossible).

The test is not fully debugged. It crashes with signal 11 in Grappa::impl::LocaleSharedMemory::allocate_aligned, which probably can be caused by stackoverlow. gdb showed backtrace of 1537 frames. What can cause this it? Does grappa create tasks inside other tasks on the same stack?

Any feedback will be much appreciated. Thank you!

@alexfrolov alexfrolov changed the title Parallel search benchmark Parallel search benchmark (WIP) Aug 3, 2016
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

1 participant