Results 1 
3 of
3
On The Partitionability Of Hierarchical Radiosity
 In IEEE Parallel Visualization And Graphics Sysmposium
, 1999
"... The Hierarchical Radiosity Algorithm (HRA) is one of the most efficient sequential algorithms for physically based rendering. Unfortunately, it is hard to implement in parallel. There exist fairly efficient sharedmemory implementations but things get worst in a distributed memory (DM) environment. ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
(Show Context)
The Hierarchical Radiosity Algorithm (HRA) is one of the most efficient sequential algorithms for physically based rendering. Unfortunately, it is hard to implement in parallel. There exist fairly efficient sharedmemory implementations but things get worst in a distributed memory (DM) environment. In this paper we examine the structure of the HRA in a graph partitioning setting. Various measurements performed on the task access graph of the HRA indicate the existance of several bottlenecks in a potential DM implementation. We compare “optimal ” partitioning results obtained by the partitioning software Metis with a trivial and a spatial partitioning algorithm, and show that the spatial partitioning copes with most of the bottlenecks well. 1
Spatial Partitioning For Hierarchical Radiosity
"... This work resides around the interface of two disciplines in computer science: computer graphics (global illumination) and parallel computing (dynamic partitioning). On the one hand an efficient algorithm for global illumination simulation – hierarchical radiosity – is examined with respect to its c ..."
Abstract
 Add to MetaCart
(Show Context)
This work resides around the interface of two disciplines in computer science: computer graphics (global illumination) and parallel computing (dynamic partitioning). On the one hand an efficient algorithm for global illumination simulation – hierarchical radiosity – is examined with respect to its capability of being parallelized. On the other hand we develop a general tool T for the dynamic partitioning of spatially mapped tasks, that is furthermore analyzed theoretically and experimentally. The hierarchical radiosity algorithm is a special instance of algorithms that can be formulated as a collection of spatially mapped tasks. As a proof of practicability of our tool T we apply the tool to the hierarchical radiosity algorithm and get useful speedup values. Algorithms of other scientific computing areas apparently can benefit the same way from our tool, even though studying this is beyond the scope of this paper. 1
Solving Irregularly Structured Problems Based on Distributed Object Model Abstract
"... This paper presents a distributed object model called MOIDE (Multithreading Objectoriented Infrastructure on Distributed Environment) for solving irregularly structured problems. The model creates an adaptive computing infrastructure for developing and executing irregular applications on distribute ..."
Abstract
 Add to MetaCart
(Show Context)
This paper presents a distributed object model called MOIDE (Multithreading Objectoriented Infrastructure on Distributed Environment) for solving irregularly structured problems. The model creates an adaptive computing infrastructure for developing and executing irregular applications on distributed systems. The infrastructure allows dynamic reconfiguration to match the evolution of irregular computation and available system resources. A unified communication mechanism is built to integrate different communication paths on heterogeneous systems to support efficient communication. Autonomous load scheduling approach is proposed for dynamic load balancing. A runtime system is developed to implement MOIDEbased computing. Applications including Nbody problem, ray tracing, and conjugate gradient are developed to demonstrate the advantages of the model.