Name
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. |
Year | DOI | Venue |
|---|---|---|
1995 | 10.1016/0167-8191(95)00049-6 | Parallel Computing |
Keywords | Field | DocType |
binary tree,ray tracing,workstation cluster,pvm,distributed environment,binary tree computing,load balancing,bottom up,load balance | Computational problem,Distributed Computing Environment,Load balancing (computing),Scheduling (computing),Computer science,Ray tracing (graphics),Parallel computing,Binary image,Binary tree,Optimization problem | Journal |
Volume | Issue | ISSN |
21 | 12 | Parallel Computing |
Citations | PageRank | References |
2 | 0.43 | 11 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chandra N. Sekharan | 1 | 105 | 12.77 |
| Vineet Goel | 2 | 46 | 4.36 |
| R. Sridhar | 3 | 50 | 5.10 |