Adaptive decomposition and remapping algorithms for object-space-parallel direct volume rendering of unstructured grids

Date
2007-01
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Source Title
Journal of Parallel and Distributed Computing
Print ISSN
0743-7315
Electronic ISSN
Publisher
Academic Press
Volume
67
Issue
1
Pages
77 - 99
Language
English
Type
Article
Journal Title
Journal ISSN
Volume Title
Series
Abstract

Object space (OS) parallelization of an efficient direct volume rendering algorithm for unstructured grids on distributed-memory architectures is investigated. The adaptive OS decomposition problem is modeled as a graph partitioning (GP) problem using an efficient and highly accurate estimation scheme for view-dependent node and edge weighting. In the proposed model, minimizing the cutsize corresponds to minimizing the parallelization overhead due to the data communication and redundant computation/storage while maintaining the GP balance constraint corresponds to maintaining the computational load balance in parallel rendering. A GP-based, view-independent cell clustering scheme is introduced to induce more tractable view-dependent computational graphs for successive visualizations. As another contribution, a graph-theoretical remapping model is proposed as a solution to the general remapping problem and is used in minimization of the cell-data migration overhead. The remapping tool RM-MeTiS is developed by modifying the GP tool MeTiS and is used in partitioning the remapping graphs. Experiments are conducted using benchmark datasets on a 28-node PC cluster to evaluate the performance of the proposed models. © 2006 Elsevier Inc. All rights reserved.

Course
Other identifiers
Book Title
Keywords
Adaptive decomposition, Direct volume rendering, Graph partitioning, Object space parallelization, Remapping, Unstructured grids, Adaptive systems, Data structures, Distributed computer systems, Parallel processing systems, Problem solving, Storage allocation (computer)
Citation
Published Version (Please cite this version)