Why we need depth-first post-order traversal here?
dmerigou
@chenh1, because we want to use the fact that neighbouring nodes in the post-order traversal of the tree have good locality.
themj
Can processors dynamically share work if one processor runs out of work to do? I'm assuming not since how would it know which work to take from another processor and communicate to that processor to not that work anymore.
nishadg
I think they can do this using work queues and stealing.
Why we need depth-first post-order traversal here?
@chenh1, because we want to use the fact that neighbouring nodes in the post-order traversal of the tree have good locality.
Can processors dynamically share work if one processor runs out of work to do? I'm assuming not since how would it know which work to take from another processor and communicate to that processor to not that work anymore.
I think they can do this using work queues and stealing.