ACM - Computers in Entertainment

Parallel culling and sorting based on adaptive static balancing

By Lucas Machado, Bruno Feijó
SPECIAL ISSUE: Games, [Vol. 7, No. 4]

DOI: 10.1145/1658866.1658878

This article presents a new and effective method for parallel octree culling and sorting for multicore systems, using counting sort and based on a new balancing algorithm, called adaptive delayed static balancing. The adaptive nature of the method is governed by a dynamic split level that can adjust the algorithm to new camera positions, keeping a well-balanced workload among the processors. This article also introduces the concept of n-dimensional resource space as a discrete Euclidean space. This work presents a simple and effective thread management system, called MinTMS.

Copyright © 2019. All Rights Reserved

Full text is available in the ACM Digital Library