Title

Load Balancing Methods For Ray Tracing And Binary Tree Computing Using Pvm

Keywords

Binary tree; Distributed environment; Load balancing; PVM; Ray tracing; Workstation cluster

Abstract

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 [15] 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 [1]. In this paper, we explore the tree-contraction technique in a distributed setting using the grain packing method [9]. Implementations of our algorithms on a cluster of workstations using Parallel Virtual Machine (PVM) [6] demonstrate nearperfect load balancing. © 1995.

Publication Date

1-1-1995

Publication Title

Parallel Computing

Volume

21

Issue

12

Number of Pages

1963-1978

Document Type

Article

Personal Identifier

scopus

DOI Link

https://doi.org/10.1016/0167-8191(95)00049-6

Socpus ID

0029518485 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/0029518485

This document is currently not available here.

Share

COinS