|
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
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
{AMH02} Akenine-Möller T., Haines E.: Real-Time Rendering (second edition). A K Peters, Ltd., 2002.
|
| |
2
|
J. H. Conway , N. J. A. Sloane , E. Bannai, Sphere-packings, lattices, and groups, Springer-Verlag New York, Inc., New York, NY, 1987
|
| |
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
|
|
| |
5
|
|
| |
6
|
|
| |
7
|
|
 |
8
|
|
 |
9
|
Homan Igehy , Matthew Eldridge , Pat Hanrahan, Parallel texture caching, Proceedings of the ACM SIGGRAPH/EUROGRAPHICS workshop on Graphics hardware, p.95-106, August 08-09, 1999, Los Angeles, California, United States
[doi> 10.1145/311534.311583]
|
 |
10
|
|
| |
11
|
|
 |
12
|
|
 |
13
|
|
 |
14
|
|
 |
15
|
|
 |
16
|
|
 |
17
|
|
| |
18
|
|
| |
19
|
|
|