Hexagonal storage scheme for interleaved frame buffers and textures
Pages 33 - 40
Abstract
This paper presents a storage scheme which statically assigns pixel/texel coordinates to multiple memory banks in order to minimize frame buffer and texture memory access load imbalance. In this scheme, the pixels stored in a particular memory bank are placed at the center and the vertices of hexagons packed in the frame buffer By making these hexagons close to regular so that the pixel placement is uniform and isotropic, frame buffer and texture memory accesses are evenly distributed over the memory banks. The analysis of memory access patterns in rendering typical 3D graphics scenes shows that the hexagonal storage scheme can reduce rendering performance degradation due to bank conflicts by an average of 10% compared to the traditional rectangular storage scheme.
References
[1]
{AMH02} Akenine-Möller T., Haines E.: Real-Time Rendering (second edition). A K Peters, Ltd., 2002.
[2]
{CS98} Conway J. H., Sloane N. J. A.: Sphere Packings, Lattices and Groups (3rd edition). Springer-Verlag, New York, 1998.
[3]
{Dee93} Deering M. F.: Data complexity for virtual reality: where do all the triangles go? In IEEE Virtual Reality Annual International Symposium (1993), pp. 357--363.
[4]
{Fuc77} Fuchs H.: Distributing a visible surface algorithm over multiple processors. In the ACM Annual Conference (1977), pp. 449--451.
[5]
{FvDFH90} Foley J. D., Van Dam A., Feiner S. K., Hughes J. F.: Computer Graphics: Principles and Practice (2nd edition). Addison-Wesley, 1990.
[6]
{Gla94} Glassner A. S.: Principles of Digital Image Synthesis. Morgan Kaufmann Publishers, Inc., 1994.
[7]
{Har94} Harper, III D. T.: A multiaccess frame buffer architecture. IEEE Trans. Comput. 43, 5 (May 1994), 618--622.
[8]
{HG97} Hakura Z. S., Gupta A.: The design and analysis of a cache architecture for texture mapping. In the 24th Annual International Symposium on Computer Architecture (1997), pp. 108--120.
[9]
{IEH99} Igehy H., Eldridge M., Hanrahan P.: Parallel texture caching. In SIGGRAPH/Eurographics Workshop on Graphics Hardware (1999), pp. 95--106.
[10]
{IEP98} Igehy H., Eldridge M., Proudfoot K.: Prefetching in a texture cache architecture. In SIGGRAPH/Eurographics Workshop on Graphics Hardware (1998), pp. 133--142.
[11]
{MCEF94} Molnar S., Cox M., Ellsworth D., Fuchs H.: A sorting classification of parallel rendering. IEEE CG&A 14, 4 (July 1994), 23--32.
[12]
{MM00} McCormack J., McNamara R.: Tiled polygon traversal using half-plane edge functions. In SIGGRAPH/Eurographics Workshop on Graphics Hardware (2000), pp. 15--21.
[13]
{Mue95} Mueller C.: The sort-first rendering architecture for high-performance graphics. In the Symposium on Interactive 3D Graphics (1995), pp. 75--85.
[14]
{MWM01} McCool M. D., Wales C., Moule K.: Incremental and hierarchical Hilbert order edge equation polygon rasterization. In SIGGRAPH/Eurographics Workshop on Graphics Hardware (2001), pp. 65--72.
[15]
{NK96} Nishimura S., Kunii T. L.: VC-1: A scalable graphics computer with virtual local frame buffer. In SIGGRAPH 96 (1996), pp. 365--372.
[16]
{Par80} Parke F. I.: Simulation and expected performance analysis of multiple processor z-buffer systems. Computer Graphics 14, 3 (July 1980), 48--56.
[17]
{PH89} Potmesil M., Hoffert E. M.: The Pixel Machine: A parallel image computer. Computer Graphics 23, 3 (July 1989), 69--78.
[18]
{Tyt00} Tytkowski K. T.: Hexagonal raster for computer graphic. In IEEE International Conference on Information Visualization 2000 (2000), pp. 69--73.
[19]
{Wei96} Wei B.: Comments on "a multiaccess frame buffer architecture". IEEE Trans. Comput. 45, 7 (July 1996), 862.
Index Terms
- Hexagonal storage scheme for interleaved frame buffers and textures
Recommendations
eDRAM-based tiered-reliability memory with applications to low-power frame buffers
ISLPED '14: Proceedings of the 2014 international symposium on Low power electronics and designEmbedded DRAM (eDRAM) is becoming more and more popular as a low-cost alternative to on-chip SRAM. eDRAM is particularly attractive for frame buffers in video applications with ever increasing screen resolutions. However, eDRAM suffers short retention ...
A case for small row buffers in non-volatile main memories
ICCD '12: Proceedings of the 2012 IEEE 30th International Conference on Computer Design (ICCD 2012)DRAM-based main memories have read operations that destroy the read data, and as a result, must buffer large amounts of data on each array access to keep chip costs low. Unfortunately, system-level trends such as increased memory contention in multi-...
A DRAM/SRAM Memory Scheme for Fast Packet Buffers
We address the design of high-speed packet buffers for Internet routers. We use a general DRAM/SRAM architecture for which previous proposals can be seen as particular cases. For this architecture, large SRAMs are needed to sustain high line rates and a ...
Comments
Information & Contributors
Information
Published In
Copyright © 2005 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 30 July 2005
Check for updates
Qualifiers
- Article
Conference
GH05
Sponsor:
Acceptance Rates
Overall Acceptance Rate 37 of 94 submissions, 39%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 333Total Downloads
- Downloads (Last 12 months)2
- Downloads (Last 6 weeks)1
Reflects downloads up to 03 Sep 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in