Implement parallel levenshtein distance on GPU #1057
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
|
For benchmarking with CUDA, I think you need to synchronize with the calls. |
Oh, do you have any examples or documentations about it? |
|
I update the benchmark results.
I can't open this page, and find another discussions here https://discuss.pytorch.org/t/how-to-measure-time-in-pytorch/26964/5 |
|
Could you use some kind of warmup and print the average time? |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
This PR implements the levenshtein distance on GPU, it can run in batches and has boundary support. From a simple benchmark as follows, you can get quite a lot speedup comparing with CPU.