Lazy Work Stealing for Continuous Hierarchy Traversal on Deformable Bodies

This study presents the results of research in dynamic load balancing for Continuous Collision Detection (CCD) using Bounding Volumes Hierarchies (BVHs) on Graphics Processing Units (GPUs). Hierarchy traversal is a challenging problem for GPU computing, since the work load of traversal has a very dynamic nature. Current research resulted in methods to dynamically balance load as the traversal is evaluated. Unfortunately, current grid-based GPU computing interfaces are not well suited for this type of computing and load balancing code can generate excessive overhead. This work presents a novel algorithm to address some of the most glaring problems. The algorithm uses the new concept of lazy work stealing, which tries to get the most out of the parallel capabilities of GPUs by greedy work stealing and lazy work evaluation. Also, the algorithm is designed to augment shared memory usage per block and diminish CPU-GPU context exchange penalties.

@InProceedings { DEM14,
  author       = "Silva, Vinicius da and Esperan\c{c}a, Claudio and Marroquim, Ricardo",
  title        = "Lazy Work Stealing for Continuous Hierarchy Traversal on Deformable Bodies",
  booktitle    = "9th International Conference on Computer Graphics Theory and Applications",
  pages        = "430--437",
  year         = "2014",
  publisher    = "SciTePress",
  url          = "http://graphics.tudelft.nl/Publications-new/2014/DEM14"
}