Memory Efficient Load Balancing for Distributed Large-Scale Volume Rendering Using a Two-Layered Group Structure

Abstract

We propose a novel compositing pipeline and a dynamic load balancing technique for volume rendering which utilizes a two-layered group structure to achieve effective and scalable load balancing. The technique enables each process to render data from non-contiguous regions of the volume with minimal impact on the total render time. We demonstrate the effectiveness of the proposed technique by performing a set of experiments on a modern GPU cluster. The experiments show that using the technique results in up to a 35.7% lower worst-case memory usage as compared to a dynamic k-d tree load balancing technique, whilst simultaneously achieving similar or higher render performance. The proposed technique was also able to lower the amount of transferred data during the load balancing stage by up to 72.2%. The technique has the potential to be used in many scenarios where other dynamic load balancing techniques have proved to be inadequate, such as during large-scale visualization. key words: large-scale visualization, distributed computing, load balancing, GPU

Accelerating In-Transit Co-Processing for Scientific Simulations Using Region-Based Data-Driven Analysis

“…Load balancing blocks of 3D data sets has been the focus of extensive research [10,[35][36][37][38][39][40]. A load balancing technique can either create a static distribution of the data or dynamically change the distribution based on some variables.…”

Distributed System Application Strategy based on Dynamic Load Balancing Model of Cloud Computing

“…Wallden m et al analyzed and compared several dynamic LB algorithms, such as bee foraging, preference based random sampling and active clustering algorithm. Their analysis shows that with the increase of system diversity, the bee foraging algorithm can give full play to the throughput compared with the other two algorithms [1]. Alam m proposed two static algorithms in cloud environment.…”