Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
J. Parallel Distrib. Comput. 67 (2006) 7799 www.elsevier.com/locate/jpdc
 

Summary: J. Parallel Distrib. Comput. 67 (2006) 7799
www.elsevier.com/locate/jpdc
Adaptive decomposition and remapping algorithms for object-space-parallel
direct volume rendering of unstructured grids
Cevdet Aykanata,
, B. Barla Cambazoglua
, Ferit Findikb
, Tahsin Kurcc
aComputer Engineering Department, Bilkent University, TR 06800 Bilkent, Ankara, Turkey
bMicrosoft Corporation, Redmond, WA 98052-6399, USA
cThe Ohio State University, Biomedical Informatics Department, Columbus, OH 43210, USA
Received 4 December 2005; received in revised form 31 March 2006; accepted 6 May 2006
Available online 24 July 2006
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-

  

Source: Aykanat, Cevdet - Department of Computer Engineering, Bilkent University

 

Collections: Computer Technologies and Information Sciences