Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Task parallelism for ray tracing on a gpu cluster
Download
index.pdf
Date
2008
Author
Ünlü, Çağlar
Metadata
Show full item record
Item Usage Stats
186
views
69
downloads
Cite This
Ray tracing is a computationally complex global illumination algorithm that is used for producing realistic images. In addition to parallel implementations on commodity PC clusters, recently, Graphics Processing Units (GPU) have also been used to accelerate ray tracing. In this thesis, ray tracing is accelerated on a GPU cluster where the viewing plane is divided into unit tiles. Slave processes work on these tiles in a task parallel manner which are dynamically assigned to them. To decrease the number of ray-triangle intersection tests, Bounding Volume Hierarchies (BVH) are used. It is shown that almost linear speedup can be achieved. On the other hand, it is observed that API and network overheads are obstacles for scalability.
Subject Keywords
Computer enginnering.
,
Ray tracing.
URI
http://etd.lib.metu.edu.tr/upload/12609325/index.pdf
https://hdl.handle.net/11511/17546
Collections
Graduate School of Natural and Applied Sciences, Thesis
Suggestions
OpenMETU
Core
Voxel transformation: scalable scene geometry discretization for global illumination
Yalciner, Bora; Sahillioğlu, Yusuf (Springer Science and Business Media LLC, 2020-10-01)
In real-time computer graphics, efficient discretization of scenes is required in order to accelerate graphics related algorithms such as realistic rendering with indirect illumination and visibility checking. Sparse voxel octree (SVO) is a popular data structure for such a discretization task. Populating an SVO with data is challenging when dynamic object count is high, especially when data per spatial location is large. Problem of populating such trees is adressed with our Voxel Transformation method, whe...
Interactive editing of complex terrains on parallel graphics architectures
Gün, Ufuk; İşler, Veysi; Department of Computer Engineering (2009)
Rendering large terrains on large screens at interactive frame rates is a challenging area of computer graphics. In the last decade, real-time terrain rendering on large screens played a significant role in various simulations and virtual reality systems. To fulfill the demand of these systems, two software tools are developed. The first tool is a Terrain Editor that creates and manipulates large terrains. The second is a Multi-Display Viewer that displays the created terrains on multiple screens. Since the...
Efficient algorithms for convolutional inverse problems in multidimensional imaging
Doğan, Didem; Öktem, Figen S.; Department of Electrical and Electronics Engineering (2020)
Computational imaging is the process of indirectly forming images from measurements using image reconstruction algorithms that solve inverse problems. In many inverse problems in multidimensional imaging such as spectral and depth imaging, the measurements are in the form of superimposed convolutions related to the unknown image. In this thesis, we first provide a general formulation for these problems named as convolutional inverse problems, and then develop fast and efficient image reconstruction algorith...
Error analysis and testing of DRM for frame cameras
Bettemir, Oe. H.; Karslıoğlu, Mahmut Onur; Friedrich, J. (2007-06-16)
A new Differential Rectification Method (DRM) for frame cameras is proposed by Karslioglu and Friedrich [1] for the generation of orthoimages from monoscopic digital images which map every pixel onto a curved surface of reference frame i.e. WGS84. The ellipsoidal geodetic coordinates, of each pixel are calculated directly under the condition that a precise enough elevation model is available avoiding additional earth curvature corrections after the rectification. In this paper, convergence of the differenti...
Implementation of a Monte Carlo method to a two-dimensional particle-in-cell solver using algebraic meshes
ŞENGİL, NEVSAN; Tumuklu, Ozgur; Çelenligil, Mehmet Cevdet (2012-01-01)
Particle-in-cell (PIC) technique is a widely used computational method in the simulation of low density collisionless plasma flows. In this study, a new two-dimensional (2-D) electrostatic particle-in-cell solver is developed that can be applied to non-rectangular configurations.
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
Ç. Ünlü, “Task parallelism for ray tracing on a gpu cluster,” M.S. - Master of Science, Middle East Technical University, 2008.