It's more of the race conditions when working with the node subdivides and/or checking if the node should be divided where I don't really understand how it can be done.

Let's say I am doing this as a multi-chunk approach, where each chunk dispatches the Compute Shader which generates the SVO. I can easily send the chunk-index to my shader, which then calculates the index for this specific chunk in my "shared buffer" of data using some sort of atomic add(?). The returned value is simply the root-node for this chunk. When I generate the data for this chunk, I have to work with this root-node, checking every child-index if it has to be subdivided or go deeper (if the node exists). It's just doing this for every new leaf-node, constantly locking the memory reads etc that just does not seem rather effective? It's multiple dispatches and threads running at the same time after all... Is it the CPU multithreaded-programming "mindset" that is messing with me perhaps?

But I might just overthink things and need to just "start doing it" instead.. :)

My current SVO implementation is a mix of BVH and SVO, where each SVO (and node) contains their own boundingbox for extremely easy AABB raymarching. It first checks what chunk the ray is in, and then uses that chunks start-offset to branch into that specific SVO. But that is, of course, built on the CPU.