Timeline for Parallel transformations tree update
Current License: CC BY-SA 4.0
16 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 7, 2021 at 10:23 | history | edited | Engineer | CC BY-SA 4.0 |
added 130 characters in body
|
| Mar 6, 2021 at 11:58 | comment | added | Engineer | @FoxCanFly Re your doubts: Naturally this solution - and any other we come up with- will be imperfect, because you're wanting to do a task better suited to the CPU, on the GPU... I'm just giving you options. The approach I've given in this solution ensures that every thread / warp gets its own identically-structured dataset to operate on, without conditional branches. I'm not sure, levelwise or not, how you intend to operate on a sparse tree without this, and without using conditionals, or without at least using a pass per level - inefficient. You cannot have it all. It's a trade-off. | |
| Mar 6, 2021 at 11:51 | comment | added | Engineer | @FoxCanFly You can parallelise across a level. 1st though: why access a level at a time when doing a tree at a time is more efficient in terms of cache locality of data? 2nd: not every tree in the forest is going to have the same depth, correct? e.g. some will have no nodes at level 4 - how will you organise sparse data? Same problem as my solution has. 3rd: the only way to guarantee parents/ancestors have been processed before children/descendants, is multiple kernel passes, as you have no guarantees on thread ordering. Do you want the overhead of running multiple kernel passes (per frame)? | |
| Mar 5, 2021 at 13:38 | comment | added | FoxCanFly | As for your last suggestion - the level order traversal. I understand it like traversal the whole forest level by level. I don't understand, why it cannot be parallelized. Why we can't make inner loop (iterating the single level) parallel? | |
| Mar 5, 2021 at 13:36 | comment | added | FoxCanFly | Thank you for the answer. I thought about the structure that you suggest.But I have some doubts about modifying such tree. If i want to add a new child to the node, I have to move the whole array after this child position. Or at least have some free spaces after the every level of the every subtree. Am I right? | |
| Mar 5, 2021 at 11:12 | history | edited | Engineer | CC BY-SA 4.0 |
added 31 characters in body
|
| Mar 5, 2021 at 9:25 | history | edited | Engineer | CC BY-SA 4.0 |
added 233 characters in body
|
| Mar 5, 2021 at 9:14 | history | edited | Engineer | CC BY-SA 4.0 |
deleted 53 characters in body
|
| Mar 5, 2021 at 9:05 | history | edited | Engineer | CC BY-SA 4.0 |
added 1 character in body
|
| Mar 5, 2021 at 8:59 | history | edited | Engineer | CC BY-SA 4.0 |
added 179 characters in body
|
| Mar 5, 2021 at 8:52 | history | edited | Engineer | CC BY-SA 4.0 |
added 77 characters in body
|
| Mar 5, 2021 at 8:45 | history | edited | Engineer | CC BY-SA 4.0 |
added 77 characters in body
|
| Mar 5, 2021 at 8:40 | history | edited | Engineer | CC BY-SA 4.0 |
added 77 characters in body
|
| Mar 5, 2021 at 8:35 | history | edited | Engineer | CC BY-SA 4.0 |
added 77 characters in body
|
| Mar 5, 2021 at 8:30 | history | edited | Engineer | CC BY-SA 4.0 |
added 77 characters in body
|
| Mar 5, 2021 at 8:25 | history | answered | Engineer | CC BY-SA 4.0 |