Load Balancing Methods For Ray Tracing And Binary Tree Computing Using Pvm
Abbreviated Journal Title
load balancing; ray tracing; binary tree; distributed environment; PVM; workstation cluster; Computer Science, Theory & Methods
We propose efficient load balancing methods for two computational problems namely ray tracing and bottom-up binary tree computing in a distributed environment. In the context of ray tracing, we propose a variant of a static load balancing technique presented in  where the sampling is based on partitioning the object space. Our approach partitions the image instead and uses an efficient scheduling technique for load balancing. Computations carried out on a binary tree arise naturally in image processing and network optimization problems. Many of these problems are solved efficiently in parallel by the popular tree contraction technique . In this paper, we explore the tree-contraction technique in a distributed setting using the grain packing method . Implementations of our algorithms on a cluster of workstations using Parallel Virtual Machine (PVM)  demonstrate near-perfect load balancing.
"Load Balancing Methods For Ray Tracing And Binary Tree Computing Using Pvm" (1995). Faculty Bibliography 1990s. 1460.