Show simple item record

dc.contributor.advisorAykanat, Cevdet
dc.contributor.authorOkuyan, Erkan
dc.date.accessioned2016-01-08T18:10:15Z
dc.date.available2016-01-08T18:10:15Z
dc.date.issued2009
dc.identifier.urihttp://hdl.handle.net/11693/14879
dc.descriptionAnkara : The Department of Computer Engineering and Information Science and the Institute of Engineering and Science of Bilkent Univ., 2009.en_US
dc.descriptionThesis (Master's) -- Bilkent University, 2009.en_US
dc.descriptionIncludes bibliographical references leaves 89-94.en_US
dc.description.abstractThe focus of this work is on parallel volume rendering applications in which renderings with different parameters are successively repeated over the same dataset. The only reason for inter-task interaction is the existence of data primitives that are inputs to several tasks. Both computational structure and expected task execution times may change during successive rendering instances. Change in computational structure means change in the data primitive requirements of tasks. Since the individual processors of a parallel system have a limited storage capacity, we can reserve a limited amount of storage for holding replicas at each processor. For the parallelization of a particular rendering instance, the remapping model should utilize the replication pattern of the previous rendering instance(s) for reducing the communication overhead due to the data replication requirement of the current rendering instance. We propose a two-phase model for solving this problem. The hypergraphpartitioning-based model proposed for the first phase aims to minimize the total message volume that will be incurred due to the replication/migration of input data while maintaining balance on computational and receive-volume loads of processors. The network-flow-based model proposed for the second phase aims to minimize the maximum message volume handled by processors via utilizing the flexibility in assigning send-communication tasks to processors, which is introduced by data replication. The validity of our proposed model is verified on image-space parallelization of a direct volume rendering algorithm.en_US
dc.description.statementofresponsibilityOkuyan, Erkanen_US
dc.format.extentxii, 94 leaves, illustrations, graphicsen_US
dc.language.isoEnglishen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectParallel direct volume renderingen_US
dc.subjectHypergraph partitioningen_US
dc.subjectData replicationen_US
dc.subjectNetwork flowen_US
dc.subjectImage-space parallelizationen_US
dc.subject.lccT385 .O58 2009en_US
dc.subject.lcshComputer graphics.en_US
dc.subject.lcshParallel processing (Electronic computers)en_US
dc.subject.lcshComputational grids (Computer systems)en_US
dc.subject.lcshGraph theory.en_US
dc.titleExploiting replicated data for communication load balancing in image-space parallel direct volume rendering of unstructured gridsen_US
dc.typeThesisen_US
dc.departmentDepartment of Computer Engineeringen_US
dc.publisherBilkent Universityen_US
dc.description.degreeM.S.en_US
dc.identifier.itemidBILKUTUPB109832


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record