Timeline for Parameter space search routine is too fast?
Current License: CC BY-SA 4.0
17 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 1, 2020 at 13:38 | answer | added | shanedrum | timeline score: 1 | |
| Dec 1, 2020 at 12:29 | history | edited | shanedrum | CC BY-SA 4.0 |
added 952 characters in body
|
| Dec 1, 2020 at 12:17 | history | edited | shanedrum | CC BY-SA 4.0 |
added 952 characters in body
|
| Dec 1, 2020 at 12:02 | comment | added | shanedrum |
Perhaps I should be using CriticalSections? It could be that a subkernel is overwriting the result variable in the ParallelTry argument before it can test if is in fact a result.
|
|
| Dec 1, 2020 at 11:25 | history | edited | shanedrum | CC BY-SA 4.0 |
deleted 46 characters in body
|
| Dec 1, 2020 at 11:03 | history | edited | shanedrum | CC BY-SA 4.0 |
added 469 characters in body; edited tags
|
| Nov 30, 2020 at 19:50 | history | edited | shanedrum | CC BY-SA 4.0 |
added 792 characters in body
|
| Nov 30, 2020 at 19:17 | history | edited | shanedrum | CC BY-SA 4.0 |
added 6 characters in body
|
| Nov 30, 2020 at 17:40 | comment | added | shanedrum |
So I checked my code and Subscript is only used when calculating the function that goes into the routine. There's no instance of Subscript that the search routine sees at any level.
|
|
| Nov 30, 2020 at 17:34 | history | edited | shanedrum | CC BY-SA 4.0 |
deleted 139 characters in body
|
| Nov 30, 2020 at 17:27 | comment | added | shanedrum |
Oh interesting, I didnt know that about Subscript. That's worth checking into, thanks! Also, ya with AppendTo, I definitely am not using it on humongous sets, just on sets the size of the number of parameters. Moreover, the subkernels never call that function, only the master kernel outside of the search routine. Its only used when setting up everything.
|
|
| Nov 30, 2020 at 17:21 | comment | added | shanedrum | Ahh,, Sorry I forgot to remove those from the pasted code. The code on my machine currently has those messages turned on. Those messages are because the search routine hits a certain value of the parameter that make the function undefined, like Coth[0]. The end game is to run the search routine on more reasonablly sized spaces, definitely not a 40 quadrillion point lattice, but more like tens of trillions, or trillions. I just need help finding why the routine is cutting itself short without an abort message like TimeConstrain or something of the sorts, that way I have more confidence in it. | |
| Nov 30, 2020 at 17:14 | comment | added | MarcoB |
I see that you turned various messages off in your code. Try turning them back on: any error messages might hint at the reason for early termination. Other things that stand out are the extensive use of Subscript which may lead to subtle and sneaky malfunctions, and the use of AppendTo, which is often awful for performance (standard advice would be to consider Sow / Reap instead, but those have their own problems in parallel evaluation). Finally, what is your end game? Do you want to fix this code and then run it for a month or longer on your machine or find an alternative?
|
|
| Nov 30, 2020 at 17:02 | history | edited | shanedrum | CC BY-SA 4.0 |
added 14 characters in body; edited title
|
| Nov 30, 2020 at 16:54 | history | edited | shanedrum | CC BY-SA 4.0 |
added 14 characters in body; edited title
|
| Nov 30, 2020 at 16:29 | history | edited | shanedrum | CC BY-SA 4.0 |
added 14 characters in body
|
| Nov 30, 2020 at 16:22 | history | asked | shanedrum | CC BY-SA 4.0 |