Parallel direct volume rendering of unstructured grids based on object-space decomposition

buir.supervisorAykanat, Cevdet
dc.contributor.authorFındık, Ferit
dc.date.accessioned2016-01-08T20:14:25Z
dc.date.available2016-01-08T20:14:25Z
dc.date.copyright1997-10
dc.date.issued1997-10
dc.departmentDepartment of Computer Engineeringen_US
dc.descriptionThesis (Master's): Department of Computer Engineering and Information Science and the Institute of Engineering and Science of Bilkent University, 1997.en_US
dc.description Cataloged from PDF version of article.en_US
dc.descriptionIncludes bibliographical references (leaves 62-65).en_US
dc.description.abstractThis work investigates object-space (OS) parallelization of an efficient ray-casting based direct volume rendering algorithm (DVR) for unstructured grids on distributed-memory architectures. The key point for a successful parallelization is to find an OS decomposition which maintains the OS coherency and computational load balance as much as possible. The OS decomposition problem is modeled as a graph partitioning (GP) problem with correct view-dependent node and edge weighting. As the parallel visualizations of the results of parallel engineering simulations are performed on the same machine, OS decomposition, which is necessary for each visualization instance because of the changes in the computational structures of the successive parallel steps, constitutes a typical case of the general remapping problem. A GP-based model is proposed for the solution of the general remapping problem by constructing an augmented remapping graph. The remapping tool RM-MeTiS, developed by modifying and enhancing the original MeTiS package for partitioning the remapping graph, is successfully used in the purposed parallel DVR algorithm. An effective view-dependent cell-clustering scheme is introduced to induce more tractable contracted view-independent remapping graphs for successive visualizations. An efficient estimation scheme with high accuracy is proposed for view-dependent node and edge weighting of the remapping graph. Speedup values as high as 22 are obtained on a Parsytec CC system with 24 processors in the visualization of benchmark volumetric datasets and the proposed DVR algorithm seems to be linearly scalable according to the experimental results.
dc.description.degreeM.S.en_US
dc.description.statementofresponsibilityby Ferit Fındıken_US
dc.format.extentx, 65 leaves, illustrations ; 30 cm.en_US
dc.identifier.itemidBILKUTUPB038878
dc.identifier.urihttp://hdl.handle.net/11693/17897
dc.language.isoEnglishen_US
dc.publisherBilkent Universityen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectParallel direct volume rendering
dc.subjectUnstructured grids
dc.subjectObject-space decomposition
dc.subjectGraph partitioning
dc.subjectRemapping
dc.subjectScalability
dc.titleParallel direct volume rendering of unstructured grids based on object-space decompositionen_US
dc.title.alternativeDüzensiz ızgaraların obje uzayı bölünmesine dayanan paralel hacim görüntülenmesi
dc.typeThesisen_US
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
B038878.pdf
Size:
3.23 MB
Format:
Adobe Portable Document Format
Description:
Full printable version