An effective visibility culling method based on cache block

Moon Hee Choi, Woo Chan Park, Francis Neelamkavil, Tack Don Han, Shin Dug Kim

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

As the complexity of 3D scenes is on the increase, the search for an effective visibility culling method has become one of the most important issues to be addressed in the design of 3D rendering processors. In this paper, we propose a new rasterization pipeline with visibility culling; the proposed architecture performs the visibility culling at an early stage of the rasterization pipeline (especially at the traversal stage) by retrieving data in a pixel cache without any significant hardware logics such as the hierarchical z-buffer. If the data to be retrieved does not exist in the pixel cache, the proposed architecture performs a prefetch operation in order to reduce the miss penalty of the pixel cache. That is, the cache miss penalty can be reduced as the transfer of a missed cache block from the frame memory into the pixel cache can be handled simultaneously with the rasterization pipeline executions. Simulation results show that the proposed architecture can achieve a performance gain of about 32 percent compared with the conventional pretexturing architecture and about 7 percent compared to the hierarchical z-buffer visibility scheme.

Original languageEnglish
Pages (from-to)1024-1032
Number of pages9
JournalIEEE Transactions on Computers
Volume55
Issue number8
DOIs
Publication statusPublished - 2006 Aug 1

Fingerprint

Visibility
Cache
Pixels
Pipelines
Pixel
Percent
Penalty
Buffer
Hardware
Data storage equipment
Rendering
Logic
Rasterization
Architecture
Simulation

All Science Journal Classification (ASJC) codes

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computational Theory and Mathematics

Cite this

Choi, Moon Hee ; Park, Woo Chan ; Neelamkavil, Francis ; Han, Tack Don ; Kim, Shin Dug. / An effective visibility culling method based on cache block. In: IEEE Transactions on Computers. 2006 ; Vol. 55, No. 8. pp. 1024-1032.
@article{c0e6974a49f84274bec5d9ba7cf890d2,
title = "An effective visibility culling method based on cache block",
abstract = "As the complexity of 3D scenes is on the increase, the search for an effective visibility culling method has become one of the most important issues to be addressed in the design of 3D rendering processors. In this paper, we propose a new rasterization pipeline with visibility culling; the proposed architecture performs the visibility culling at an early stage of the rasterization pipeline (especially at the traversal stage) by retrieving data in a pixel cache without any significant hardware logics such as the hierarchical z-buffer. If the data to be retrieved does not exist in the pixel cache, the proposed architecture performs a prefetch operation in order to reduce the miss penalty of the pixel cache. That is, the cache miss penalty can be reduced as the transfer of a missed cache block from the frame memory into the pixel cache can be handled simultaneously with the rasterization pipeline executions. Simulation results show that the proposed architecture can achieve a performance gain of about 32 percent compared with the conventional pretexturing architecture and about 7 percent compared to the hierarchical z-buffer visibility scheme.",
author = "Choi, {Moon Hee} and Park, {Woo Chan} and Francis Neelamkavil and Han, {Tack Don} and Kim, {Shin Dug}",
year = "2006",
month = "8",
day = "1",
doi = "10.1109/TC.2006.115",
language = "English",
volume = "55",
pages = "1024--1032",
journal = "IEEE Transactions on Computers",
issn = "0018-9340",
publisher = "IEEE Computer Society",
number = "8",

}

An effective visibility culling method based on cache block. / Choi, Moon Hee; Park, Woo Chan; Neelamkavil, Francis; Han, Tack Don; Kim, Shin Dug.

In: IEEE Transactions on Computers, Vol. 55, No. 8, 01.08.2006, p. 1024-1032.

Research output: Contribution to journalArticle

TY - JOUR

T1 - An effective visibility culling method based on cache block

AU - Choi, Moon Hee

AU - Park, Woo Chan

AU - Neelamkavil, Francis

AU - Han, Tack Don

AU - Kim, Shin Dug

PY - 2006/8/1

Y1 - 2006/8/1

N2 - As the complexity of 3D scenes is on the increase, the search for an effective visibility culling method has become one of the most important issues to be addressed in the design of 3D rendering processors. In this paper, we propose a new rasterization pipeline with visibility culling; the proposed architecture performs the visibility culling at an early stage of the rasterization pipeline (especially at the traversal stage) by retrieving data in a pixel cache without any significant hardware logics such as the hierarchical z-buffer. If the data to be retrieved does not exist in the pixel cache, the proposed architecture performs a prefetch operation in order to reduce the miss penalty of the pixel cache. That is, the cache miss penalty can be reduced as the transfer of a missed cache block from the frame memory into the pixel cache can be handled simultaneously with the rasterization pipeline executions. Simulation results show that the proposed architecture can achieve a performance gain of about 32 percent compared with the conventional pretexturing architecture and about 7 percent compared to the hierarchical z-buffer visibility scheme.

AB - As the complexity of 3D scenes is on the increase, the search for an effective visibility culling method has become one of the most important issues to be addressed in the design of 3D rendering processors. In this paper, we propose a new rasterization pipeline with visibility culling; the proposed architecture performs the visibility culling at an early stage of the rasterization pipeline (especially at the traversal stage) by retrieving data in a pixel cache without any significant hardware logics such as the hierarchical z-buffer. If the data to be retrieved does not exist in the pixel cache, the proposed architecture performs a prefetch operation in order to reduce the miss penalty of the pixel cache. That is, the cache miss penalty can be reduced as the transfer of a missed cache block from the frame memory into the pixel cache can be handled simultaneously with the rasterization pipeline executions. Simulation results show that the proposed architecture can achieve a performance gain of about 32 percent compared with the conventional pretexturing architecture and about 7 percent compared to the hierarchical z-buffer visibility scheme.

UR - http://www.scopus.com/inward/record.url?scp=33746890127&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33746890127&partnerID=8YFLogxK

U2 - 10.1109/TC.2006.115

DO - 10.1109/TC.2006.115

M3 - Article

AN - SCOPUS:33746890127

VL - 55

SP - 1024

EP - 1032

JO - IEEE Transactions on Computers

JF - IEEE Transactions on Computers

SN - 0018-9340

IS - 8

ER -