Question about Legion Implementation of Longest Common Subsequence

[Jesse Wang]

Hi all,

I am attempting to program the Longest Common Subsequence problem in Legion using dynamic programming but I am running into issues.

 
The code only seems to work when the base case to go into the serial method is 1/2 of the input size i.e. we only run this code through one recursive step. When using code that has a smaller base case, the code does not function and I receive the following error (in the attachment).

Here is a link to the code
https://drive.google.com/drive/folders/1dmDyzvWAcB-MG-8Z67vLQivRFm21y0Fe?usp=sharing

I appreciate it greatly for your time!

Thank you,
Jesse

[Elliott Slaughter]

Hi Jesse,

It'll be easier for us to help you if you copy-and-paste the error into your email instead of sending a screenshot.

Is there any other part of this error? Did you get a warning or error message before it?

Otherwise this looks like a bug and you can send us an issue with the error message and a full backtrace (in DEBUG mode) to https://github.com/StanfordLegion/legion/issues

--
You received this message because you are subscribed to the Google Groups "Legion Users" group.
To unsubscribe from this group and stop receiving emails from it, send an email to legionusers...@googlegroups.com.
To view this discussion on the web visit https://groups.google.com/d/msgid/legionusers/e048f5de-6209-4241-99a4-739e97d257b8n%40googlegroups.com.

--

Elliott Slaughter

"Don't worry about what anybody else is going to do. The best way to predict the future is to invent it." - Alan Kay