An effective visibility culling method based on cache block

2006 ◽  
Vol 55 (8) ◽  
pp. 1024-1032 ◽  
Author(s):  
Moon-Hee Choi ◽  
Woo-Chan Park ◽  
F. Neelamkavil ◽  
Tack-Don Han ◽  
Shin-Dug Kim
Keyword(s):  
Visibility Culling ◽  
Cache Block

Distributed visibility culling technique for complex scene rendering

2005 ◽  
Vol 16 (5) ◽  
pp. 455-479 ◽  
Author(s):  
Tainchi Lu ◽  
Chenghe Chang
Keyword(s):  
Complex Scene ◽  
Visibility Culling

Research on Optimization and Application of LOD Algorithm in Virtual Reality Visualization of Terrain

2014 ◽  
Vol 687-691 ◽  
pp. 1258-1261
Author(s):  
Jing Sun ◽  
Hong Tao Wang
Keyword(s):  
Virtual Reality ◽  
Real Time ◽  
Large Scale ◽  
Design Work ◽  
Terrain Rendering ◽  
Key Technology ◽  
Progressive Mesh ◽  
Key Technologies ◽  
Methods And Techniques ◽  
Visibility Culling

With the development of computer graphics, real-time rendering-based VF: technology has been applied in more and more fields. LOD is the key technology in large-scale terrain rendering. In this paper, the basic concept of LOD is introduced briefly and some algorithms of LOD in use are mentioned and analyzed; secondly as one of algorithms of LOD, View-Dependent Progressive Mesh algorithm is studied and improved, the result of implementing the large-scale terrain’s LOD by using VDPM is presented. There are key technologies in LOD Large-scale terrain real-time rendering are researched. Relative technologies are presented such as: LOD of the terrain, visibility culling, and cracks eliminate, view-dependent refine, LOD error, technologies of texture etc. Using LOD technology, VR system can greatly reduce the; number of polygons produced in real-time rendering procedure. Finally, we do experimental design work based on the methods and techniques presented by this paper.

scholarly journals Real-Time Large Crowd Rendering with Efficient Character and Instance Management on GPU

2019 ◽  
Vol 2019 ◽  
pp. 1-15
Author(s):  
Yangzi Dong ◽  
Chao Peng
Keyword(s):  
Real Time ◽  
Visual Quality ◽  
Level Of Detail ◽  
Experimental Results ◽  
Visual Appearance ◽  
Fine Grained ◽  
Individual Character ◽  
Visibility Culling ◽  
Rendering Techniques

Achieving the efficient rendering of a large animated crowd with realistic visual appearance is a challenging task when players interact with a complex game scene. We present a real-time crowd rendering system that efficiently manages multiple types of character data on the GPU and integrates seamlessly with level-of-detail and visibility culling techniques. The character data, including vertices, triangles, vertex normals, texture coordinates, skeletons, and skinning weights, are stored as either buffer objects or textures in accordance with their access requirements at the rendering stage. Our system preserves the view-dependent visual appearance of individual character instances in the crowd and is executed with a fine-grained parallelization scheme. We compare our approach with the existing crowd rendering techniques. The experimental results show that our approach achieves better rendering performance and visual quality. Our approach is able to render a large crowd composed of tens of thousands of animated instances in real time by managing each type of character data in a single buffer object.

scholarly journals An Effective Cache Algorithm for Heterogeneous Storage Systems

2013 ◽  
Vol 2013 ◽  
pp. 1-9 ◽  
Author(s):  
Yong Li ◽  
Dan Feng ◽  
Zhan Shi
Keyword(s):  
Cost Analysis ◽  
State Of The Art ◽  
Storage Systems ◽  
Performance Degradation ◽  
Performance Characteristics ◽  
Storage Devices ◽  
Benefit Cost Analysis ◽  
Wide Range ◽  
Benefit Cost ◽  
Cache Block

Modern storage environment is commonly composed of heterogeneous storage devices. However, traditional cache algorithms exhibit performance degradation in heterogeneous storage systems because they were not designed to work with the diverse performance characteristics. In this paper, we present a new cache algorithm called HCM for heterogeneous storage systems. The HCM algorithm partitions the cache among the disks and adopts an effective scheme to balance the work across the disks. Furthermore, it applies benefit-cost analysis to choose the best allocation of cache block to improve the performance. Conducting simulations with a variety of traces and a wide range of cache size, our experiments show that HCM significantly outperforms the existing state-of-the-art storage-aware cache algorithms.

High performance cache block replication using re-reference probability in CMPs

2011 ◽  
Author(s):  
Jinglei Wang ◽  
Dongsheng Wang ◽  
Haixia Wang ◽  
Yibo Xue
Keyword(s):  
High Performance ◽  
Cache Block

scholarly journals Exploiting Data Compression for Adaptive Block Placement in Hybrid Caches

Electronics ◽  
2022 ◽  
Vol 11 (2) ◽  
pp. 240
Author(s):  
Beomjun Kim ◽  
Yongtae Kim ◽  
Prashant Nair ◽  
Seokin Hong
Keyword(s):  
Random Access ◽  
Spin Transfer Torque ◽  
Main Memory ◽  
Spin Transfer ◽  
Access Memory ◽  
Low Leakage ◽  
Block Placement ◽  
On Chip ◽  
Hybrid Caches ◽  
Cache Block

STT-RAM (Spin-Transfer Torque Random Access Memory) appears to be a viable alternative to SRAM-based on-chip caches. Due to its high density and low leakage power, STT-RAM can be used to build massive capacity last-level caches (LLC). Unfortunately, STT-RAM has a much longer write latency and a much greater write energy than SRAM. Researchers developed hybrid caches made up of SRAM and STT-RAM regions to cope with these challenges. In order to store as many write-intensive blocks in the SRAM region as possible in hybrid caches, an intelligent block placement policy is essential. This paper proposes an adaptive block placement framework for hybrid caches that incorporates metadata embedding (ADAM). When a cache block is evicted from the LLC, ADAM embeds metadata (i.e., write intensity) into the block. Metadata embedded in the cache block are then extracted and used to determine the block’s write intensity when it is fetched from main memory. Our research demonstrates that ADAM can enhance performance by 26% (on average) when compared to a baseline block placement scheme.

On Adapting the Cache Block Size in SSD Caches

2021 ◽  
Author(s):  
Nikolaus Jeremic ◽  
Helge Parzyjegla ◽  
Gero Muhl
Keyword(s):  
Block Size ◽  
Cache Block
Sign in / Sign up

Export Citation Format

Share Document