Data-Parallel Rasterization of Micropolygons

<a href="https://embed.stanford.edu/iframe/?url=https%3A%2F%2Fpurl.stanford.edu%2Fwx314xy1580" class="su-underline">Show Content</a>

Abstract/Contents

Abstract: We present two data-parallel algorithms for rasterizing micropolygons. Our approaches differ from current techniques by parallelizing across polygons. The first, LOCKSTEP, processes micropolygons in lockstep and runs with high utilization (65%) for a small number of SIMD units, despite variance in the amount of rasterization work for each micropolygon. The second, REPACK, compacts works and is able to maintain high utilization (85%) even for large number of SIMD units. While REPACK operates with high utilization, it incurs overhead from repacking data. We study the performance and utilization of our algorithms on simulated hardware with varying amounts of SIMD units. We make predictions about the overall cost of rasterizing micropolygons in a future real-time system.

Type of resource	text
Date created	2010-01

Author	Luong, Edward
Advisor	Hanrahan, Patrick
Department	Stanford University. Department of Computer Science.

Subject	Raster data > Computer programs
Subject	Image processing > Computer programs
Subject	Computer graphics
Genre	Thesis

Location	https://purl.stanford.edu/wx314xy1580

Use and reproduction: User agrees that, where applicable, content will not be used to identify or to otherwise infringe the privacy or confidentiality rights of individuals. Content distributed via the Stanford Digital Repository may be subject to additional license and use restrictions applied by the depositor.
License: This work is licensed under a Creative Commons Attribution Non Commercial 3.0 Unported license (CC BY-NC).

Preferred Citation: Luong, Edward (2010). Data-Parallel Rasterization of Micropolygons. Stanford Digital Repository. Available at http://purl.stanford.edu/wx314xy1580

Undergraduate Theses, School of Engineering

Loading usage metrics...